No-wait flexible flowshop scheduling with no-idle machines

No-wait flexible flowshop scheduling with no-idle machines

0.00 Avg rating0 Votes
Article ID: iaor2006809
Country: Netherlands
Volume: 33
Issue: 6
Start Page Number: 609
End Page Number: 614
Publication Date: Nov 2005
Journal: Operations Research Letters
Authors: , ,
Keywords: heuristics
Abstract:

This paper considers a two-stage flexible flowshop scheduling problem with no waiting time between two sequential operations of a job and no idle time between two consecutive processed jobs on machines of the second stage. We show its complexity and present a heuristic algorithm with asymptotically tight error bounds.

Reviews

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