IDEAS home Printed from https://ideas.repec.org/a/wsi/apjorx/v37y2020i01ns0217595919500325.html
   My bibliography  Save this article

Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates

Author

Listed:
  • Myoung-Ju Park

    (Department of Industrial and Management Systems Engineering, Kyung Hee University, 1732, Deogyeong-daero, Giheung-gu, Yongin-si, Gyeonggi-do 17104, Korea)

  • Byung-Cheon Choi

    (Department of Business Administration, Chungnam National University, 99 Daehak-ro, Yuseong-gu, Daejeon 34134, Korea)

  • Yunhong Min

    (Graduate School of Logistics, Incheon National University, 119, Academy-ro, Yeonsu-gu, Incheon, Gyeonggi-do 22012, Korea)

  • Kyung Min Kim

    (Department of Industrial Management and Engineering, Myong Ji University, 116 MyongJi-ro, Choein-gu, Yongin-si, Gyeonggido 449-728, Korea)

Abstract

We consider a two-machine flow shop scheduling with two properties. The first is that each due date is assigned for a specific position different from the traditional definition of due dates, and the second is that a consistent pattern exists in the processing times within each job and each machine. The objective is to minimize maximum tardiness, total tardiness, or total number of tardy jobs. We prove the strong NP-hardness and inapproximability, and investigate some polynomially solvable cases. Finally, we develop heuristics and verify their performances through numerical experiments.

