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)

    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. 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.
    5. Kasper, T.A. Arno & Land, Martin J. & Teunter, Ruud H., 2023. "Towards System State Dispatching in High‐Variety Manufacturing," Omega, Elsevier, vol. 114(C).
    6. 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.
    7. 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).
    8. 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.
    9. 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.
    10. 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.
    11. 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.
    12. 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.
    13. Halkos, George & Kevork, Ilias, 2002. "Confidence intervals in stationary autocorrelated time series," MPRA Paper 31840, University Library of Munich, Germany.
    14. 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.
    15. He, Zesheng & Yang, Taeyong & Tiger, Andy, 1996. "An exchange heuristic imbedded with simulated annealing for due-dates job-shop scheduling," European Journal of Operational Research, Elsevier, vol. 91(1), pages 99-117, May.
    16. (Van) Enns, S. T., 1995. "An economic approach to job shop performance analysis," International Journal of Production Economics, Elsevier, vol. 38(2-3), pages 117-131, March.
    17. Halkos, George & Kevork, Ilias, 2006. "Estimating population means in covariance stationary process," MPRA Paper 31843, University Library of Munich, Germany.
    18. Philipp Melchiors & Rainer Kolisch & John J. Kanet, 2024. "The performance of priority rules for the dynamic stochastic resource-constrained multi-project scheduling problem: an experimental investigation," Annals of Operations Research, Springer, vol. 338(1), pages 569-595, July.
    19. 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.
    20. 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.

    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.