Parallel machine scheduling with high multiplicity

DOI10.1007/s101070100190zbMath0978.90044MaRDI QIDQ5930732

John J. Clifford, Marc E. Posner

Publication date: 24 April 2001

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

zbMATH Keywords

computational complexitydeterministichigh multiplicityhigh-multiplicity schedulingparallel machinesequencing

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (11)

Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times ⋮ An alternative approach for proving the NP-hardness of optimization problems ⋮ A note on the complexity of the problem of two-agent scheduling on a single machine ⋮ High-multiplicity scheduling on one machine with forbidden start and completion times ⋮ On the high multiplicity traveling salesman problem ⋮ An approximate algorithm for a high-multiplicity parallel machine scheduling problem ⋮ The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs ⋮ Cyclic lot-sizing problems with sequencing costs ⋮ Exact and approximate algorithms for high-multiplicity parallel machine scheduling ⋮ A framework for the complexity of high-multiplicity scheduling problems ⋮ A polynomial algorithm for lot-size scheduling of two type tasks.

This page was built for publication: Parallel machine scheduling with high multiplicity