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

New approaches to due date assignment in job shops

Author

Listed:
  • Baykasoglu, Adil
  • Gocken, Mustafa
  • Unutmaz, Zeynep D.

Abstract

No abstract is available for this item.

Suggested Citation

  • Baykasoglu, Adil & Gocken, Mustafa & Unutmaz, Zeynep D., 2008. "New approaches to due date assignment in job shops," European Journal of Operational Research, Elsevier, vol. 187(1), pages 31-45, May.
    • Handle: RePEc:eee:ejores:v:187:y:2008:i:1:p:31-45
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00242-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. Hino, Celso M. & Ronconi, Debora P. & Mendes, Andre B., 2005. "Minimizing earliness and tardiness penalties in a single-machine problem with a common due date," European Journal of Operational Research, Elsevier, vol. 160(1), pages 190-201, January.
    2. Sabuncuoglu, I. & Comlekci, A., 2002. "Operation-based flowtime estimation in a dynamic job shop," Omega, Elsevier, vol. 30(6), pages 423-442, December.
    3. Kenneth R. Baker, 1984. "Sequencing Rules and Due-Date Assignments in a Job Shop," Management Science, INFORMS, vol. 30(9), pages 1093-1104, September.
    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. Georgiadis, Patroklos & Michaloudis, Charalampos, 2012. "Real-time production planning and control system for job-shop manufacturing: A system dynamics analysis," European Journal of Operational Research, Elsevier, vol. 216(1), pages 94-104.
    2. 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.
    3. Tanja Mlinar & Philippe Chevalier, 2016. "Pooling heterogeneous products for manufacturing environments," 4OR, Springer, vol. 14(2), pages 173-200, June.
    4. Yu-Cheng Wang & Horng-Ren Tsai & Toly Chen, 2021. "A Selectively Fuzzified Back Propagation Network Approach for Precisely Estimating the Cycle Time Range in Wafer Fabrication," Mathematics, MDPI, vol. 9(12), pages 1-18, June.
    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.

    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. 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.
    2. Chuang Wang & Pingyu Jiang, 2019. "Deep neural networks based order completion time prediction by using real-time job shop RFID data," Journal of Intelligent Manufacturing, Springer, vol. 30(3), pages 1303-1318, March.
    3. Thürer, Matthias & Stevenson, Mark & Silva, Cristovao & Qu, Ting, 2017. "Drum-buffer-rope and workload control in High-variety flow and job shops with bottlenecks: An assessment by simulation," International Journal of Production Economics, Elsevier, vol. 188(C), pages 116-127.
    4. Adenso-Diaz, Belarmino, 1996. "An SA/TS mixture algorithm for the scheduling tardiness problem," European Journal of Operational Research, Elsevier, vol. 88(3), pages 516-524, February.
    5. Sabuncuoglu, I. & Bayiz, M., 1999. "Job shop scheduling with beam search," European Journal of Operational Research, Elsevier, vol. 118(2), pages 390-412, October.
    6. Guinet, Alain & Legrand, Marie, 1998. "Reduction of job-shop problems to flow-shop problems with precedence constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 96-110, August.
    7. Pinar Keskinocak & R. Ravi & Sridhar Tayur, 2001. "Scheduling and Reliable Lead-Time Quotation for Orders with Availability Intervals and Lead-Time Sensitive Revenues," Management Science, INFORMS, vol. 47(2), pages 264-279, February.
    8. Guo, Daqiang & Li, Mingxing & Lyu, Zhongyuan & Kang, Kai & Wu, Wei & Zhong, Ray Y. & Huang, George Q., 2021. "Synchroperation in industry 4.0 manufacturing," International Journal of Production Economics, Elsevier, vol. 238(C).
    9. Mark L. Spearman & Rachel Q. Zhang, 1999. "Optimal Lead Time Policies," Management Science, INFORMS, vol. 45(2), pages 290-295, February.
    10. 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.
    11. Land, Martin J. & Stevenson, Mark & Thürer, Matthias & Gaalman, Gerard J.C., 2015. "Job shop control: In search of the key to delivery improvements," International Journal of Production Economics, Elsevier, vol. 168(C), pages 257-266.
    12. Matthias Thürer & Mark Stevenson, 2016. "Workload control in job shops with re-entrant flows: an assessment by simulation," International Journal of Production Research, Taylor & Francis Journals, vol. 54(17), pages 5136-5150, September.
    13. Bertrand, J. W. M. & Sridharan, V., 2001. "A study of simple rules for subcontracting in make-to-order manufacturing," European Journal of Operational Research, Elsevier, vol. 128(3), pages 509-531, February.
    14. Lin, Shih-Wei & Chou, Shuo-Yan & Ying, Kuo-Ching, 2007. "A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1294-1301, March.
    15. Andreas C. Nearchou & Sotiris L. Omirou, 2024. "Self-Adaptive Biased Differential Evolution for Scheduling Against Common Due Dates," SN Operations Research Forum, Springer, vol. 5(2), pages 1-29, June.
    16. 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.
    17. Bertrand, J. W. M. & van Ooijen, H. P. G., 2000. "Customer order lead times for production based on lead time and tardiness costs," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 257-265, March.
    18. Chen, Wei-Yang & Sheen, Gwo-Ji, 2007. "Single-machine scheduling with multiple performance measures: Minimizing job-dependent earliness and tardiness subject to the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 109(1-2), pages 214-229, September.
    19. Jing, Hao & Sheng, Lijuan & Luo, Chaorui & Kwak, Choonjong, 2021. "Statistical analysis of family based dispatching rules and preemption," International Journal of Production Economics, Elsevier, vol. 240(C).
    20. Enns, S. T., 1998. "Lead time selection and the behaviour of work flow in job shops," European Journal of Operational Research, Elsevier, vol. 109(1), pages 122-136, August.

    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:187:y:2008:i:1:p:31-45. 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.