Advanced search
Publication Cover
International Journal of Production Research Volume 25, 1987 - Issue 10
Submit an article Journal homepage
139
Views
74
CrossRef citations to date
0
Altmetric
Original Articles

A comparative analysis of the COVERT job sequencing rule using various shop performance measures

R. S. RUSSELL† Department of Management Science, Virginia Polytechnic Institute, and State University, Blacksburg, Virginia, 24061, U.S.A.
,
E. M. DAR-EL‡ Technion-lsrael Institute of Technology, Haifa, Israel
&
B. W. TAYLOR III Department of Management Science, Virginia Polytechnic Institute, and State University, Blacksburg, Virginia, 24061, U.S.A.
Pages 1523-1540 | Received 01 Feb 1987, Published online: 22 Oct 2007

Citations (74)

Keep up to date with the latest research on this topic with citation updates for this article.

Subscribe to citation updates

Read on this site (22)

Xiaoming Wang, Qingxin Chen, Ning Mao, Xindu Chen & Zhantao Li. (2015) Proactive approach for stochastic RCMPSP based on multi-priority rule combinations. International Journal of Production Research 53:4, pages 1098-1110.
Read now
Nasser Mebarki & Atif Shahzad. (2013) Correlation among tardiness-based measures for scheduling using priority dispatching rules. International Journal of Production Research 51:12, pages 3688-3697.
Read now
Liu Zhuo, David Chua Kim Huat & Keng Hwee Wee. (2012) Scheduling dynamic block assembly in shipbuilding through hybrid simulation and spatial optimisation. International Journal of Production Research 50:20, pages 5986-6004.
Read now
Veronique Sels, Nele Gheysen & Mario Vanhoucke. (2012) A comparison of priority rules for the job shop scheduling problem under different flow time- and tardiness-related objective functions. International Journal of Production Research 50:15, pages 4255-4270.
Read now
T. C. Chiang & L. C. Fu. (2007) Using dispatching rules for job shop scheduling with due date-based objectives. International Journal of Production Research 45:14, pages 3245-3262.
Read now
T.-C. Hsu. (2006) New expression of scheduling performance measures. International Journal of Production Research 44:15, pages 3147-3158.
Read now
Jürgen Branke & Dirk Christian Mattfeld. (2005) Anticipation and flexibility in dynamic scheduling. International Journal of Production Research 43:15, pages 3103-3129.
Read now
S.-W. Choi, Y.-D. Kim & G.-C. Lee. (2005) Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop. International Journal of Production Research 43:11, pages 2149-2167.
Read now
G.-C. Lee, Y.-D. Kim & S.-W. Choi. (2004) Bottleneck-focused scheduling for a hybrid flowshop. International Journal of Production Research 42:1, pages 165-181.
Read now
S. Thiagarajan & C. Rajendran. (2003) Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs . International Journal of Production Research 41:18, pages 4453-4486.
Read now
G-C Lee, Y-D Kim, J-G Kim & S-H Choi. (2003) A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system. Journal of the Operational Research Society 54:10, pages 1038-1049.
Read now
Oliver Holthaus & Chandrasekharan Rajendran. (2002) A study on the performance of scheduling rules in buffer-constrained dynamic flowshops. International Journal of Production Research 40:13, pages 3041-3052.
Read now
S. A. BRAH. (1996) A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors. Production Planning & Control 7:4, pages 362-373.
Read now
S. U. RANDHAWA & Y. ZENG. (1996) Job shop scheduling: an experimental investigation of the performance of alternative scheduling rules. Production Planning & Control 7:1, pages 47-56.
Read now
F. ROMERO-SUBIRÓN & P. ROSADO. (1995) The design of a line control system for the modular furniture industry. International Journal of Production Research 33:7, pages 1953-1972.
Read now
Y.-D. KIM & C. A. YANOJ. (1994) A due date-based approach to part type selection in flexible manufacturing systems. International Journal of Production Research 32:5, pages 1027-1043.
Read now
Y-D. KIM. (1993) A study on surrogate objectives for loading a certain type of flexible manufacturing systems. International Journal of Production Research 31:2, pages 381-392.
Read now
FARZAD MAHMOODI & KEVINJ. DOOLEY. (1992) Group scheduling and order releasing: review and foundations for research. Production Planning & Control 3:1, pages 70-80.
Read now
E. J. ANDERSON & J. C. NYIRENDA. (1990) Two new rules to minimize tardiness in a job shop. International Journal of Production Research 28:12, pages 2277-2292.
Read now
YEONG-DAE KIM. (1990) A comparison of dispatching rules for job shops with multiple identical jobs and alternative routeings. International Journal of Production Research 28:5, pages 953-962.
Read now
YASHP. GUPTA, MAHESHC. GUPTA & C. R. BECTOR. (1989) A review of scheduling rules in flexible manufacturing systems. International Journal of Computer Integrated Manufacturing 2:6, pages 356-377.
Read now
CARLR. SCHULTZ. (1989) An expediting heuristic for the shortest processing time dispatching rule. International Journal of Production Research 27:1, pages 31-41.
Read now

