Article ID Journal Published Year Pages File Type
10523994 Operations Research Letters 2005 6 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
No-wait flexible flowshop scheduling with no-idle machines
Authors
, , ,