• Home
  • Search
  • Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming
  • Cite Icon14
  • https://doi.org/10.3390/app132312562Copy DOI Icon

Solving the Distributed Permutation Flow-Shop Scheduling Problem Using Constrained Programming

Show More
  • Abstract
  • Highlights & Summary
  • PDF
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

The permutation flow-shop scheduling problem is a classical problem in scheduling that aims at identifying the optimal sequence of jobs that should be processed in a number of machines in an effort to minimize makespan or some other performance criterion. The distributed permutation flow-shop scheduling problem adds multiple factories where copies of the machines exist and asks for minimizing the makespan on the longest-running location. In this paper, the problem is approached using Constraint Programming and its specialized scheduling features, such as interval variables and non-overlap constraints, while a novel heuristic is proposed for computing lower bounds. Two constraint programming models are proposed: one that solves the Distributed Permutation Flow-shop Scheduling problem, and another one that drops the constraint of processing jobs under the same order for all machines of each factory. The experiments use an extended public dataset of problem instances to validate the approach’s effectiveness. In the process, optimality is proved for many problem instances known in the literature but has yet to be proven optimal. Moreover, a high speed of reaching optimal solutions is achieved for many problems, even with moderate big sizes (e.g., seven factories, 20 machines, and 20 jobs). The critical role that the number of jobs plays in the complexity of the problem is identified and discussed. In conclusion, this paper demonstrates the great benefits of scheduling problems that stem from using state-of-the-art constraint programming solvers and models that capture the problem tightly.

Loading PDF

Similar Papers
  • PDF
  • Research Article
  • Citations27

A new solution to distributed permutation flow shop scheduling problem based on NASH Q-Learning

  • Sep 30, 2021
  • Advances in Production Engineering & Management
  • J.F Ren +2
  • Conference Article
  • Citations7

The distributed permutation flowshop scheduling problem: A genetic algorithm approach

  • Jan 01, 2015
  • Yan Li +1
  • Research Article
  • Citations226

An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem

  • May 14, 2013
  • International Journal of Production Economics
  • Sheng-Yao Wang +3
  • Research Article
  • Citations13

Towards a Distributed Implementation of Chemical Reaction Optimization for the Multi-factory Permutation Flowshop Scheduling Problem

  • Jan 01, 2017
  • Procedia Computer Science
  • Hafewa Bargaoui +2
  • Research Article
  • Citations45

A distributed permutation flow-shop considering sustainability criteria and real-time scheduling

  • Mar 12, 2024
  • Journal of Industrial Information Integration
  • Amir M Fathollahi-Fard +2
  • Conference Article
  • Citations22

Constraint Programming Model of Tdrss Single Access Link Scheduling Problem

  • Jan 01, 2006
  • Yan-Shen Fang +1
  • Book Chapter
  • Citations2

A Novel Mathematical Model for Mixed-Blocking Permutation Flow Shop Scheduling Problem with Batch Delivery

  • Jan 01, 2023
  • Damla Kizilay +3
  • Research Article
  • Citations15

New mathematical and constraint programming models for U-type assembly line balancing problems with assignment restrictions

  • May 08, 2021
  • Engineering Optimization
  • Mehmet Pınarbaşı
  • Book Chapter
  • Citations5

Solving a Stochastic Queueing Control Problem with Constraint Programming

  • Jan 01, 2007
  • Daria Terekhov +1
  • PDF
  • Research Article
  • Citations11

Exact methods for the Oven Scheduling Problem

  • Jun 01, 2023
  • Constraints
  • Marie-Louise Lackner +4
  • Research Article
  • Citations10

An Integrated Approach for Shift Scheduling and Rostering Problems with Break Times for Inbound Call Centers

  • Nov 21, 2018
  • Mathematical Problems in Engineering
  • Turgay Türker +1
  • Research Article
  • Citations10

A constraint programming approach for resource-constrained flexible assembly flow shop scheduling problem with batch direct delivery

  • Sep 24, 2024
  • Computers and Operations Research
  • Chuangfeng Zeng +2
  • Research Article

Balancing U-shaped assembly lines with collaborative robots: constraint programming approaches and Benders’ decomposition algorithms

  • Sep 02, 2025
  • International Journal of Production Research
  • Chenyu Zheng +2
  • Dissertation

MINIMIZING MAKESPAN USING NODE-BASED COINCIDENCE ALGORITHM IN THE PERMUTATION FLOWSHOP SCHEDULING PROBLEM

  • Jan 01, 2014
  • Ornrumpha Srimongkolkul
  • Research Article
  • Citations30

Artificial bee colony algorithm for solving multi-objective distributed fuzzy permutation flow shop problem

  • Dec 31, 2021
  • Journal of Intelligent & Fuzzy Systems
  • M Emin Baysal +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.