Some complexity results in cyclic scheduling

Authors:
S. T. Mccormick;U. S. Rao
Affiliations:
Faculty of Commerce and Business Administration University of British Columbia Vancouver, BC V6T 1Z2 Canada;Faculty of Commerce and Business Administration University of British Columbia Vancouver, BC V6T 1Z2 Canada
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1994

Citing 6
Cited 4

Sequencing in an assembly line with blocking to minimize cycle time

Operations Research
Dynamic analysis of repetitive decision-free discrete-event processes: the algebra of timed marked graphs and algorithmic issues

Annals of Operations Research
Dynamic analysis of repetitive decision-free discrete-event processes: applications to production systems

Annals of Operations Research
Compact cylindrical chromatic scheduling

SIAM Journal on Discrete Mathematics
Cyclic schedules for job shops with identical jobs

Mathematics of Operations Research
Flowshop scheduling with limited temporary storage

Journal of the ACM (JACM)

Periodic schedules for linear precedence constraints

Discrete Applied Mathematics
Survey: Complexity of cyclic scheduling problems: A state-of-the-art survey

Computers and Industrial Engineering
High-multiplicity cyclic job shop scheduling

Operations Research Letters
CROSS cyclic resource-constrained scheduling solver

Artificial Intelligence

Quantified Score

Hi-index	0.98

Visualization

Abstract

In this paper, we investigate the complexity of various cyclic scheduling problems in flow-shop, job-shop and other environments. We review existing results and provide proofs for two new complexity results: we show that maximizing throughput in a flexible assembly line is NP-hard, and in the process, we give a polynomial transformation of generic makespan minimization problems in static scheduling to cycle time minimization in cyclic scheduling problems. Secondly, we show that when we try to schedule a single job type in a cyclic, reentrant flow shop, even if we are given the sequence of operations on each machine, it is still NP-hard to figure out how to place the operations onto cycles of a given length so as to minimize flow time (or, equivalently, work in process). This paper may also be viewed as a classification of cyclic scheduling research from the perspective of computational complexity.