Polynomial time algorithms for the UET permutation flowshop problem with time delays

Authors:
Alix Munier-Kordon;Djamal Rebaine
Affiliations:
Laboratoire LIP6, Université Pierre et Marie Curie, 4 place Jussieu, 75 252 Paris, Cedex 05, France;Dépt d'informatique et de mathématique, Université du Québec í Chicoutimi, Que., Canada G7H 2B1
Venue:
Computers and Operations Research
Year:
2008

Citing 3
Cited 2

Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Journal of Scheduling
Flow shop vs. permutation shop with time delays

Computers and Industrial Engineering
Permutation flowshop scheduling problems with maximal and minimal time lags

Computers and Operations Research

Analysis of heuristics for the UET two-machine flow shop problem with time delays

Computers and Operations Research
Minimizing the Number of Tardy Jobs in a Permutation Flowshop Scheduling Problem with Setup Times and Time Lags Constraints

Journal of Mathematical Modelling and Algorithms

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper addresses the problem of scheduling a set of n unit execution time (UET) jobs on an m-permutation flowshop with arbitrary time delays, so as to minimize the makespan criterion. A polynomial time algorithm is exhibited for the three-machine and four-machine cases, respectively.