Minimizing the number of machines for scheduling jobs with equal processing times

DOI10.1016/j.ejor.2008.10.008zbMath1176.90226WikidataQ57633887 ScholiaQ57633887MaRDI QIDQ1042179

Svetlana A. Kravchenko, Frank Werner

Publication date: 7 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.2008.10.008

zbMATH Keywords

linear programming; parallel machine scheduling

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Hybrid flow shop scheduling with not-all-machines options via local search with controlled deterioration, The optimal number of used machines in a two-stage flexible flowshop scheduling problem, Fast LP models and algorithms for identical jobs on uniform parallel machines, Batch scheduling in a two-stage flexible flow shop problem, Scheduling unrelated parallel machines with optional machines and jobs selection, Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints, Parallel machine problems with equal processing times: a survey

Cites Work

• Unnamed Item
• Scheduling jobs with equal processing times and time windows on identical parallel machines
• On the minimum number of processors for scheduling problems with communication delays
• Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
• A Fast Algorithm for Multiprocessor Scheduling of Unit-Length Jobs