Minimizing the number of machines for minimum length schedules

DOI10.1016/j.ejor.2006.11.050zbMath1176.90210OpenAlexW2093084490MaRDI QIDQ1042210

Maurice Queyranne, Jean Marie Proth, Pierre Lemaire, Gerd Finke

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.2006.11.050

zbMATH Keywords

complexityparallel schedulingminimum number of processors

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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, Batch scheduling in a two-stage flexible flow shop problem, Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints, Scheduling unrelated parallel machines with optional machines and jobs selection

Cites Work

• On the minimum number of processors for scheduling problems with communication delays
• Upper bound on the number of processors for scheduling with interprocessor communication delays.
• Optimal scheduling for two-processor systems
• Scheduling with Deadlines and Loss Functions
• Hu's precedence tree scheduling algorithm: A simple proof
• Scheduling Flat Graphs
• Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
• Scheduling Opposing Forests
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item