Polynomial-time approximation schemes for scheduling problems with time lags

Authors:
Xiandong Zhang;Steef Velde
Affiliations:
Department of Management Science, School of Management, Fudan University, Shanghai, China 200433;Rotterdam School of Management, Erasmus University, Rotterdam, The Netherlands 3000 DR
Venue:
Journal of Scheduling
Year:
2010

Citing 9
Cited 0

A polynomial approximation scheme for a constrained flow-shop scheduling problem

Mathematics of Operations Research
A polynomial-time algorithm for the two-machine unit-time release-date job-shop schedule-length problem

Discrete Applied Mathematics
Open Shop Scheduling to Minimize Finish Time

Journal of the ACM (JACM)
A heuristic for two-machine open-shop scheduling problem with transportation times

Discrete Applied Mathematics
A PTAS for shop scheduling with release dates to minimize the average weighted completion time

A PTAS for shop scheduling with release dates to minimize the average weighted completion time
Minimizing Makespan in a Two-Machine Flow Shop with Delays and Unit-Time Operations is NP-Hard

Journal of Scheduling
Deterministic Scheduling with Pipelined Processors

IEEE Transactions on Computers
A 3/2-approximation for the proportionate two-machine flow shop scheduling with minimum delays

WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
A polynomial approximation scheme for problem F2/rj/Cmax

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

We identify two classes of machine scheduling problems with time lags that possess Polynomial-Time Approximation Schemes (PTASs). These classes together, one for minimizing makespan and one for minimizing total completion time, include many well-studied time lag scheduling problems. The running times of these approximation schemes are polynomial in the number of jobs, but exponential in the number of machines and the ratio between the largest time lag and the smallest positive operation time.These classes constitute the first PTAS results for scheduling problems with time lags.