IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v292y2020i1d10.1007_s10479-020-03653-1.html
   My bibliography  Save this article

Due-window assignment scheduling in the proportionate flow shop setting

Author

Listed:
  • Xinyu Sun

    (Xi’an Jiaotong University)

  • Xin-Na Geng

    (Xi’an Jiaotong University)

  • Tao Liu

    (Xi’an Jiaotong University)

Abstract

In this paper, we consider due-window assignment scheduling in the proportionate flow shop setting with position-dependent weights where the weights depend on the position in which a job is scheduled. Under the common due-window (CONW) and slack due-window (SLKW) assignment methods, the location of the window and its properties are established. The objective is to determine the sequence of all jobs to minimize the total weighted cost function where the total weighted cost function must also consider the window start time and size. Based on these considerations, the corresponding algorithm and algorithm complexity are proposed.

Suggested Citation

  • Xinyu Sun & Xin-Na Geng & Tao Liu, 2020. "Due-window assignment scheduling in the proportionate flow shop setting," Annals of Operations Research, Springer, vol. 292(1), pages 113-131, September.
    • Handle: RePEc:spr:annopr:v:292:y:2020:i:1:d:10.1007_s10479-020-03653-1
    DOI: 10.1007/s10479-020-03653-1
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-020-03653-1
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-020-03653-1?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. Li, Guo & Li, Na & Sambandam, Narayanasamy & Sethi, Suresh P. & Zhang, Faping, 2018. "Flow shop scheduling with jobs arriving at different times," International Journal of Production Economics, Elsevier, vol. 206(C), pages 250-260.
    2. Surya Liman & Shrikant Panwalkar & Sansern Thongmee, 1997. "A single machine scheduling problem with common due window and controllable processing times," Annals of Operations Research, Springer, vol. 70(0), pages 145-154, April.
    3. W.K. Yeung & Ceyda Oğuz & T.C. Cheng, 2001. "Minimizing Weighted Number of Early and Tardy Jobs with a Common Due Window Involving Location Penalty," Annals of Operations Research, Springer, vol. 108(1), pages 33-54, November.
    4. Cheng, T.C.E. & Wu, Chin-Chia & Chen, Juei-Chao & Wu, Wen-Hsiang & Cheng, Shuenn-Ren, 2013. "Two-machine flowshop scheduling with a truncated learning function to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 141(1), pages 79-86.
    5. Dujuan Wang & Yunqiang Yin & T.C.E. Cheng, 2017. "A bicriterion approach to common flow allowances due window assignment and scheduling with controllable processing times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 64(1), pages 41-63, February.
    6. G Mosheiov & A Sarig, 2008. "A due-window assignment problem with position-dependent processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 997-1003, July.
    7. Nour El Houda Tellache & Mourad Boudhar, 2018. "Flow shop scheduling problem with conflict graphs," Annals of Operations Research, Springer, vol. 261(1), pages 339-363, February.
    8. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    9. S.S. Panwalkar & Christos Koulamas, 2015. "On equivalence between the proportionate flow shop and single‐machine scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(7), pages 595-603, October.
    10. Enrique Gerstl & Gur Mosheiov, 2013. "Minmax due-date assignment with a time window for acceptable lead-times," Annals of Operations Research, Springer, vol. 211(1), pages 167-177, December.
    11. Pei, Jun & Pardalos, Panos M. & Liu, Xinbao & Fan, Wenjuan & Yang, Shanlin, 2015. "Serial batching scheduling of deteriorating jobs in a two-stage supply chain to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 244(1), pages 13-25.
    12. Ji-Bo Wang & Ming-Zheng Wang, 2014. "Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 31(05), pages 1-15.
    13. Baruch Mor & Gur Mosheiov, 2015. "Minimizing the number of early jobs on a proportionate flowshop," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(9), pages 1426-1429, September.
    14. Pablo Valledor & Alberto Gomez & Paolo Priore & Javier Puente, 2018. "Solving multi-objective rescheduling problems in dynamic permutation flow shop environments with disruptions," International Journal of Production Research, Taylor & Francis Journals, vol. 56(19), pages 6363-6377, October.
    15. Lin-Hui Sun & Kai Cui & Ju-Hong Chen & Jun Wang & Xian-Chen He, 2013. "Research on permutation flow shop scheduling problems with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 211(1), pages 473-480, December.
    16. Xinyu Sun & Xin-Na Geng, 2019. "Single-machine scheduling with deteriorating effects and machine maintenance," International Journal of Production Research, Taylor & Francis Journals, vol. 57(10), pages 3186-3199, May.
    17. Ji-Bo Wang & Ming-Zheng Wang, 2011. "Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects," Annals of Operations Research, Springer, vol. 191(1), pages 155-169, November.
    18. Cheng, T.C.E. & Yang, Suh-Jenq & Yang, Dar-Li, 2012. "Common due-window assignment and scheduling of linear time-dependent deteriorating jobs and a deteriorating maintenance activity," International Journal of Production Economics, Elsevier, vol. 135(1), pages 154-161.
    19. Ali Allahverdi & Erwin Pesch & Michael Pinedo & Frank Werner, 2018. "Scheduling in manufacturing systems: new trends and perspectives," International Journal of Production Research, Taylor & Francis Journals, vol. 56(19), pages 6333-6335, October.
    20. 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.
    21. Xinbao Liu & Shaojun Lu & Jun Pei & Panos M. Pardalos, 2018. "A hybrid VNS-HS algorithm for a supply chain scheduling problem with deteriorating jobs," International Journal of Production Research, Taylor & Francis Journals, vol. 56(17), pages 5758-5775, September.
    22. Y Yin & T C E Cheng & C-C Wu & S-R Cheng, 2014. "Single-machine due window assignment and scheduling with a common flow allowance and controllable job processing time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(1), pages 1-13, January.
    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. Jin Qian & Yu Zhan, 2022. "The Due Window Assignment Problems with Deteriorating Job and Delivery Time," Mathematics, MDPI, vol. 10(10), pages 1-16, May.
    2. Jin Qian & Haiyan Han, 2022. "Improved algorithms for proportionate flow shop scheduling with due-window assignment," Annals of Operations Research, Springer, vol. 309(1), pages 249-258, February.
    3. Yi-Chun Wang & Si-Han Wang & Ji-Bo Wang, 2023. "Resource Allocation Scheduling with Position-Dependent Weights and Generalized Earliness–Tardiness Cost," Mathematics, MDPI, vol. 11(1), pages 1-11, January.
    4. Lei Pan & Xinyu Sun & Ji-Bo Wang & Li-Han Zhang & Dan-Yang Lv, 2023. "Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-16, May.
    5. Zong-Jun Wei & Li-Yan Wang & Lei Zhang & Ji-Bo Wang & Ershen Wang, 2023. "Single-Machine Maintenance Activity Scheduling with Convex Resource Constraints and Learning Effects," Mathematics, MDPI, vol. 11(16), pages 1-21, August.
    6. Baruch Mor & Gur Mosheiov, 2021. "Minmax due-date assignment on a two-machine flowshop," Annals of Operations Research, Springer, vol. 305(1), pages 191-209, October.
    7. Hongyu He & Yanzhi Zhao & Xiaojun Ma & Yuan-Yuan Lu & Na Ren & Ji-Bo Wang, 2023. "Study on Scheduling Problems with Learning Effects and Past Sequence Delivery Times," Mathematics, MDPI, vol. 11(19), pages 1-19, September.

    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. Xue Huang & Na Yin & Wei-Wei Liu & Ji-Bo Wang, 2020. "Common Due Window Assignment Scheduling with Proportional Linear Deterioration Effects," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 37(01), pages 1-15, January.
    2. Yunqiang Yin & Du-Juan Wang & T C E Cheng & Chin-Chia Wu, 2016. "Bi-criterion single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(9), pages 1169-1183, September.
    3. Li, Gang & Wang, Xiao-Yuan & Wang, Ji-Bo & Sun, Lin-Yan, 2013. "Worst case analysis of flow shop scheduling problems with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 142(1), pages 98-104.
    4. Wu, Yu-Bin & Wan, Long & Wang, Xiao-Yuan, 2015. "Study on due-window assignment scheduling based on common flow allowance," International Journal of Production Economics, Elsevier, vol. 165(C), pages 155-157.
    5. Long Zhang & Yuzhong Zhang & Qingguo Bai, 0. "An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-13.
    6. Jin Qian & Haiyan Han, 2022. "Improved algorithms for proportionate flow shop scheduling with due-window assignment," Annals of Operations Research, Springer, vol. 309(1), pages 249-258, February.
    7. Bai, Danyu & Tang, Mengqian & Zhang, Zhi-Hai & Santibanez-Gonzalez, Ernesto DR, 2018. "Flow shop learning effect scheduling problem with release dates," Omega, Elsevier, vol. 78(C), pages 21-38.
    8. Lu Liu & Jian-Jun Wang & Xiao-Yuan Wang, 2016. "Single machine due-window assignment scheduling with resource-dependent processing times to minimise total resource consumption cost," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1186-1195, February.
    9. Yang, Dar-Li & Lai, Chien-Jung & Yang, Suh-Jenq, 2014. "Scheduling problems with multiple due windows assignment and controllable processing times on a single machine," International Journal of Production Economics, Elsevier, vol. 150(C), pages 96-103.
    10. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    11. Yin, Yunqiang & Cheng, T.C.E. & Hsu, Chou-Jung & Wu, Chin-Chia, 2013. "Single-machine batch delivery scheduling with an assignable common due window," Omega, Elsevier, vol. 41(2), pages 216-225.
    12. Long Zhang & Yuzhong Zhang & Qingguo Bai, 2022. "An approximation algorithm for a supply-chain scheduling problem with an assignable common due window and holding time," Journal of Combinatorial Optimization, Springer, vol. 44(4), pages 2167-2179, November.
    13. Rong-Rong Mao & Yi-Chun Wang & Dan-Yang Lv & Ji-Bo Wang & Yuan-Yuan Lu, 2023. "Delivery Times Scheduling with Deterioration Effects in Due Window Assignment Environments," Mathematics, MDPI, vol. 11(18), pages 1-18, September.
    14. Kaining Shao & Wenjuan Fan & Zishu Yang & Shanlin Yang & Panos M. Pardalos, 2022. "A column generation approach for patient scheduling with setup time and deteriorating treatment duration," Operational Research, Springer, vol. 22(3), pages 2555-2586, July.
    15. Yu, Tae-Sun & Han, Jun-Hee, 2021. "Scheduling proportionate flow shops with preventive machine maintenance," International Journal of Production Economics, Elsevier, vol. 231(C).
    16. Wenjuan Fan & Jun Pei & Xinbao Liu & Panos M. Pardalos & Min Kong, 2018. "Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning," Journal of Global Optimization, Springer, vol. 71(1), pages 147-163, May.
    17. Hui Zhu & Min Li & Zhangjin Zhou & Yun You, 2016. "Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3475-3490, June.
    18. Baruch Mor & Gur Mosheiov, 2021. "Minmax due-date assignment on a two-machine flowshop," Annals of Operations Research, Springer, vol. 305(1), pages 191-209, October.
    19. Gur Mosheiov & Assaf Sarig & Vitaly Strusevich, 2020. "Minmax scheduling and due-window assignment with position-dependent processing times and job rejection," 4OR, Springer, vol. 18(4), pages 439-456, December.
    20. Zhusong Liu & Zhenyou Wang & Yuan-Yuan Lu, 2017. "A Bicriteria Approach for Single Machine Scheduling with Resource Allocation, Learning Effect and a Deteriorating Maintenance Activity," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(04), pages 1-16, August.

    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:spr:annopr:v:292:y:2020:i:1:d:10.1007_s10479-020-03653-1. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.