An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

0.00 Avg rating0 Votes
Article ID: iaor20083031
Country: United Kingdom
Volume: 34
Issue: 10
Start Page Number: 2894
End Page Number: 2901
Publication Date: Oct 2007
Journal: Computers and Operations Research
Authors: ,
Keywords: heuristics, combinatorial analysis
Abstract:

This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme for this problem.

Reviews

Required fields are marked *. Your email address will not be published.