Premium
Single‐machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm
Author(s) -
Chand Suresh,
Traub Rodney,
Uzsoy Reha
Publication year - 1996
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/(sici)1520-6750(199608)43:5<709::aid-nav7>3.0.co;2-9
Subject(s) - computer science , decomposition , mathematical optimization , enumeration , scheduling (production processes) , algorithm , job shop scheduling , dynamic priority scheduling , mathematics , schedule , discrete mathematics , ecology , biology , operating system
This article considers the single‐machine dynamic scheduling problem where the jobs have different arrival times and the objective is to minimize the sum of completion times. This problem is known to be strongly NP‐hard. We develop decomposition results for this problem such that a large problem can be solved by combining optimal solutions for several smaller problems. The decomposition results can be used with any implicit enumeration method to develop an optimal algorithm. Our computational experiment indicates that the computational efficiency of the currently best available branch‐and‐bound algorithm can be improved with the use of our decomposition results. © 1996 John Wiley & Sons, Inc.