Parallel machine scheduling with high multiplicity

DOI10.1007/S101070100190MaRDI QIDQ5930732zbMATH OpenFDO

Authors John J. Clifford, Marc E. Posner

Publication date 24 April 2001

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

Full work available at URL https://doi.org/10.1007/S101070100190

zbMATH Keywords

computational complexitydeterministichigh multiplicityhigh-multiplicity schedulingparallel machinesequencing

Mathematics Subject Classification ID

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) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Exact and approximate algorithms for high-multiplicity parallel machine scheduling
• High Multiplicity in Earliness-Tardiness Scheduling
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• Note on ``Parallel machine scheduling with batch setup times
• Using quadratic programming to solve high multiplicity scheduling problems on parallel machines

Cited in

(22)

• Exact and approximate algorithms for high-multiplicity parallel machine scheduling
• Parallel machine batching and scheduling with deadlines
• Parallel machine scheduling with splitting jobs
• A polynomial algorithm for lot-size scheduling of two type tasks.
• Cyclic lot-sizing problems with sequencing costs
• The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
• A note on the complexity of the problem of two-agent scheduling on a single machine
• On the high multiplicity traveling salesman problem
• Low-complexity algorithms for sequencing jobs with a fixed number of job-classes
• A framework for the complexity of high-multiplicity scheduling problems
• Note on ``Parallel machine scheduling with batch setup times
• An alternative approach for proving the NP-hardness of optimization problems
• High-multiplicity scheduling on one machine with forbidden start and completion times
• Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation
• Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem
• High Multiplicity in Earliness-Tardiness Scheduling
• Scheduling problem with multi-purpose parallel machines
• Parallel Machine Scheduling: Impact of Adding Extra Machines
• Multiplicity and complexity issues in contemporary production scheduling
• Scheduling High Multiplicity Jobs on Parallel Multi-Purpose Machines with Setup Times and Machine Available Times
• Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
• An approximate algorithm for a high-multiplicity parallel machine scheduling problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5930732)