Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm

✍ Scribed by Suresh Chand; Rodney Traub; Reha Uzsoy

• Publisher: John Wiley and Sons
• Year: 1996
• Tongue: English
• Weight: 689 KB
• Volume: 43
• Category: Article
• ISSN: 0894-069X
• DOI: 10.1002/(sici)1520-6750(199608)43:5<709::aid-nav7>3.0.co;2-9

✦ Synopsis

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.