Cost performance of simple priority rule combinations

Purpose – Several prior studies have investigated the strategy of concurrently deploying different priority rules at different processing stages of a manufacturing system. The purpose of this paper is to investigate the advantage of using such a strategy over that of using priority rules in their pure forms.Design/methodology/approach – Three priority rules were combined in all possible ways in a simulated, three‐stage, flow‐dominated manufacturing system. The performances of these combinations, along with three other simple priority rules in their pure forms, were compared using both mean and variability in waiting, earliness, tardiness, and total costs under two shop load levels and several tardiness to earliness cost ratios.Findings – The results indicate that the combinations between SIX and shortest processing time (SPT) rules perform well in reducing both mean and variability of waiting cost but do poorly on tardiness cost. On the other hand, the due date rule in its pure form or in conjunction with...

[1]  A. Alan B. Pritsker,et al.  Introduction to simulation and SLAM II , 1979 .

[2]  Bruce A. McCarl,et al.  An investigation of a cost-based rule for job-shop scheduling , 1973 .

[3]  Farzad Mahmoodi,et al.  The effect of combining simple priority heuristics in flow-dominant shops , 1996 .

[4]  Débora P. Ronconi,et al.  Some heuristic algorithms for total tardiness minimization in a flowshop with blocking , 2009 .

[5]  Chung Yee Lee,et al.  GLOBAL JOB SHOP SCHEDULING WITH A GENETIC ALGORITHM , 1995 .

[6]  R. Lawrence LaForge,et al.  THE IMPACT OF SIMPLE PRIORITY RULE COMBINATIONS ON DELIVERY SPEED AND DELIVERY RELIABILITY IN A HYBRID SHOP , 2009 .

[7]  Samir Barman,et al.  The impact of priority rule combinations on lateness and tardiness , 1998 .

[8]  Gary D. Scudder,et al.  The use of cost-based priorities in random and flow shops , 1987 .

[9]  Thomas R. Hoffmann,et al.  Composite cost-based rules for priority scheduling in a randomly routed job shop , 1985 .

[10]  Chung-Hsing Yeh,et al.  Sequencing shop floor operations: a practical approach , 2005 .

[11]  Don T. Phillips,et al.  A state-of-the-art survey of dispatching rules for manufacturing job shop operations , 1982 .

[12]  W. C. Benton.  Time- and cost-based priorities for job shop scheduling , 1993 .

[13]  Gary D. Scudder,et al.  Priority scheduling with cost considerations , 1983 .

[14]  G. S. Fishman.  Principles of Discrete Event Simulation , 1978 .

[15]  Chung-Lun Li,et al.  An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs , 2008, Comput. Oper. Res..

[16]  Lars Mönch,et al.  A Simulation Framework for the Performance Assessment of Shop-Floor Control Systems , 2003, Simul..

[17]  Vincent A. Mabert,et al.  AN EVALUATION OF ORDER RELEASE MECHANISMS IN A JOB-SHOP ENVIRONMENT , 1988 .

[18]  Samuel Eilon,et al.  Experiments with the SIX rule in job-shop scheduling , 1975 .

[19]  Gary D. Scudder,et al.  The use of value-based rules to avoid shop disruption , 1986 .

[20]  Bruce A. McCarl,et al.  The development and evaluation of a cost‐based composite scheduling rule , 1974 .

[21]  Ranga V. Ramasesh.  Dynamic job shop scheduling: A survey of simulation research , 1990 .

[22]  Robert T. Barrett,et al.  A SLAM II simulation study of a simplified flow shop , 1986, Simul..

[23]  Samir Barman.  Simple priority rule combinations: An approach to improve both flow time and tardiness , 1997 .

[24]  Jing-Wen Li,et al.  Investigating the factors influencing the shop performance in a job shop environment with kanban-based production control , 2000 .

[25]  Samuel Eilon,et al.  A MODIFIED SI RULE IN JOB SHOP SCHEDULING , 1968 .