Two-machine flowshop scheduling with three-operation jobs subject to a fixed job sequence

Publication Type:
Journal Article
Journal of Scheduling, 2017, 20 (3), pp. 293 - 302
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Author Proof.pdfPublished Version1.03 MB
© 2016, Springer Science+Business Media New York. This paper studies the problem of scheduling three-operation jobs in a two-machine flowshop subject to a predetermined job processing sequence. Each job has two preassigned operations, which are to be performed on their respective dedicated machines, and a flexible operation, which may be processed on either of the two machines subject to the processing order as specified. Five standard objective functions, including the makespan, the maximum lateness, the total weighted completion time, the total weighted tardiness, and the weighted number of tardy jobs are considered. We show that the studied problem for either of the five considered objective functions is ordinary NP-hard, even if the processing times of the preassigned operations are zero for all jobs. A pseudo-polynomial time dynamic programming framework, coupled with brief numerical experiments, is then developed for all the addressed performance metrics with different run times.
Please use this identifier to cite or link to this item: