A heuristic for job shop scheduling to minimize total weighted tardiness

Authors:
Makoto Asano;Hiroshi Ohta
Affiliations:
Department of Industrial Engineering, College of Engineering, Osaka Prefecture University, 1-1 Gakuencho, Sakai, Osaka 599-8531, Japan;Department of Industrial Engineering, College of Engineering, Osaka Prefecture University, 1-1 Gakuencho, Sakai, Osaka 599-8531, Japan
Venue:
Computers and Industrial Engineering - 26th International conference on computers and industrial engineering
Year:
2002

Citing 4
Cited 5

Priority rules for job shops with weighted tardiness costs

Management Science
The shifting bottleneck procedure for job shop scheduling

Management Science
An algorithm for solving the job-shop problem

Management Science
Job shop scheduling by simulated annealing

Operations Research

Reduction method for concept lattices based on rough set theory and its application

Computers & Mathematics with Applications
Multi-objective flexible job shop schedule: Design and evaluation by simulation modeling

Applied Soft Computing
Integrating dominance properties with genetic algorithms for parallel machine scheduling problems with setup times

Applied Soft Computing
A simulated annealing algorithm based on block properties for the job shop scheduling problem with total weighted tardinessobjective

Computers and Operations Research
A two-stage genetic algorithm for multi-objective job shop scheduling problems

Journal of Intelligent Manufacturing

Quantified Score

Hi-index	0.00

Visualization

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.