IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v81y2018icp246-260.html
   My bibliography  Save this article

Parallel-machine rescheduling with job unavailability and rejection

Author

Listed:
  • Wang, Dujuan
  • Yin, Yunqiang
  • Cheng, T.C.E.

Abstract

We study the scheduling problem where a set of jobs has already been scheduled for processing on identical parallel machines to minimize the total completion time under the assumption that all the jobs are available at time zero. However, before processing begins, some jobs are delayed and become unavailable at time zero, so all the jobs need to be rescheduled with a view to not causing excessive schedule disruption with respect to the original schedule. To reduce the negative impact of job unavailability and achieve an acceptable service level, one option in rescheduling the jobs is to reject a subset of the jobs at a cost (the rejection cost). Three criteria are involved: the total completion time of the accepted jobs in the adjusted schedule, the degree of disruption measured by the maximum completion time disruption to any accepted job between the original and adjusted schedules, and the total rejection cost. The overall objective is to minimize the former criterion, while keeping the objective values of the latter two criteria to no greater than the given limits. We present two exact methods to solve the problem: (i) A dynamic programming based approach, establishing that the problem is NP-hard in the ordinary sense when the number of machines is fixed. (ii) An enhanced branch-and-price method that includes several features such as execution of the differential evolution algorithm for finding good initial feasible solutions and solving the pricing sub-problem, inclusion of reduced cost fixing during the inner iterations of the algorithm, and use of a heuristic procedure for constructing a good integer feasible solution. We perform extensive computational experiments to assess the efficiency of the proposed algorithms. The computational results demonstrate that the incorporated enhancements greatly improve the performance of the algorithm.

