IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v48y1997i1p87-105.html
   My bibliography  Save this article

Efficient dispatching rules for scheduling in a job shop

Author

Listed:
  • Holthaus, Oliver
  • Rajendran, Chandrasekharan

Abstract

No abstract is available for this item.

Suggested Citation

  • Holthaus, Oliver & Rajendran, Chandrasekharan, 1997. "Efficient dispatching rules for scheduling in a job shop," International Journal of Production Economics, Elsevier, vol. 48(1), pages 87-105, January.
    • Handle: RePEc:eee:proeco:v:48:y:1997:i:1:p:87-105
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(96)00068-0
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Jon K. Wilbrecht & William B. Prescott, 1969. "The Influence of Setup Time on Job Shop Performance," Management Science, INFORMS, vol. 16(4), pages 274-280, December.
    2. Nabil R. Adam & Julius Surkis, 1980. "Priority Update Intervals and Anomalies in Dynamic Ratio Type Job Shop Scheduling Rules," Management Science, INFORMS, vol. 26(12), pages 1227-1237, December.
    3. Raghu, T. S. & Rajendran, Chandrasekharan, 1993. "An efficient dynamic dispatching rule for scheduling in a job shop," International Journal of Production Economics, Elsevier, vol. 32(3), pages 301-313, November.
    4. Averill M. Law & W. David Kelton, 1984. "Confidence Intervals for Steady-State Simulations: I. A Survey of Fixed Sample Size Procedures," Operations Research, INFORMS, vol. 32(6), pages 1221-1239, December.
    5. Ari P. J. Vepsalainen & Thomas E. Morton, 1987. "Priority Rules for Job Shops with Weighted Tardiness Costs," Management Science, INFORMS, vol. 33(8), pages 1035-1047, August.
    6. Ramasesh, R, 1990. "Dynamic job shop scheduling: A survey of simulation research," Omega, Elsevier, vol. 18(1), pages 43-57.
    7. George S. Fishman, 1971. "Estimating Sample Size in Computing Simulation Experiments," Management Science, INFORMS, vol. 18(1), pages 21-38, September.
    8. John J. Kanet, 1982. "Note---On Anomalies in Dynamic Ratio Type Scheduling Rules: A Clarifying Analysis," Management Science, INFORMS, vol. 28(11), pages 1337-1341, November.
    9. Kenneth R. Baker, 1984. "Sequencing Rules and Due-Date Assignments in a Job Shop," Management Science, INFORMS, vol. 30(9), pages 1093-1104, September.
    10. C. T. Baker & B. P. Dzielinski, 1960. "Simulation of a Simplified Job Shop," Management Science, INFORMS, vol. 6(3), pages 311-323, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Thiesse, Frédéric & Fleisch, Elgar, 2008. "On the value of location information to lot scheduling in complex manufacturing processes," International Journal of Production Economics, Elsevier, vol. 112(2), pages 532-547, April.
    2. Rajendran, Chandrasekharan & Ziegler, Hans, 2001. "A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs," European Journal of Operational Research, Elsevier, vol. 131(3), pages 622-634, June.
    3. Rajendran, Chandrasekharan & Holthaus, Oliver, 1999. "A comparative study of dispatching rules in dynamic flowshops and jobshops," European Journal of Operational Research, Elsevier, vol. 116(1), pages 156-170, July.
    4. J E C Arroyo & V A Armentano, 2004. "A partial enumeration heuristic for multi-objective flowshop scheduling problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(9), pages 1000-1007, September.
    5. Lodree, Emmett & Jang, Wooseung & Klein, Cerry M., 2004. "A new rule for minimizing the number of tardy jobs in dynamic flow shops," European Journal of Operational Research, Elsevier, vol. 159(1), pages 258-263, November.
    6. Pickardt, Christoph W. & Hildebrandt, Torsten & Branke, Jürgen & Heger, Jens & Scholz-Reiter, Bernd, 2013. "Evolutionary generation of dispatching rule sets for complex dynamic scheduling problems," International Journal of Production Economics, Elsevier, vol. 145(1), pages 67-77.
    7. Mallor, Fermin & Guardiola, Ivan G., 2014. "The Weibull scheduling index for client driven manufacturing processes," International Journal of Production Economics, Elsevier, vol. 150(C), pages 225-238.
    8. Kasper, T.A. Arno & Land, Martin J. & Teunter, Ruud H., 2023. "Towards System State Dispatching in High‐Variety Manufacturing," Omega, Elsevier, vol. 114(C).
    9. Jayamohan, M. S. & Rajendran, Chandrasekharan, 2004. "Development and analysis of cost-based dispatching rules for job shop scheduling," European Journal of Operational Research, Elsevier, vol. 157(2), pages 307-321, September.
    10. Ahmet Kursad Turker & Adnan Aktepe & Ali Firat Inal & Olcay Ozge Ersoz & Gulesin Sena Das & Burak Birgoren, 2019. "A Decision Support System for Dynamic Job-Shop Scheduling Using Real-Time Data with Simulation," Mathematics, MDPI, vol. 7(3), pages 1-19, March.
    11. Branke, Juergen & Pickardt, Christoph W., 2011. "Evolutionary search for difficult problem instances to support the design of job shop dispatching rules," European Journal of Operational Research, Elsevier, vol. 212(1), pages 22-32, July.
    12. P Corry & E Kozan, 2004. "Job scheduling with technical constraints," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(2), pages 160-169, February.
    13. Sweeney, Kevin D. & Sweeney, Donald C. & Campbell, James F., 2019. "The performance of priority dispatching rules in a complex job shop: A study on the Upper Mississippi River," International Journal of Production Economics, Elsevier, vol. 216(C), pages 154-172.
    14. Petroni, Alberto & Rizzi, Antonio, 2002. "A fuzzy logic based methodology to rank shop floor dispatching rules," International Journal of Production Economics, Elsevier, vol. 76(1), pages 99-108, March.
    15. Ferreira, Cristiane & Figueira, Gonçalo & Amorim, Pedro, 2022. "Effective and interpretable dispatching rules for dynamic job shops via guided empirical learning," Omega, Elsevier, vol. 111(C).
    16. Ali Fırat İnal & Çağrı Sel & Adnan Aktepe & Ahmet Kürşad Türker & Süleyman Ersöz, 2023. "A Multi-Agent Reinforcement Learning Approach to the Dynamic Job Shop Scheduling Problem," Sustainability, MDPI, vol. 15(10), pages 1-24, May.
    17. Miragliotta, Giovanni & Perona, Marco, 2005. "Decentralised, multi-objective driven scheduling for reentrant shops: A conceptual development and a test case," European Journal of Operational Research, Elsevier, vol. 167(3), pages 644-662, December.
    18. Seung-Hyun Rhee & Hyerim Bae & Yongsun Choi, 2007. "Enhancing the efficiency of supply chain processes through web services," Information Systems Frontiers, Springer, vol. 9(1), pages 103-118, March.
    19. Xiong, Hegen & Fan, Huali & Jiang, Guozhang & Li, Gongfa, 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, Elsevier, vol. 257(1), pages 13-24.
    20. Jens Heger & Torsten Hildebrandt & Bernd Scholz-Reiter, 2015. "Dispatching rule selection with Gaussian processes," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 23(1), pages 235-249, March.
    21. Romero-Silva, Rodrigo & Shaaban, Sabry & Marsillac, Erika & Hurtado, Margarita, 2018. "Exploiting the characteristics of serial queues to reduce the mean and variance of flow time using combined priority rules," International Journal of Production Economics, Elsevier, vol. 196(C), pages 211-225.
    22. Jianjun Liu & Martin J. Land & Jos A. C. Bokhorst & Qingxin Chen, 2023. "Improving coordination in assembly job shops: redesigning order release and dispatching," Flexible Services and Manufacturing Journal, Springer, vol. 35(3), pages 669-697, September.
    23. Alvarez-Valdes, R. & Fuertes, A. & Tamarit, J. M. & Gimenez, G. & Ramos, R., 2005. "A heuristic to schedule flexible job-shop in a glass factory," European Journal of Operational Research, Elsevier, vol. 165(2), pages 525-534, September.
    24. Azaron, Amir & Katagiri, Hideki & Kato, Kosuke & Sakawa, Masatoshi, 2006. "Longest path analysis in networks of queues: Dynamic scheduling problems," European Journal of Operational Research, Elsevier, vol. 174(1), pages 132-149, October.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Rajendran, Chandrasekharan & Holthaus, Oliver, 1999. "A comparative study of dispatching rules in dynamic flowshops and jobshops," European Journal of Operational Research, Elsevier, vol. 116(1), pages 156-170, July.
    2. Chen, Binchao & Matis, Timothy I., 2013. "A flexible dispatching rule for minimizing tardiness in job shop scheduling," International Journal of Production Economics, Elsevier, vol. 141(1), pages 360-365.
    3. Jayamohan, M. S. & Rajendran, Chandrasekharan, 2004. "Development and analysis of cost-based dispatching rules for job shop scheduling," European Journal of Operational Research, Elsevier, vol. 157(2), pages 307-321, September.
    4. Ferreira, Cristiane & Figueira, Gonçalo & Amorim, Pedro, 2022. "Effective and interpretable dispatching rules for dynamic job shops via guided empirical learning," Omega, Elsevier, vol. 111(C).
    5. Vinod, V. & Sridharan, R., 2011. "Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system," International Journal of Production Economics, Elsevier, vol. 129(1), pages 127-146, January.
    6. Zhang, Rui & Chang, Pei-Chann & Wu, Cheng, 2013. "A hybrid genetic algorithm for the job shop scheduling problem with practical considerations for manufacturing costs: Investigations motivated by vehicle production," International Journal of Production Economics, Elsevier, vol. 145(1), pages 38-52.
    7. Kasper, T.A. Arno & Land, Martin J. & Teunter, Ruud H., 2023. "Towards System State Dispatching in High‐Variety Manufacturing," Omega, Elsevier, vol. 114(C).
    8. Xiong, Hegen & Fan, Huali & Jiang, Guozhang & Li, Gongfa, 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, Elsevier, vol. 257(1), pages 13-24.
    9. Sarper, H. & Henry, M. C., 1996. "Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop," Omega, Elsevier, vol. 24(1), pages 73-81, February.
    10. Pflughoeft, K. A. & Hutchinson, G. K. & Nazareth, D. L., 1996. "Intelligent decision support for flexible manufacturing: Design and implementation of a knowledge-based simulator," Omega, Elsevier, vol. 24(3), pages 347-360, June.
    11. Li, Heng & Li, Zhicheng & Li, Ling X. & Hu, Bin, 2000. "A production rescheduling expert simulation system," European Journal of Operational Research, Elsevier, vol. 124(2), pages 283-293, July.
    12. Alvarez-Valdes, R. & Fuertes, A. & Tamarit, J. M. & Gimenez, G. & Ramos, R., 2005. "A heuristic to schedule flexible job-shop in a glass factory," European Journal of Operational Research, Elsevier, vol. 165(2), pages 525-534, September.
    13. Amaral Armentano, Vinicius & Rigao Scrich, Cintia, 2000. "Tabu search for minimizing total tardiness in a job shop," International Journal of Production Economics, Elsevier, vol. 63(2), pages 131-140, January.
    14. Ouenniche, J. & Bertrand, J. W. M., 2001. "The finite horizon economic lot sizing problem in job shops: : the multiple cycle approach," International Journal of Production Economics, Elsevier, vol. 74(1-3), pages 49-61, December.
    15. Seifert, Ralf W. & Morito, Susumu, 2001. "Cooperative dispatching - exploiting the flexibility of an FMS by means of incremental optimization," European Journal of Operational Research, Elsevier, vol. 129(1), pages 116-133, February.
    16. Halkos, George & Kevork, Ilias, 2002. "Confidence intervals in stationary autocorrelated time series," MPRA Paper 31840, University Library of Munich, Germany.
    17. Sabuncuoglu, Ihsan & Lejmi, Tahar, 1999. "Scheduling for non regular performance measure under the due window approach," Omega, Elsevier, vol. 27(5), pages 555-568, October.
    18. K Hoad & S Robinson & R Davies, 2010. "Automated selection of the number of replications for a discrete-event simulation," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1632-1644, November.
    19. Yu Hang Jiang & Tong Liu & Zhiya Lou & Jeffrey S. Rosenthal & Shanshan Shangguan & Fei Wang & Zixuan Wu, 2022. "Markov Chain Confidence Intervals and Biases," International Journal of Statistics and Probability, Canadian Center of Science and Education, vol. 11(1), pages 1-29, March.
    20. El-Bouri, Ahmed & Balakrishnan, Subramaniam & Popplewell, Neil, 2008. "Cooperative dispatching for minimizing mean flowtime in a dynamic flowshop," International Journal of Production Economics, Elsevier, vol. 113(2), pages 819-833, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:proeco:v:48:y:1997:i:1:p:87-105. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.