Scheduling with a minimum number of machines

DOI10.1016/J.ORL.2009.01.008zbMath1159.90410OpenAlexW1974725056MaRDI QIDQ1015305

Guosong Yu, Guo-Chuan Zhang

Publication date: 7 May 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2009.01.008

zbMATH Keywords

schedulingapproximation algorithmbin packing

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (5)

Cost-efficient scheduling on machines from the cloud ⋮ An $\mathcal{O}(\log {m})$-Competitive Algorithm for Online Machine Minimization ⋮ Exploring a Resolution Method Based on an Evolutionary Game-Theoretical Model for Minimizing the Machines with Limited Workload Capacity and Interval Constraints ⋮ Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network ⋮ Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the approximability of an interval scheduling problem
• Interval selection: Applications, algorithms, and lower bounds
• Algorithms and Computation
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

This page was built for publication: Scheduling with a minimum number of machines