Scalable Distributed Branch and Bound for the Permutation Flow Shop Problem

2013 ◽  
Author(s):  
Samia Kouki ◽  
Mohamed Jemni ◽  
Talel Ladhari
Keyword(s):  
Branch And Bound ◽  
Flow Shop ◽  
Permutation Flow Shop ◽  
Flow Shop Problem

scholarly journals A branch and bound method in a permutation flow shop with blocking and setup times

2022 ◽  
Vol 13 (2) ◽  
pp. 255-266 ◽  
Author(s):  
Marcelo Seido Nagano ◽  
Mauricio Iwama Takano ◽  
João Vítor Silva Robazzi
Keyword(s):  
Branch And Bound ◽  
Flow Shop ◽  
Flow Time ◽  
Setup Times ◽  
Total Flow ◽  
Permutation Flow Shop ◽  
Flow Shop Problem ◽  
Limited Buffers ◽  
Manufacturing Environments ◽  
New Machine

In this paper it is presented an improvement of the branch and bound algorithm for the permutation flow shop problem with blocking-in-process and setup times with the objective of minimizing the total flow time and tardiness, which is known to be NP-Hard when there are two or more machines involved. With that objective in mind, a new machine-based lower bound that exploits some structural properties of the problem. A database with 27 classes of problems, varying in number of jobs (n) and number of machines (m) was used to perform the computational experiments. Results show that the algorithm can deal with most of the problems with less than 20 jobs in less than one hour. Thus, the method proposed in this work can solve the scheduling of many applications in manufacturing environments with limited buffers and separated setup times.

Robust solutions in multi-objective stochastic permutation flow shop problem

2019 ◽  
Vol 137 ◽  
pp. 106026
Author(s):  
Eliana María González-Neira ◽  
Ana María Urrego-Torres ◽  
Ana María Cruz-Riveros ◽  
Catalina Henao-García ◽  
Jairo R. Montoya-Torres ◽  
...  
Keyword(s):  
Flow Shop ◽  
Robust Solutions ◽  
Multi Objective ◽  
Permutation Flow Shop ◽  
Flow Shop Problem

A simheuristic algorithm for the stochastic permutation flow‐shop problem with delivery dates and cumulative payoffs

2020 ◽  
Vol 28 (2) ◽  
pp. 716-737
Author(s):  
Pedro A. Villarinho ◽  
Javier Panadero ◽  
Luciana S. Pessoa ◽  
Angel A. Juan ◽  
Fernando L. Cyrino Oliveira
Keyword(s):  
Flow Shop ◽  
Permutation Flow Shop ◽  
Flow Shop Problem ◽  
Delivery Dates

Permutation Flow Shop Problem with Shortening Job Processing Times

2016 ◽  
Vol 33 (04) ◽  
pp. 1650032 ◽  
Author(s):  
Zhenyou Wang ◽  
Cai-Min Wei ◽  
Yuan-Yuan Lu
Keyword(s):  
Branch And Bound ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Nonincreasing Function ◽  
Start Time ◽  
Processing Times ◽  
Special Cases ◽  
Permutation Flow Shop ◽  
Time Optimal ◽  
Dominance Properties

In this paper, we consider a three-machine makespan minimization permutation flow shop scheduling problem with shortening job processing times. Shortening job processing times means that its processing time is a nonincreasing function of its execution start time. Optimal solutions are obtained for some special cases. For the general case, several dominance properties and two lower bounds are developed to construct a branch-and-bound (B&B) algorithm. Furthermore, we propose a heuristic algorithm to overcome the inefficiency of the branch-and-bound algorithm.

Sign in / Sign up

Export Citation Format

Share Document