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.
AhmedI. and FisherW. W. (1992), “Due Date Assignment, Job Order Release, and Sequencing Interaction in Job Shop Scheduling,”Decision Sciences, 23, 2, 633–647.
2.
AndersonE.J. and NyirendaJ. C. (1991), “Two New Rules to Minimize Tardiness in a Job Shop,”International Journal of Production Research, 28, 12, 2277–2292.
3.
BakerK. R. and ScudderG. D. (1990), “Sequencing with Earliness and Tardiness Penalties: A Review,”Operations Research, 38, 1, 22–36.
4.
BertrandJ. W. M. (1983), “The Effect of Workload Dependent Due Dates on Job Shop Performance,”Management Science, 29, 7, 799–816.
5.
BlackstoneJ. H.PhillipsD. T., and HoggG. L. (1982), “A State of the Art Survey of Dispatching Rules for Manufacturing Job Shop Operations,”International Journal of Production Research, 20, 1, 27–45.
6.
ChristyD. P. and KanetJ. J. (1990), “Manufacturing Systems with Forbidden Early Shipments: Implications for Choice of Scheduling Rules,”International Journal of Production Research, 28, 1, 91–100.
7.
DudewiczE. J. and DalalS. R. (1975), “Allocation of Measurements in Ranking and Selection with Unequal Variances,”Sankhya, B37, 28–78.
8.
KanetJ. J. and ChristyD. P. (1989), “Manufacturing Systems with Forbidden Early Shipments: Implications for Setting Manufacturing Lead Times,”International Journal of Production Research, 27, 5, 783–792.
9.
KanetJ. J. and ChristyD. P. (1984), “Manufacturing Systems with Forbidden Early Order Departure,”International Journal of Production Research, 22, 1, 41–50.
10.
KeltonW. D. (1989), “Random Initialization Methods in Simulation,”IIE Transactions, 21, 4, 355–367.
11.
LakshminarayanS.LakshmananR.PapineauR. L., and RochetteR. (1978), “Optimal Single‐Machine Scheduling with Earliness and Tardiness Penalties,”Operations Research, 26, 1079–1082.
12.
MortonT. E.LawrenceS. R.RajagopolanS., and KekreS. (1988), “SCHED‐STAR: A Price Based Shop Scheduling Module,”Journal of Manufacturing and Operations Management, 1, 1, 131–181.
13.
OwP. S. and MortonT. E. (1989), “The Single Machine Early/Tardy Problem,”Management Science, 35, 2, 177–191.
14.
PanwalkarS. S.SmithM. L., and SeidmannA. (1982), “Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem,”Operations Research, 30, 391–399.
15.
PegdenC. D.ShannonR. E., and SadowskiR. P. (1990), Introduction to Simulation Using SIMAN, McGraw‐Hill, Inc., New York.
16.
RagatzG. L. and MabertV. A. (1988), “An Evaluation of Order Release Mechanisms in a Job‐Shop Environment,”Decision Sciences, 19, 1, 167–189.
17.
RoderickL. M.PhillipsD. T., and HoggG. L. (1992), “A Comparison of Order Release Strategies in Production Control Systems,”International Journal of Production Research, 30, 3, 611–626.
18.
RohlederT. R. and ScudderG. D. (1992), “Scheduling Rule Selection for the Forbidden Early Shipment Environment: A Comparison of Economic Objectives,”International Journal of Production Research, 30, 1, 129–140.
19.
RohlederT. R. and ScudderG. D. (1993), “An Experimental Comparison of Time‐Based vs. Economic Based Scheduling Methods in a Dynamic Job Shop,”Decision Sciences, 24, 5, 1037–1056.
20.
RussellR. S.Dar‐ElE. M., and TaylorB. W.III (1987), “A Comparative Analysis of the COVERT Job Sequencing Rule Using Various Shop Performance Measures,”International Journal of Production Research, 25, 10, 1523–1540.
21.
SAS Institute Inc.1988), SAS/STAT User's Guide, Release 6.03 Edition, SAS Institute Inc., Cary, NC.
22.
SchonbergerR. J. (1986), World Class Manufacturing: The Lessons of Simplicity Applied, The Free Press, New York.
23.
ScudderG. D.Smith‐DanielsD. E., and RohlederT. R. (1990), “Use of the Net Present Value Criterion in a Random Job Shop Where Early Shipments are Forbidden,”Journal of Operations Management, 9, 4, 526–547.
24.
ScudderG. D. and HoffmannT. R. (1989), “The Use of Value‐Based Priorities When Early Shipments are Forbidden,”International Journal of Production Research, 27, 2, 353–369.
25.
SeidmannA.PanwalkarS. S., and SmithM. L. (1981), “Optimal Assignment of Due‐Dates for a Single Processor Scheduling Problem,”International Journal of Production Research, 19, 393–399.
26.
SidneyJ. (1977), “Optimal Single‐Machine Scheduling with Earliness and Tardiness Penalties,”Operations Research, 25, 1, 62–69.
27.
VepsalainenA. P. J. and MortonT. E. (1987), “Priority Rules for Job Shops with Weighted Tardiness Costs,”Management Science, 33, 8, 1035–1047.
28.
WilsonH. G. and MardisB. J. (1983), “Modifying Job Sequencing Rules for Work‐in‐Process Inventory Reduction,”IIE Transactions, 15, 4, 320–323.