Suggested Citation

  • Wang, Dujuan & Yin, Yunqiang & Cheng, T.C.E., 2018. "Parallel-machine rescheduling with job unavailability and rejection," Omega, Elsevier, vol. 81(C), pages 246-260.
    • Handle: RePEc:eee:jomega:v:81:y:2018:i:c:p:246-260
    DOI: 10.1016/j.omega.2018.04.008
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048317301950
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2018.04.008?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. Shabtay, Dvir, 2014. "The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost," European Journal of Operational Research, Elsevier, vol. 233(1), pages 64-74.
    2. Rustogi, Kabir & Strusevich, Vitaly A., 2012. "Single machine scheduling with general positional deterioration and rate-modifying maintenance," Omega, Elsevier, vol. 40(6), pages 791-804.
    3. Aytug, Haldun & Lawley, Mark A. & McKay, Kenneth & Mohan, Shantha & Uzsoy, Reha, 2005. "Executing production schedules in the face of uncertainties: A review and some future directions," European Journal of Operational Research, Elsevier, vol. 161(1), pages 86-110, February.
    4. James C. Bean & John R. Birge & John Mittenthal & Charles E. Noon, 1991. "Matchup Scheduling with Multiple Resources, Release Dates and Disruptions," Operations Research, INFORMS, vol. 39(3), pages 470-483, June.
    5. Qi, Xiangtong & Bard, Jonathan F. & Yu, Gang, 2006. "Disruption management for machine scheduling: The case of SPT schedules," International Journal of Production Economics, Elsevier, vol. 103(1), pages 166-184, September.
    6. Dvir Shabtay & Nufar Gaspar & Liron Yedidsion, 2012. "A bicriteria approach to scheduling a single machine with job rejection and positional penalties," Journal of Combinatorial Optimization, Springer, vol. 23(4), pages 395-424, May.
    7. Luo, Wenchang & Liu, Feng, 2017. "On single-machine scheduling with workload-dependent maintenance duration," Omega, Elsevier, vol. 68(C), pages 119-122.
    8. Dahal, Keshav & Al-Arfaj, Khalid & Paudyal, Krishna, 2015. "Modelling generator maintenance scheduling costs in deregulated power markets," European Journal of Operational Research, Elsevier, vol. 240(2), pages 551-561.
    9. Gang Yu & Michael Argüello & Gao Song & Sandra M. McCowan & Anna White, 2003. "A New Era for Crew Recovery at Continental Airlines," Interfaces, INFORMS, vol. 33(1), pages 5-22, February.
    10. Hoogeveen, H. & Lenté, C. & T’kindt, V., 2012. "Rescheduling for new orders on a single machine with setup times," European Journal of Operational Research, Elsevier, vol. 223(1), pages 40-46.
    11. A. A. Farley, 1990. "A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems," Operations Research, INFORMS, vol. 38(5), pages 922-923, October.
    12. Xu, Dehua & Wan, Long & Liu, Aihua & Yang, Dar-Li, 2015. "Single machine total completion time scheduling problem with workload-dependent maintenance duration," Omega, Elsevier, vol. 52(C), pages 101-106.
    13. Nicholas G. Hall & Chris N. Potts, 2004. "Rescheduling for New Orders," Operations Research, INFORMS, vol. 52(3), pages 440-453, June.
    14. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    15. Yin, Yunqiang & Cheng, T.C.E. & Wang, Du-Juan, 2016. "Rescheduling on identical parallel machines with machine disruptions to minimize total completion time," European Journal of Operational Research, Elsevier, vol. 252(3), pages 737-749.
    16. Nicholas G. Hall & Chris N. Potts, 2010. "Rescheduling for Job Unavailability," Operations Research, INFORMS, vol. 58(3), pages 746-755, June.
    17. Yin, Yunqiang & Wang, Yan & Cheng, T.C.E. & Liu, Wenqi & Li, Jinhai, 2017. "Parallel-machine scheduling of deteriorating jobs with potential machine disruptions," Omega, Elsevier, vol. 69(C), pages 17-28.
    18. Ou, Jinwen & Zhong, Xueling, 2017. "Bicriteria order acceptance and scheduling with consideration of fill rate," European Journal of Operational Research, Elsevier, vol. 262(3), pages 904-907.
    19. Ali, Musrrat. & Siarry, Patrick & Pant, Millie., 2012. "An efficient Differential Evolution based algorithm for solving multi-objective optimization problems," European Journal of Operational Research, Elsevier, vol. 217(2), pages 404-416.
    20. Huo, Yumei & Zhao, Hairong, 2018. "Two machine scheduling subject to arbitrary machine availability constraint," Omega, Elsevier, vol. 76(C), pages 128-136.
    21. Nicholas G. Hall & Zhixin Liu & Chris N. Potts, 2007. "Rescheduling for Multiple New Orders," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 633-645, November.
    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. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2022. "Integer Optimization Model and Algorithm for the Stem Cell Culturing Problem," Omega, Elsevier, vol. 108(C).
    2. Sterna, Małgorzata, 2021. "Late and early work scheduling: A survey," Omega, Elsevier, vol. 104(C).
    3. Xiaoyun Xiong & Peng Zhou & Yunqiang Yin & T. C. E. Cheng & Dengfeng Li, 2019. "An exact branch‐and‐price algorithm for multitasking scheduling on unrelated parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(6), pages 502-516, September.
    4. Wang, Chao & Lim, Ming K & Zhao, Longfeng & Tseng, Ming-Lang & Chien, Chen-Fu & Lev, Benjamin, 2020. "The evolution of Omega-The International Journal of Management Science over the past 40 years: A bibliometric overview," Omega, Elsevier, vol. 93(C).
    5. Baruch Mor & Gur Mosheiov & Dana Shapira, 2021. "Single machine lot scheduling with optional job-rejection," Journal of Combinatorial Optimization, Springer, vol. 41(1), pages 1-11, January.
    6. Baruch Mor & Dana Shapira, 2022. "Single machine scheduling with non-availability interval and optional job rejection," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 480-497, August.
    7. Mohamadreza Dabiri & Mehdi Yazdani & Bahman Naderi & Hassan Haleh, 2022. "Modeling and solution methods for hybrid flow shop scheduling problem with job rejection," Operational Research, Springer, vol. 22(3), pages 2721-2765, July.
    8. Xingong Zhang & Win-Chin Lin & Chin-Chia Wu, 2022. "Rescheduling problems with allowing for the unexpected new jobs arrival," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 630-645, April.
    9. Oron, Daniel, 2021. "Two-agent scheduling problems under rejection budget constraints," Omega, Elsevier, vol. 102(C).
    10. Wang, Haibo & Alidaee, Bahram, 2019. "Effective heuristic for large-scale unrelated parallel machines scheduling problems," Omega, Elsevier, vol. 83(C), pages 261-274.
    11. Wenchang Luo & Rylan Chin & Alexander Cai & Guohui Lin & Bing Su & An Zhang, 2022. "A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 690-722, August.
    12. Yin, Yunqiang & Luo, Zunhao & Wang, Dujuan & Cheng, T.C.E., 2023. "Wasserstein distance‐based distributionally robust parallel‐machine scheduling," Omega, Elsevier, vol. 120(C).

    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. Wenchang Luo & Rylan Chin & Alexander Cai & Guohui Lin & Bing Su & An Zhang, 2022. "A tardiness-augmented approximation scheme for rejection-allowed multiprocessor rescheduling," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 690-722, August.
    2. Yin, Yunqiang & Cheng, T.C.E. & Wang, Du-Juan, 2016. "Rescheduling on identical parallel machines with machine disruptions to minimize total completion time," European Journal of Operational Research, Elsevier, vol. 252(3), pages 737-749.
    3. Wenchang Luo & Taibo Luo & Randy Goebel & Guohui Lin, 2018. "Rescheduling due to machine disruption to minimize the total weighted completion time," Journal of Scheduling, Springer, vol. 21(5), pages 565-578, October.
    4. Liu, Zhixin & Lu, Liang & Qi, Xiangtong, 2018. "Cost allocation in rescheduling with machine unavailable period," European Journal of Operational Research, Elsevier, vol. 266(1), pages 16-28.
    5. Yin, Yunqiang & Wang, Yan & Cheng, T.C.E. & Liu, Wenqi & Li, Jinhai, 2017. "Parallel-machine scheduling of deteriorating jobs with potential machine disruptions," Omega, Elsevier, vol. 69(C), pages 17-28.
    6. Nicholas G. Hall & Chris N. Potts, 2010. "Rescheduling for Job Unavailability," Operations Research, INFORMS, vol. 58(3), pages 746-755, June.
    7. Qiulan Zhao & Jinjiang Yuan, 2017. "Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(05), pages 1-12, October.
    8. Li, Chung-Lun & Li, Feng, 2020. "Rescheduling production and outbound deliveries when transportation service is disrupted," European Journal of Operational Research, Elsevier, vol. 286(1), pages 138-148.
    9. M Ozlen & M Azizoğlu, 2011. "Rescheduling unrelated parallel machines with total flow time and total disruption cost criteria," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 152-164, January.
    10. Qiulan Zhao & Lingfa Lu & Jinjiang Yuan, 2016. "Rescheduling with new orders and general maximum allowable time disruptions," 4OR, Springer, vol. 14(3), pages 261-280, September.
    11. Xingong Zhang & Win-Chin Lin & Chin-Chia Wu, 2022. "Rescheduling problems with allowing for the unexpected new jobs arrival," Journal of Combinatorial Optimization, Springer, vol. 43(3), pages 630-645, April.
    12. Hanane Krim & Nicolas Zufferey & Jean-Yves Potvin & Rachid Benmansour & David Duvivier, 2022. "Tabu search for a parallel-machine scheduling problem with periodic maintenance, job rejection and weighted sum of completion times," Journal of Scheduling, Springer, vol. 25(1), pages 89-105, February.
    13. Zhong, Xueling & Fan, Jie & Ou, Jinwen, 2022. "Coordinated scheduling of the outsourcing, in-house production and distribution operations," European Journal of Operational Research, Elsevier, vol. 302(2), pages 427-437.
    14. Ulrich Pferschy & Julia Resch & Giovanni Righini, 2023. "Algorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs," Journal of Scheduling, Springer, vol. 26(3), pages 267-287, June.
    15. Jinwen Ou, 2020. "Near-linear-time approximation algorithms for scheduling a batch-processing machine with setups and job rejection," Journal of Scheduling, Springer, vol. 23(5), pages 525-538, October.
    16. Liu, Weihua & Liang, Zhicheng & Ye, Zi & Liu, Liang, 2016. "The optimal decision of customer order decoupling point for order insertion scheduling in logistics service supply chain," International Journal of Production Economics, Elsevier, vol. 175(C), pages 50-60.
    17. Qi, Xiangtong & Bard, Jonathan F. & Yu, Gang, 2006. "Disruption management for machine scheduling: The case of SPT schedules," International Journal of Production Economics, Elsevier, vol. 103(1), pages 166-184, September.
    18. Wu, Xueqi & Che, Ada, 2019. "A memetic differential evolution algorithm for energy-efficient parallel machine scheduling," Omega, Elsevier, vol. 82(C), pages 155-165.
    19. Koulamas, Christos & Kyparisis, George J., 2023. "A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems," European Journal of Operational Research, Elsevier, vol. 305(3), pages 999-1017.
    20. Yin, Yunqiang & Luo, Zunhao & Wang, Dujuan & Cheng, T.C.E., 2023. "Wasserstein distance‐based distributionally robust parallel‐machine scheduling," Omega, Elsevier, vol. 120(C).

    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:jomega:v:81:y:2018:i:c:p:246-260. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.