IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v159y2004i1p258-263.html
   My bibliography  Save this article

A new rule for minimizing the number of tardy jobs in dynamic flow shops

Author

Listed:
  • Lodree, Emmett
  • Jang, Wooseung
  • Klein, Cerry M.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:159:y:2004:i:1:p:258-263
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(03)00404-1
    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. Hariri, A. M. A. & Potts, C. N., 1989. "A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop," European Journal of Operational Research, Elsevier, vol. 38(2), pages 227-226, January.
    2. 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.
    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.
    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. Sridharan, V. & Li, Xiaoming, 2008. "Improving delivery reliability by a new due-date setting rule," European Journal of Operational Research, Elsevier, vol. 186(3), pages 1201-1211, May.
    2. 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.
    3. Ruiz-Torres, Alex J. & Ho, Johnny C. & Ablanedo-Rosas, José H., 2011. "Makespan and workstation utilization minimization in a flowshop with operations flexibility," Omega, Elsevier, vol. 39(3), pages 273-282, June.
    4. Weibo Liu & Yan Jin & Mark Price, 2017. "New scheduling algorithms and digital tool for dynamic permutation flowshop with newly arrived order," International Journal of Production Research, Taylor & Francis Journals, vol. 55(11), pages 3234-3248, June.
    5. Chiang, Tsung-Che & Fu, Li-Chen, 2009. "Using a family of critical ratio-based approaches to minimize the number of tardy jobs in the job shop with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 196(1), pages 78-92, July.

    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. 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.
    2. 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.
    3. 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.
    4. 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.
    5. 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.
    6. 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.
    7. 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.
    8. 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).
    9. 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.
    10. 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.
    11. 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.
    12. Anurag Agarwal & Varghese S. Jacob & Hasan Pirkul, 2006. "An Improved Augmented Neural-Network Approach for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 119-128, February.
    13. Öner-Közen, Miray & Minner, Stefan, 2017. "Impact of priority sequencing decisions on on-time probability and expected tardiness of orders in make-to-order production systems with external due-dates," European Journal of Operational Research, Elsevier, vol. 263(2), pages 524-539.
    14. A. S. Xanthopoulos & D. E. Koulouriotis, 2018. "Cluster analysis and neural network-based metamodeling of priority rules for dynamic sequencing," Journal of Intelligent Manufacturing, Springer, vol. 29(1), pages 69-91, January.
    15. 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.
    16. Zhou, Hong & Cheung, Waiman & Leung, Lawrence C., 2009. "Minimizing weighted tardiness of job-shop scheduling using a hybrid genetic algorithm," European Journal of Operational Research, Elsevier, vol. 194(3), pages 637-649, May.
    17. E. Dhouib & J. Teghem & T. Loukil, 2018. "Non-permutation flowshop scheduling problem with minimal and maximal time lags: theoretical study and heuristic," Annals of Operations Research, Springer, vol. 267(1), pages 101-134, August.
    18. 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.
    19. 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.
    20. Koulamas, Christos, 1998. "On the complexity of two-machine flowshop problems with due date related objectives," European Journal of Operational Research, Elsevier, vol. 106(1), pages 95-100, April.

    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:ejores:v:159:y:2004:i:1:p:258-263. 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/eor .

    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.