Asymptotically optimal schedules for single-server flow shop problems with setup costs and times

Authors:
S. M. R. Iravani;C. P. Teo
Affiliations:
Department of Industrial Engineering and Management Sciences, Northwestern University, 2145 Sheridan Road, Evanston, IL 60208, USA;Department of Decision Sciences, National University of Singapore, Singapore
Venue:
Operations Research Letters
Year:
2005

Citing 9
Cited 2

The deadline constrained weighted completion time problem: analysis of a heuristic

Operations Research
Job-shop scheduling with multi-purpose machines

Computing
Precedence constrained scheduling to minimize sum of weighted completion times on a single machine

Discrete Applied Mathematics
Two-Dimensional Gantt Charts and a Scheduling Algorithm of Lawler

SIAM Journal on Discrete Mathematics
The Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem

Operations Research
Operations and Shipment Scheduling of a Batch on a Felxible Machine

Operations Research
Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem

Operations Research
From Fluid Relaxations to Practical Algorithms for High-Multiplicity Job-Shop Scheduling: The Holding Cost Objective

Operations Research
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

Flow shop scheduling to minimize the total completion time with a permanently present operator: Models and ant colony optimization metaheuristic

Computers and Operations Research
Dynamic control of a flexible server in an assembly-type queue with setup costs

Queueing Systems: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the processing of M jobs in a flow shop with N stations in which only a single server is in charge of all stations. We demonstrate that for the objective of minimizing the total setup and holding cost, a class of easily implementable schedules is asymptotically optimal.