Scheduling with a minimum number of machines

DOI10.1016/J.ORL.2009.01.008MaRDI QIDQ1015305zbMATH OpenOpenAlexFDO

Authors Guosong Yu, Guochuan 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

approximation algorithmbin packingscheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Minimizing the number of machines for minimum length schedules
• Minimizing the number of machines for scheduling jobs with equal processing times
• Scheduling to minimize the maximum total completion time per machine
• Scheduling with limited machine availability
• scientific article; zbMATH DE number 4023004
• Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints
• Scheduling to approximate minimization objectives on identical machines
• Minimizing makespan in batch machine scheduling
• scientific article; zbMATH DE number 2080262
• Scheduling when you don't know the number of machines

Cites work

• Algorithms and Computation
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
• scientific article; zbMATH DE number 3890754 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2163021 (Why is no real title available?)
• Interval selection: Applications, algorithms, and lower bounds
• On the approximability of an interval scheduling problem

Cited in

(11)

• Minimizing the number of machines for scheduling jobs with equal processing times
• Minimizing the number of machines for minimum length schedules
• Scheduling with limited machine availability
• Minimizing the number of machines with limited workload capacity for scheduling jobs with interval constraints
• Branch-cut-and-price for scheduling deliveries with time windows in a direct shipping network
• A greedy approximation algorithm for minimum-gap scheduling
• Resource Minimization Job Scheduling
• An O( m)-competitive algorithm for online machine minimization
• A greedy approximation algorithm for minimum-gap scheduling
• Exploring a resolution method based on an evolutionary game-theoretical model for minimizing the machines with limited workload capacity and interval constraints
• Fixed order scheduling with deadlines

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1015305)