OPTIMAL TIMING SCHEDULES IN EARLINESS TARDINESS SINGLE-MACHINE SEQUENCING

Authors
SZWARC W MUKHOPADHYAY SK
Citation
W. Szwarc et Sk. Mukhopadhyay, OPTIMAL TIMING SCHEDULES IN EARLINESS TARDINESS SINGLE-MACHINE SEQUENCING, Naval research logistics, 42(7), 1995, pp. 1109-1114
Citations number
3
Categorie Soggetti
Operatione Research & Management Science","Operatione Research & Management Science","Engineering, Marine
Journal title
Naval research logistics → ACNP
ISSN journal
0894069X
Volume
42
Issue
7
Year of publication
1995
Pages
1109 - 1114
Database
ISI
SICI code
0894-069X(1995)42:7<1109:OTSIET>2.0.ZU;2-Y
Abstract
The article deals with a single machine earliness-tardiness scheduling model where idle times are permitted in job processing. Based on a cl uster concept we develop properties of the model that lead to a very f ast algorithm to find an optimal timing schedule for a given sequence of jobs. The performance of this algorithm is tested on 480 randomly g enerated problems involving 100, 200, 400 and 500 jobs. It takes less than two seconds to solve a 500 job problem on a PC. (C) 1995 John Wil ey & Sons, Inc.