Improved algorithms for two single machine scheduling problems

Authors:
Yong He;Weiya Zhong;Huikun Gu
Affiliations:
Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou, PR China;Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou, PR China;Department of Mathematics, State Key Lab of CAD & CG, Zhejiang University, Hangzhou, PR China
Venue:
Theoretical Computer Science - Algorithmic applications in management
Year:
2006

Citing 3
Cited 11

Single machine flow-time scheduling with a single breakdown

Acta Informatica
Single machine flow-time scheduling with scheduled maintenance

Acta Informatica
A New Fully Polynomial Approximation Scheme for the Knapsack Problem

APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization

Approximation algorithm for the weighted flow-time minimization on a single machine with a fixed non-availability interval

Computers and Industrial Engineering
The Coordination of Two Parallel Machines Scheduling and Batch Deliveries

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A new heuristic algorithm for the machine scheduling problem with job delivery coordination

Theoretical Computer Science
Short Communication: Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval

Computers and Industrial Engineering
Integrated Production and Outbound Distribution Scheduling: Review and Extensions

Operations Research
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Minimizing total completion time on a single machine with a flexible maintenance activity

Computers and Operations Research
Two-machine flowshop scheduling with intermediate transportation under job physical space consideration

Computers and Operations Research
Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates

Journal of Scheduling
Computational performances of a simple interchange heuristic for a scheduling problem with an availability constraint

Computers and Industrial Engineering
Minimizing total weighted completion time with an unexpected machine unavailable interval

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we investigate two single machine scheduling problems. The first problem addresses a class of the two-stage scheduling problems in which the first stage is job production and the second stage is job delivery. For the case that jobs are processed on a single machine and delivered by a single vehicle to one customer area, with the objective of minimizing the time when all jobs are completed and delivered to the customer area and the vehicle returns to the machine, an approximation algorithm with a worst-case ratio of 5/3 is known and no approximation can have a worst-case of 3/2 unless P = NP. We present an improved approximation algorithm with a worst-case ratio of 53/35, which only leaves a gap of 1/70. The second problem is a single machine scheduling problem subject to a period of maintenance. The objective is to minimize the total completion time. The best known approximation algorithm has a worst-case ratio of 20/17 We present a polynomial time approximation scheme.