Scheduling with a minimum number of machines

Authors:
Guosong Yu;Guochuan Zhang
Affiliations:
Department of Mathematics, Zhejiang University, China and Department of Mathematics, Nanchang University, China;College of Computer Science, Zhejiang University, Hangzhou 310027, China
Venue:
Operations Research Letters
Year:
2009

Citing 6
Cited 0

Approximation algorithms for bin packing: a survey

Approximation algorithms for NP-hard problems
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Interval selection: applications, algorithms, and lower bounds

Journal of Algorithms
Machine Minimization for Scheduling Jobs with Interval Constraints

FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Algorithm Design

Algorithm Design
Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems

Mathematics of Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the scheduling problem with release dates and deadlines on a minimum number of machines. In the case of equal release dates, we present a 2-approximation algorithm. We also show that Greedy Best-Fit (GBF) is a 6-approximation algorithm for the case of equal processing times.