Articles from other publishers (52)

Donald Davendra, Frank Herrmann & Magdalena Bialic-Davendra. (2022) Chaotic Flower Pollination Algorithm for scheduling tardiness-constrained flow shop with simultaneously loaded stations. Neural Computing and Applications.
Crossref
David Garcia, Houda Tlahig, Belgacem Bettayeb & M'hammed Sahnoun. (2021) Evaluation of Dispatching Rules Performance for a DJSSP: Towards their Application in Industry 4.0. Evaluation of Dispatching Rules Performance for a DJSSP: Towards their Application in Industry 4.0.
Jae-Gon Kim, Hong-Bae Jun, June-Young Bang, Jong-Ho Shin & Seong-Hoon Choi. (2020) Minimizing Tardiness Penalty Costs in Job Shop Scheduling under Maximum Allowable Tardiness. Processes 8:11, pages 1398.
Crossref
Donald Davendra, Frank Hermann & Magdalena Bialic-Davendra. (2020) Scheduling Tardiness Constrained Flow Shop with Simultaneously Loaded Stations Using Genetic Algorithm. Scheduling Tardiness Constrained Flow Shop with Simultaneously Loaded Stations Using Genetic Algorithm.
Hegen Xiong, Huali Fan, Guozhang Jiang & Gongfa Li. (2017) A simulation-based study of dispatching rules in a dynamic job shop scheduling problem with batch release and extended technical precedence constraints. European Journal of Operational Research 257:1, pages 13-24.
Crossref
Jae-Gon Kim, Seung-Kil Lim & June-Young Bang. (2015) Lot-Order Assignment Applying Priority Rules for the Single-Machine Total Tardiness Scheduling with Nonnegative Time-Dependent Processing Times. Mathematical Problems in Engineering 2015, pages 1-11.
Crossref
Farhad Ghassemi Tari & Laya Olfat. (2013) Heuristic rules for tardiness problem in flow shop with intermediate due dates. The International Journal of Advanced Manufacturing Technology 71:1-4, pages 381-393.
Crossref
Zhicong Zhang, Kaishun Hu, Shuai Li, Huiyu Huang & Shaoyong Zhao. (2013) Chip Attach Scheduling in Semiconductor Assembly. Journal of Industrial Engineering 2013, pages 1-11.
Crossref
Durgesh Sharma, Suresh Garg & Chitra Sharma. (2012) Multi Objective Optimization in Scheduling of FMS Using Roulette Wheel Selection Process. Advanced Materials Research 622-623, pages 35-39.
Crossref
Tsung-Che Chiang & Li-Chen Fu. (2012) Rule-based scheduling in wafer fabrication with due date-based objectives. Computers & Operations Research 39:11, pages 2820-2835.
Crossref
Zhicong Zhang, Li Zheng, Na Li, Weiping Wang, Shouyan Zhong & Kaishun Hu. (2012) Minimizing mean weighted tardiness in unrelated parallel machine scheduling with reinforcement learning. Computers & Operations Research 39:7, pages 1315-1324.
Crossref
K. Kianfar, S.M.T. Fatemi Ghomi & A. Oroojlooy Jadid. (2012) Study of stochastic sequence-dependent flexible flow shop via developing a dispatching rule and a hybrid GA. Engineering Applications of Artificial Intelligence 25:3, pages 494-506.
Crossref
Tsung-Che Chiang. (2010) Model simplification for accelerating simulation-based evaluation of dispatching rules in wafer fabrication facilities. Model simplification for accelerating simulation-based evaluation of dispatching rules in wafer fabrication facilities.
Yong-Chan Choi, Yeong-Dae Kim & June-Young Bang. (2010) Scheduling algorithms for an air conditioner manufacturing system composed of multiple parallel assembly lines. The International Journal of Advanced Manufacturing Technology 51:9-12, pages 1225-1241.
Crossref
Alexandre Dolgui & Jean-Marie Proth. 2010. Supply Chain Engineering. Supply Chain Engineering 327 369 .
K. Kianfar, S. M. T. Fatemi Ghomi & B. Karimi. (2009) New dispatching rules to minimize rejection and tardiness costs in a dynamic flexible flow shop. The International Journal of Advanced Manufacturing Technology 45:7-8, pages 759-771.
Crossref
Amit Kumar Gupta, Viswanath Kumar Ganesan & Appa Iyer Sivakumar. (2008) Cycle time variance minimization in dynamic scheduling of single machine systems. The International Journal of Advanced Manufacturing Technology 42:5-6, pages 544-552.
Crossref
Atif Shahzad & Nasser Mebarki. (2009) A Study of Tardiness Based Measures for Benchmark Priority Dispatching Rules used in Dynamic Job Shop. IFAC Proceedings Volumes 42:4, pages 1983-1988.
Crossref
Nasser Mebarki & Atif Shahzad. (2008) A procedure to compute a probabilistic bound for the maximum tardiness using stochastic simulation. IFAC Proceedings Volumes 41:2, pages 10534-10539.
Crossref
Gérard Bel & Jean‐Bernard Cavaillé. 2008. Production Scheduling. Production Scheduling 139 165 .
Yan Yan & Guoxin Wang. (2007) A job shop scheduling approach based on simulation optimization. A job shop scheduling approach based on simulation optimization.
Zhicong Zhang, Li Zheng & Michael X. Weng. (2006) Dynamic parallel machine scheduling with mean weighted tardiness objective by Q-Learning. The International Journal of Advanced Manufacturing Technology 34:9-10, pages 968-980.
Crossref
Jean-Marie Proth. (2007) Scheduling: New trends in industrial environment. Annual Reviews in Control 31:1, pages 157-166.
Crossref
K. Natarajan, K. M. Mohanasundaram, B. Shoban Babu, S. Suresh, K. Antony Arokia Durai Raj & C. Rajendran. (2006) Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardiness. The International Journal of Advanced Manufacturing Technology 31:7-8, pages 751-761.
Crossref
Tsung-Che Chiang & Li-Chen Fu. (2006) A Simulation Study on Dispatching Rules in Semiconductor Wafer Fabrication Facilities with Due Date-based Objectives. A Simulation Study on Dispatching Rules in Semiconductor Wafer Fabrication Facilities with Due Date-based Objectives.
T.J. Chua, F.Y. Wang, T.X. Cai & X.F. Yin. (2006) A Heuristics-based Advanced Planning and Scheduling System with Bottleneck Scheduling Algorithm. A Heuristics-based Advanced Planning and Scheduling System with Bottleneck Scheduling Algorithm.
Paolo Priore, David de la Fuente, Javier Puente & José Parreño. (2006) A comparison of machine-learning algorithms for dynamic scheduling of flexible manufacturing systems. Engineering Applications of Artificial Intelligence 19:3, pages 247-255.
Crossref
Christopher D. Geiger, Reha Uzsoy & Haldun Aytuğ. (2006) Rapid Modeling and Discovery of Priority Dispatching Rules: An Autonomous Learning Approach. Journal of Scheduling 9:1, pages 7-34.
Crossref
S. Thiagarajan & Chandrasekharan Rajendran. (2005) Scheduling in dynamic assembly job-shops to minimize the sum of weighted earliness, weighted tardiness and weighted flowtime of jobs. Computers & Industrial Engineering 49:4, pages 463-503.
Crossref
R. Alvarez-Valdes, A. Fuertes, J.M. Tamarit, G. Giménez & R. Ramos. (2005) A heuristic to schedule flexible job-shop in a glass factory. European Journal of Operational Research 165:2, pages 525-534.
Crossref
M.S Jayamohan & Chandrasekharan Rajendran. (2004) Development and analysis of cost-based dispatching rules for job shop scheduling. European Journal of Operational Research 157:2, pages 307-321.
Crossref
Dirk C Mattfeld & Christian Bierwirth. (2004) An efficient genetic algorithm for job shop scheduling with tardiness objectives. European Journal of Operational Research 155:3, pages 616-630.
Crossref
Alberto Petroni & Antonio Rizzi. (2002) A fuzzy logic based methodology to rank shop floor dispatching rules. International Journal of Production Economics 76:1, pages 99-108.
Crossref
Yeong-Dae Kim, Geun-Cheol Lee, Seong-Kook Choi & Seung-Kil Lim. (2001) Tool requirements planning in a flexible manufacturing system with an automatic tool transporter. IEEE Transactions on Robotics and Automation 17:6, pages 795-804.
Crossref
M. Jahangirian & G.V. Conroy. (2000) Intelligent dynamic scheduling system: the application of genetic algorithms. Integrated Manufacturing Systems 11:4, pages 247-257.
Crossref
Chandrasekharan Rajendran & Oliver Holthaus. (1999) A comparative study of dispatching rules in dynamic flowshops and jobshops. European Journal of Operational Research 116:1, pages 156-170.
Crossref
Oliver Holthaus. (1999) Scheduling in job shops with machine breakdowns: an experimental study. Computers & Industrial Engineering 36:1, pages 137-162.
Crossref
Yeong-Dae Kim, Jung-Ug Kim, Seung-Kil Lim & Hong-Bae Jun. (1998) Due-date based scheduling and control policies in a multiproduct semiconductor wafer fabrication facility. IEEE Transactions on Semiconductor Manufacturing 11:1, pages 155-164.
Crossref
Dirk C. Mattfeld & Christian Bierwirth. 1998. Adaptive Computing in Design and Manufacture. Adaptive Computing in Design and Manufacture 59 67 .
O. Holthaus. (1997) Design of efficient job shop scheduling rules. Computers & Industrial Engineering 33:1-2, pages 249-252.
Crossref
Oliver Holthaus & Hans Ziegler. (1997) Look ahead job demanding for improving job shop performance. Operations-Research-Spektrum 19:1, pages 23-29.
Crossref
Oliver Holthaus & Chandrasekharan Rajendran. (1997) Efficient dispatching rules for scheduling in a job shop. International Journal of Production Economics 48:1, pages 87-105.
Crossref
Oliver Holthaus, Otto Rosenberg & Hans Ziegler. 1996. Distributed Information Systems in Business. Distributed Information Systems in Business 123 137 .
Yeong-Dae Kim. (1995) A backward approach in list scheduling algorithms for multi-machine tardiness problems. Computers & Operations Research 22:3, pages 307-319.
Crossref
Min Hee Kim & Yeong-Dae Kim. (1994) Simulation-based real-time scheduling in a flexible manufacturing system. Journal of Manufacturing Systems 13:2, pages 85-93.
Crossref
Sebastian Engell, Frank Herrmann & Manfred Moser. 1994. Computer control of flexible manufacturing systems. Computer control of flexible manufacturing systems 75 107 .
Harald Dyckhoff, Ulrich Derigs, Marc Salomon & Henk C. TijmsOliver Holthaus & Hans Ziegler. 1994. Operations Research Proceedings 1993. Operations Research Proceedings 1993 157 163 .
THOMAS R. ROHLEDER & GARY SCUDDER. (2009) A COMPARISON OF ORDER‐RELEASE AND DISPATCH RULES FOR THE DYNAMIC WEIGHTED EARLY/TARDY PROBLEM. Production and Operations Management 2:3, pages 221-238.
Crossref
M. Moser & S. Engell. (1992) A survey of priority rules for FMS scheduling and their performance for the benchmark problem. A survey of priority rules for FMS scheduling and their performance for the benchmark problem.
Yeong-Dae Kim & Candace Arai Yano. (1992) An iterative approach to system setup problems in flexible manufacturing systems. International Journal of Flexible Manufacturing Systems 4:2, pages 183-209.
Crossref
Marilyn S. Jones & Roberta S. Russell. (1990) Multiple Performance Measures in the Selection of a Sequencing Rule. International Journal of Operations & Production Management 10:8, pages 29-41.
Crossref
R Ramasesh. (1990) Dynamic job shop scheduling: A survey of simulation research. Omega 18:1, pages 43-57.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.