An aggregation procedure for the deterministic job-shop problem

✍ Scribed by Bernard Penz; Lionel Dupont

• Book ID: 104630924
• Publisher: Springer US
• Year: 1995
• Tongue: English
• Weight: 488 KB
• Volume: 6
• Category: Article
• ISSN: 0956-5515
• DOI: 10.1007/bf00123683

✦ Synopsis

A new approach is proposed in this paper to solve the job-shop scheduling problem. Instead of considering operations or machines, the construction of partial schedules by dealing with jobs, one after the other, is suggested. A partial schedule for given jobs is characterized by the sequence of their operations on each machine. The principle of the algorithm is to aggregate a new job on the current schedule, i.e. to insert its operations without altering the previous order. Two main theoretical results are presented: firstly, the selection procedure for jobs and secondly, the aggregation algorithm. Next the method is explained using a simple example. Finally, the authors present and comment on computational results for an implementation of the algorithm, for some well-known job-shop problems.