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

Flow shop scheduling with deteriorating jobs under dominating machines

Author

Listed:
  • Wang, Ji-Bo
  • Xia, Zun-Quan

Abstract

This paper addresses no-wait or no-idle flow shop scheduling problems with deteriorating jobs, i.e., jobs whose processing times are an increasing function of their starting time. A simple linear deterioration function is assumed and some dominating relationships between machines can be satisfied. It is shown that for the problems to minimize makespan or weighted sum of completion time, polynomial algorithms still exist, although these problems are more complicated than the classical ones. When the objective is to minimize maximum lateness or maximum tardiness, the solutions of a classical version may not hold.

Suggested Citation

  • Wang, Ji-Bo & Xia, Zun-Quan, 2006. "Flow shop scheduling with deteriorating jobs under dominating machines," Omega, Elsevier, vol. 34(4), pages 327-336, August.
    • Handle: RePEc:eee:jomega:v:34:y:2006:i:4:p:327-336
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(04)00157-4
    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. Gur Mosheiov, 1991. "V-Shaped Policies for Scheduling Deteriorating Jobs," Operations Research, INFORMS, vol. 39(6), pages 979-991, December.
    2. Sid Browne & Uri Yechiali, 1990. "Scheduling Deteriorating Jobs on a Single Processor," Operations Research, INFORMS, vol. 38(3), pages 495-498, June.
    3. Xiang, S. & Tang, G. & Cheng, T. C. E., 2000. "Solvable cases of permutation flowshop scheduling with dominating machines," International Journal of Production Economics, Elsevier, vol. 66(1), pages 53-57, June.
    4. Cepek, Ondrej & Okada, Masanori & Vlach, Milan, 2002. "Nonpreemptive flowshop scheduling with machine dominance," European Journal of Operational Research, Elsevier, vol. 139(2), pages 245-261, June.
    5. van den Nouweland, Anne & Krabbenborg, Marc & Potters, Jos, 1992. "Flow-shops with a dominant machine," European Journal of Operational Research, Elsevier, vol. 62(1), pages 38-46, October.
    6. Cheng, T. C. E. & Ding, Q. & Lin, B. M. T., 2004. "A concise survey of scheduling with time-dependent processing times," European Journal of Operational Research, Elsevier, vol. 152(1), pages 1-13, January.
    7. Sundararaghavan, P. S. & Kunnathur, A. S., 1994. "Single machine scheduling with start time dependent processing times: Some solvable cases," European Journal of Operational Research, Elsevier, vol. 78(3), pages 394-403, November.
    8. Hsu, Y. S. & Lin, B. M. T., 2003. "Minimization of maximum lateness under linear deterioration," Omega, Elsevier, vol. 31(6), pages 459-469, December.
    9. Bachman, Aleksander & Janiak, Adam, 2000. "Minimizing maximum lateness under linear deterioration," European Journal of Operational Research, Elsevier, vol. 126(3), pages 557-566, 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. C-C He & C-C Wu & W-C Lee, 2009. "Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1759-1766, December.
    2. Cheng, Mingbao & Tadikamalla, Pandu R. & Shang, Jennifer & Zhang, Shaqing, 2014. "Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs," European Journal of Operational Research, Elsevier, vol. 234(3), pages 650-657.
    3. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    4. Ma, Ran & Tao, Jiping & Yuan, Jinjiang, 2016. "Online scheduling with linear deteriorating jobs to minimize the total weighted completion time," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 570-583.
    5. Yueyue Liu & Xiaoya Liao & Rui Zhang, 2019. "An Enhanced MOPSO Algorithm for Energy-Efficient Single-Machine Production Scheduling," Sustainability, MDPI, vol. 11(19), pages 1-16, September.
    6. Wang, John & Yan, Ruiliang & Hollister, Kimberly & Zhu, Dan, 2008. "A historic review of management science research in China," Omega, Elsevier, vol. 36(6), pages 919-932, December.
    7. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    8. J-B Wang & J-J Wang & P Ji, 2011. "Scheduling jobs with chain precedence constraints and deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1765-1770, September.
    9. Sawik, Tadeusz, 2010. "An integer programming approach to scheduling in a contaminated area," Omega, Elsevier, vol. 38(3-4), pages 179-191, June.
    10. Li, Yongqiang & Li, Gang & Sun, Linyan & Xu, Zhiyong, 2009. "Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times," International Journal of Production Economics, Elsevier, vol. 118(2), pages 424-429, April.
    11. Sun, Linhui & Sun, Linyan & Cui, Kai & Wang, Ji-Bo, 2010. "A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines," European Journal of Operational Research, Elsevier, vol. 200(1), pages 309-311, January.
    12. Cheng, Yushao & Sun, Shijie, 2009. "Scheduling linear deteriorating jobs with rejection on a single machine," European Journal of Operational Research, Elsevier, vol. 194(1), pages 18-27, April.

    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. Sun, Lin-Hui & Sun, Lin-Yan & Wang, Ming-Zheng & Wang, Ji-Bo, 2012. "Flow shop makespan minimization scheduling with deteriorating jobs under dominating machines," International Journal of Production Economics, Elsevier, vol. 138(1), pages 195-200.
    2. J-B Wang & Z-Q Xia, 2006. "Flow shop scheduling problems with deteriorating jobs under dominating machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 220-226, February.
    3. Li, Yongqiang & Li, Gang & Sun, Linyan & Xu, Zhiyong, 2009. "Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times," International Journal of Production Economics, Elsevier, vol. 118(2), pages 424-429, April.
    4. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    5. Cheng, Yushao & Sun, Shijie, 2009. "Scheduling linear deteriorating jobs with rejection on a single machine," European Journal of Operational Research, Elsevier, vol. 194(1), pages 18-27, April.
    6. Wang, Ji-Bo, 2007. "Single-machine scheduling problems with the effects of learning and deterioration," Omega, Elsevier, vol. 35(4), pages 397-402, August.
    7. C-C He & C-C Wu & W-C Lee, 2009. "Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1759-1766, December.
    8. Wu, Chin-Chia & Lee, Wen-Chiung, 2006. "Two-machine flowshop scheduling to minimize mean flow time under linear deterioration," International Journal of Production Economics, Elsevier, vol. 103(2), pages 572-584, October.
    9. Wang, Xiuli & Edwin Cheng, T.C., 2007. "Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 178(1), pages 57-70, April.
    10. Cheng, MingBao & Sun, ShiJie & He, LongMin, 2007. "Flow shop scheduling problems with deteriorating jobs on no-idle dominant machines," European Journal of Operational Research, Elsevier, vol. 183(1), pages 115-124, November.
    11. Hongfeng Wang & Min Huang & Junwei Wang, 2019. "An effective metaheuristic algorithm for flowshop scheduling with deteriorating jobs," Journal of Intelligent Manufacturing, Springer, vol. 30(7), pages 2733-2742, October.
    12. Dar-Li Yang & Wen-Hung Kuo, 2009. "Single-machine scheduling with both deterioration and learning effects," Annals of Operations Research, Springer, vol. 172(1), pages 315-327, November.
    13. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    14. C. Ng & Q. Ding & T. Cheng & S. Lam, 2012. "Preemptive repayment policy for multiple loans," Annals of Operations Research, Springer, vol. 192(1), pages 141-150, January.
    15. Cheng, T. C. E. & Ding, Q. & Lin, B. M. T., 2004. "A concise survey of scheduling with time-dependent processing times," European Journal of Operational Research, Elsevier, vol. 152(1), pages 1-13, January.
    16. A A K Jeng & B M T Lin, 2004. "Makespan minimization in single-machine scheduling with step-deterioration of processing times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(3), pages 247-256, March.
    17. Delorme, Maxence & Iori, Manuel & Mendes, Nilson F.M., 2021. "Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events," European Journal of Operational Research, Elsevier, vol. 295(3), pages 823-837.
    18. J-B Wang & Z-Q Xia, 2005. "Flow-shop scheduling with a learning effect," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(11), pages 1325-1330, November.
    19. W-H Kuo & D-L Yang, 2011. "A note on due-date assignment and single-machine scheduling with deteriorating jobs and learning effects," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(1), pages 206-210, January.
    20. Abbasali Jafari & Ghasem Moslehi, 2012. "Scheduling linear deteriorating jobs to minimize the number of tardy jobs," Journal of Global Optimization, Springer, vol. 54(2), pages 389-404, October.

    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:34:y:2006:i:4:p:327-336. 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.