An improved heuristic for two-machine flowshop scheduling with an availability constraint

Authors:
T. C. Edwin Cheng;Guoqing Wang
Affiliations:
Office of the Vice-President (Research and Postgraduate Studies) The Hong Kong Polytechnic University, Kowloon, Hong Kong;Department of Business Administration, Jinan University, Guangzhou, People's Republic of China and Department of Management, The Hong Kong Polytechnic University, Kowloon, Hong Kong
Venue:
Operations Research Letters
Year:
2000

Citing 2
Cited 9

Two-machine flowshop scheduling with consecutive availability constraints

Information Processing Letters
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters

An improved approximation algorithm for two-machine flow shop scheduling with an availability constraint

Information Processing Letters
Scheduling two-stage hybrid flow shop with availability constraints

Computers and Operations Research
A polynomial-time approximation scheme for the two-machine flow shop scheduling problem with an availability constraint

Computers and Operations Research
An approximation scheme for two-machine flowshop scheduling with setup times and an availability constraint

Computers and Operations Research
Approximation results for flow shop scheduling problems with machine availability constraints

Computers and Operations Research
Makespan minimization for two parallel machines scheduling with a periodic availability constraint

Computers and Operations Research
Heuristic algorithms for two-machine flowshop with availability constraints

Computers and Industrial Engineering
Scheduling two-stage hybrid flow shop with availability constraints

Computers and Operations Research
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the two-machine flowshop scheduling problem with an availability constraint on the first machine. We first show that the worst-case error bound 12 of the heuristic provided by Lee [4] is tight. We then develop an improved heuristic with a worst-case error bound of 13.