Scheduling incompatible tasks on two machines

DOI10.1016/j.ejor.2009.01.029zbMath1177.90174OpenAlexW2073686894MaRDI QIDQ1042485

Irina N. Lushchakova, Vitaly A. Strusevich

Publication date: 14 December 2009

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2009.01.029

zbMATH Keywords

polynomial algorithmincompatibility graphmax-batchtwo machine scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ Two-dedicated-machine scheduling problem with precedence relations to minimize makespan ⋮ A combinatorial Benders decomposition algorithm for parallel machine scheduling with working-time restrictions

Cites Work

• Unnamed Item
• Time slot scheduling of compatible jobs
• Dynamic scheduling on a single batch processing machine with split compatibility graphs
• Scheduling problems for parallel dedicated machines under multiple resource constraints.
• A hypocoloring model for batch scheduling
• Scheduling parallel dedicated machines under a single non-shared resource
• Scheduling with batching: A review
• Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
• Open Shop Scheduling to Minimize Finish Time
• Scheduling parallel dedicated machines with the speeding‐up resource
• Scheduling batches with simultaneous job processing for two-machine shop problems

This page was built for publication: Scheduling incompatible tasks on two machines