A heuristic for scheduling general job shops to minimize maximum lateness

  • Authors:

  • Su Ling-Huey;Chang Pei-Chann;E.S Lee

  • Affiliations:

  • Department of Industrial Engineering Yuan-Ze Institute of Technology, Nei-Li, Taoyuan, Taiwan, R.O.C.;Department of Industrial Engineering Yuan-Ze Institute of Technology, Nei-Li, Taoyuan, Taiwan, R.O.C.;Department of Industrial Engineering Kansas State University, Manhattan, KS 66506-5105, U.S.A.

  • Venue:
  • Mathematical and Computer Modelling: An International Journal
  • Year:
  • 1998

Quantified Score

Hi-index 0.98

Visualization

Abstract

Based on the various priority dispatching rules, three dominant rules were formulated. Heuristic approaches were developed based on these dominant rules and dominant matrix. These heuristics can solve problems where a job may need to be processed by the same machine more than once in its operation sequence and different release times are allowed for different machines. The proposed heuristics appear to be fairly effective procedures, and various numerical results are obtained and compared with the various dispatching rules and with a branch and bound approach.