Suggested Citation

  • Myoung-Ju Park & Byung-Cheon Choi & Yunhong Min & Kyung Min Kim, 2020. "Two-Machine Ordered Flow Shop Scheduling with Generalized Due Dates," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(01), pages 1-16, January.
    • Handle: RePEc:wsi:apjorx:v:37:y:2020:i:01:n:s0217595919500325
    DOI: 10.1142/S0217595919500325
    as

    Download full text from publisher

    File URL: https://www.worldscientific.com/doi/abs/10.1142/S0217595919500325
    Download Restriction: Access to full text is restricted to subscribers
    File URL: https://libkey.io/10.1142/S0217595919500325?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Edmund Burke & Michael Pinedo, 2019. "Journal of scheduling (2019)," Journal of Scheduling, Springer, vol. 22(1), pages 1-2, February.
    2. M. L. Smith & S. S. Panwalkar & R. A. Dudek, 1975. "Flowshop Sequencing Problem with Ordered Processing Time Matrices," Management Science, INFORMS, vol. 21(5), pages 544-549, January.
    3. M. L. Smith & S. S. Panwalkar & R. A. Dudek, 1976. "Flowshop sequencing problem with ordered processing time matrices: A general case," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 23(3), pages 481-486, September.
    4. Byung-Cheon Choi & Myoung-Ju Park, 2014. "OUTSOURCING DECISIONS IN m-MACHINE PERMUTATION FLOW SHOP SCHEDULING PROBLEMS WITH MACHINE-DEPENDENT PROCESSING TIMES," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(04), pages 1-10.
    5. Byung-Gyoo Kim & Byung-Cheon Choi & Myoung-Ju Park, 2017. "Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(04), pages 1-17, August.
    6. Byung-Cheon Choi & Myoung-Ju Park, 2018. "Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(06), pages 1-13, December.
    7. Byung-Cheon Choi & Myoung-Ju Park, 2016. "An Ordered Flow Shop with Two Agents," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(05), pages 1-24, October.
    8. Lee, Kangbok & Zheng, Feifeng & Pinedo, Michael L., 2019. "Online scheduling of ordered flow shops," European Journal of Operational Research, Elsevier, vol. 272(1), pages 50-60.
    9. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    10. Lin, B.M.T. & Liu, S.T., 2008. "Maximizing the reward in the relocation problem with generalized due dates," International Journal of Production Economics, Elsevier, vol. 115(1), pages 55-63, September.
    11. S.S. Panwalkar & Milton L. Smith & Christos Koulamas, 2013. "Review of the ordered and proportionate flow shop scheduling research," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 46-55, February.
    12. Hall, Nicholas G. & Sethi, Suresh P. & Sriskandarajah, Chelliah, 1991. "On the complexity of generalized due date scheduling problems," European Journal of Operational Research, Elsevier, vol. 51(1), pages 100-109, March.
    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. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    2. Ma, Ran & Guo, Sainan, 2021. "Applying “Peeling Onion” approach for competitive analysis in online scheduling with rejection," European Journal of Operational Research, Elsevier, vol. 290(1), pages 57-67.
    3. Mosheiov, Gur & Oron, Daniel & Shabtay, Dvir, 2021. "Minimizing total late work on a single machine with generalized due-dates," European Journal of Operational Research, Elsevier, vol. 293(3), pages 837-846.
    4. Lee, Kangbok & Zheng, Feifeng & Pinedo, Michael L., 2019. "Online scheduling of ordered flow shops," European Journal of Operational Research, Elsevier, vol. 272(1), pages 50-60.
    5. Bowen Pang & Xiaolei Xie & Feng Ju & James Pipe, 2022. "A dynamic sequential decision-making model on MRI real-time scheduling with simulation-based optimization," Health Care Management Science, Springer, vol. 25(3), pages 426-440, September.
    6. S.S. Panwalkar & Milton L. Smith & Christos Koulamas, 2013. "Review of the ordered and proportionate flow shop scheduling research," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(1), pages 46-55, February.
    7. Baruch Mor & Gur Mosheiov & Dvir Shabtay, 2021. "Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates," Journal of Scheduling, Springer, vol. 24(6), pages 553-567, December.
    8. Byung-Cheon Choi & Joseph Y.-T. Leung & Michael L. Pinedo, 2011. "Minimizing makespan in an ordered flow shop with machine-dependent processing times," Journal of Combinatorial Optimization, Springer, vol. 22(4), pages 797-818, November.
    9. Yu, Tae-Sun & Pinedo, Michael, 2020. "Flow shops with reentry: Reversibility properties and makespan optimal schedules," European Journal of Operational Research, Elsevier, vol. 282(2), pages 478-490.
    10. S. S. Panwalkar & Christos Koulamas, 2019. "The evolution of schematic representations of flow shop scheduling problems," Journal of Scheduling, Springer, vol. 22(4), pages 379-391, August.
    11. Byung-Cheon Choi & Myoung-Ju Park, 2021. "Single-machine scheduling with periodic due dates to minimize the total earliness and tardy penalty," Journal of Combinatorial Optimization, Springer, vol. 41(4), pages 781-793, May.
    12. Castro, Pedro M. & Harjunkoski, Iiro & Grossmann, Ignacio E., 2019. "Discrete and continuous-time formulations for dealing with break periods: Preemptive and non-preemptive scheduling," European Journal of Operational Research, Elsevier, vol. 278(2), pages 563-577.
    13. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    14. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    15. Jiang, Yiwei & Wu, Mengjing & Chen, Xin & Dong, Jianming & Cheng, T.C.E. & Blazewicz, Jacek & Ji, Min, 2024. "Online early work scheduling on parallel machines," European Journal of Operational Research, Elsevier, vol. 315(3), pages 855-862.
    16. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    17. Chenchen Ma & Jing Ouyang & Gongjun Xu, 2023. "Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models," Psychometrika, Springer;The Psychometric Society, vol. 88(1), pages 175-207, March.
    18. Aidin Rezaeian & Hamidreza Koosha & Mohammad Ranjbar & Saeed Poormoaied, 2024. "The assignment of project managers to projects in an uncertain dynamic environment," Annals of Operations Research, Springer, vol. 341(2), pages 1107-1134, October.
    19. Christoph Hertrich & Christian Weiß & Heiner Ackermann & Sandy Heydrich & Sven O. Krumke, 2022. "Online algorithms to schedule a proportionate flexible flow shop of batching machines," Journal of Scheduling, Springer, vol. 25(6), pages 643-657, December.
    20. Tran Hoang Hai, 2020. "Estimation of volatility causality in structural autoregressions with heteroskedasticity using independent component analysis," Statistical Papers, Springer, vol. 61(1), pages 1-16, February.

    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:wsi:apjorx:v:37:y:2020:i:01:n:s0217595919500325. 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: Tai Tone Lim (email available below). General contact details of provider: http://www.worldscinet.com/apjor/apjor.shtml .

    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.