Premium
A COMPARISON OF ORDER‐RELEASE AND DISPATCH RULES FOR THE DYNAMIC WEIGHTED EARLY/TARDY PROBLEM
Author(s) -
ROHLEDER THOMAS R.,
SCUDDER GARY
Publication year - 1993
Publication title -
production and operations management
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.279
H-Index - 110
eISSN - 1937-5956
pISSN - 1059-1478
DOI - 10.1111/j.1937-5956.1993.tb00099.x
Subject(s) - computer science , scheduling (production processes) , mathematical optimization , operations research , production (economics) , order (exchange) , process (computing) , due date , operations management , mathematics , economics , microeconomics , schedule , finance , operating system
The early/tardy problem is one of the most vexing pieces of the complex production scheduling decision process. So far most of the research has been on single‐machine environments. Hence, we considered the weighted early/tardy scheduling problem in a simulated dynamic multimachine job shop. We analyzed controlled job‐release and dispatch rules using time and cost information at a variety of stationary and nonstationary utilization rates, due‐date allowances, and early/tardy cost levels. We found a newly developed method for controlling the release for all job operations using early/tardy cost information, superior to other release mechanisms overall in both our stationary and nonstationary analyses. We found immediate release useful at many high utilization conditions and a gateway‐only release method best in many low utilization conditions. A modified version of a single‐machine early/tardy dispatch method was clearly superior to the dispatch rules for almost all the simulated shop conditions.