Complexity of scheduling problems with multi-purpose machines

• 1 January 1997
• journal article
• Published by Springer Nature in Annals of Operations Research
• Vol. 70, 57-73
• https://doi.org/10.1023/a:1018950911030

Abstract

Keywords

• SCHEDULE PROBLEM
• FEASIBLE SCHEDULE
• TERMINAL VERTEX
• PREEMPTIVE SCHEDULE
• MINIMUM COST FLOW