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

Authors:
Xiuli Wang;T.C. Edwin Cheng
Affiliations:
Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Logistics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong
Venue:
Computers and Operations Research
Year:
2007

Citing 3
Cited 4

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

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

Operations Research Letters
Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint

Operations Research Letters

Makespan minimization for two parallel machines scheduling with a periodic availability constraint

Computers and Operations Research
Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics

Computers and Operations Research
A knowledge-based approach for calculating setup times

International Journal of Computer Applications in Technology
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper studies the two-machine permutation flowshop scheduling problem with anticipatory setup times and an availability constraint imposed only on the first machine. The objective is to minimize the makespan. Under the assumption that interrupted jobs can resume their operations, we present a polynomial-time approximation scheme for this problem.