A heuristic for job shop scheduling to minimize total weighted tardiness

A heuristic for job shop scheduling to minimize total weighted tardiness

0.00 Avg rating0 Votes
Article ID: iaor20031392
Country: Netherlands
Volume: 42
Issue: 2/4
Start Page Number: 137
End Page Number: 147
Publication Date: Mar 2002
Journal: Computers & Industrial Engineering
Authors: ,
Keywords: job shop
Abstract:

This paper considers the job shop scheduling problem to minimize the total weighted tardiness with job-specific due dates and delay penalties, and a heuristic algorithm based on the tree search procedure is developed for solving the problem. A certain job shop scheduling to minimize the maximum tardiness subject to fixed sub-schedules is solved at each node of the search tree, and the successor nodes are generated, where the sub-schedules of the operations are fixed. Thus, a schedule is obtained at each node, and the sub-optimum solution is determined among the obtained schedules. Computational results on some 10 jobs and 10 machines problems and 15 jobs and 15 machines problems show that the proposed algorithm can find the sub-optimum solutions with a little computation time.

Reviews

Required fields are marked *. Your email address will not be published.