Permutation flowshop scheduling problems with maximal and minimal time lags

Authors:
Julien Fondrevelle;Ammar Oulamara;Marie-Claude Portmann
Affiliations:
MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Nancy, France;MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Nancy, France;MACSI Project LORIA-INRIA Lorraine, Ecole des Mines de Nancy, Nancy, France
Venue:
Computers and Operations Research
Year:
2006

Citing 3
Cited 5

A two-machine flowshop sequencing problem with limited waiting time constraints

Computers and Industrial Engineering
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Journal of Scheduling

Parallel partitioning method (PPM): A new exact method to solve bi-objective problems

Computers and Operations Research
Modeling realistic hybrid flexible flowshop scheduling problems

Computers and Operations Research
Minimizing the number of late jobs for the permutation flowshop problem with secondary resources

Computers and Operations Research
A memetic algorithm for the job-shop with time-lags

Computers and Operations Research
A neighborhood search algorithm for one-machine scheduling problem with time lags

CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference

Quantified Score

Hi-index	0.01

Visualization

Abstract

In this paper, we study permutation flowshop problems with minimal and/or maximal time lags, where the time lags are defined between couples of successive operations of jobs. Such constraints may be used to model various industrial situations, for instance the production of perishable products. We present theoretical results concerning two-machine cases, we prove that the two-machine permutation flowshop with constant maximal time lags is strongly NP-hard. We develop an optimal branch and bound procedure to solve the m-machine permutation flowshop problem with minimal and maximal time lags. We test several lower bounds and heuristics providing upper bounds on different classes of benchmarks, and we carry out a performance analysis.