The complexity of two group scheduling problems

DOI10.1002/JOS.118zbMath1058.90022OpenAlexW2006725417WikidataQ57387829 ScholiaQ57387829MaRDI QIDQ1860372

Mikhail Y. Kovalyov, Jacek Błażewicz

Publication date: 23 February 2003

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jos.118

zbMATH Keywords

schedulingparallel machinesopen shopgroup technology

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Single machine scheduling with assignable due dates to minimize maximum and total late work ⋮ A survey of scheduling problems with setup times or costs ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan ⋮ An introduction to multi-parameter complexity analysis of discrete problems ⋮ A vibration damping optimization algorithm for a parallel machines scheduling problem with sequence-independent family setup times

Cites Work

• Minimizing the number of late jobs under the group technology assumption
• The complexity of scheduling job families about a common due date
• Two-machine shop scheduling problems with batch processing
• Scheduling with batching: A review
• Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity
• Open Shop Scheduling to Minimize Finish Time
• Parallel Machine Scheduling with Batch Setup Times
• Scheduling Groups of Jobs on a Single Machine

This page was built for publication: The complexity of two group scheduling problems