Complexity of flowshop scheduling problems with a new blocking constraint

This article deals with makespan minimization in the flowshop scheduling problem under the condition of no intermediate storage between machines. A new blocking constraint met in several industrial problems is introduced, and several complexity results are presented from two to five machines. Some p...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2006-03, Vol.169 (3), p.855-864
Main Authors: Martinez, S., Dauzère-Pérès, S., Guéret, C., Mati, Y., Sauer, N.
Format: Article
Language:English
Subjects:
Blocking
Complexity
Flowshop
Job shops
Operations research
Problem solving
Production scheduling
Scheduling
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This article deals with makespan minimization in the flowshop scheduling problem under the condition of no intermediate storage between machines. A new blocking constraint met in several industrial problems is introduced, and several complexity results are presented from two to five machines. Some problems with four machines in which the new and the classical blocking constraints are mixed, are polynomial. Problems with only the new blocking constraint are polynomial for up to three machines. Although the complexity of the problem with four machines is left open, several cases are shown to be polynomial. Finally the problem with five machines is NP-hard.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2004.08.046