Rescheduling to Minimize the Maximum Lateness Under the Sequence Disruptions of Original Jobs
Author
Abstract
Suggested Citation
DOI: 10.1142/S0217595917500245
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Jinjiang Yuan & Yundong Mu & Lingfa Lu & Wenhua Li, 2007. "Rescheduling With Release Dates To Minimize Total Sequence Disruption Under A Limit On The Makespan," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(06), pages 789-796.
- Nicholas G. Hall & Chris N. Potts, 2010. "Rescheduling for Job Unavailability," Operations Research, INFORMS, vol. 58(3), pages 746-755, June.
- 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.
- Hamsa Balakrishnan & Bala G. Chandran, 2010. "Algorithms for Scheduling Runway Operations Under Constrained Position Shifting," Operations Research, INFORMS, vol. 58(6), pages 1650-1665, December.
- 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.
- Yuan, Jinjiang & Mu, Yundong, 2007. "Rescheduling with release dates to minimize makespan under a limit on the maximum sequence disruption," European Journal of Operational Research, Elsevier, vol. 182(2), pages 936-944, October.
- Nicholas G. Hall & Chris N. Potts, 2004. "Rescheduling for New Orders," Operations Research, INFORMS, vol. 52(3), pages 440-453, June.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.
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.- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- 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.
- Paz Perez-Gonzalez & Jose M. Framinan, 2018. "Single machine interfering jobs problem with flowtime objective," Journal of Intelligent Manufacturing, Springer, vol. 29(5), pages 953-972, June.
- Perez-Gonzalez, Paz & Framinan, Jose M., 2014. "A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: Multi-agent scheduling problems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 1-16.
- Nicholas G. Hall & Chris N. Potts, 2010. "Rescheduling for Job Unavailability," Operations Research, INFORMS, vol. 58(3), pages 746-755, June.
- Yuhe Shi & Zhenggang He, 2018. "Decision Analysis of Disturbance Management in the Process of Medical Supplies Transportation after Natural Disasters," IJERPH, MDPI, vol. 15(8), pages 1-18, August.
- 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.
- Gaia Nicosia & Andrea Pacifici & Ulrich Pferschy & Julia Resch & Giovanni Righini, 2021. "Optimally rescheduling jobs with a Last-In-First-Out buffer," Journal of Scheduling, Springer, vol. 24(6), pages 663-680, December.
- 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.
- 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.
- 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.
- Altekin, F. Tevhide & Bukchin, Yossi, 2022. "A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing," European Journal of Operational Research, Elsevier, vol. 301(1), pages 235-253.
More about this item
Keywords
Rescheduling; sequence disruption; maximum lateness;All these keywords.
Statistics
Access and download statisticsCorrections
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:34:y:2017:i:05:n:s0217595917500245. 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.