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

Single-machine scheduling problems with the effects of learning and deterioration

Author

Listed:
  • Wang, Ji-Bo

Abstract

In this paper, we consider the single-machine scheduling problems with the effects of learning and deterioration. By the effects of learning and deterioration, we mean that job processing times are defined by functions of their starting times and positions in the sequence. It is shown that even with the introduction of learning effect and deteriorating jobs to job processing times, single-machine makespan and sum of completion times (square) minimization problems remain polynomially solvable, respectively. But for the following objective functions: the weighted sum of completion times and the maximum lateness, this paper proves that the WSPT rule and the EDD rule can construct the optimal sequence under some special cases, respectively.

Suggested Citation

  • Wang, Ji-Bo, 2007. "Single-machine scheduling problems with the effects of learning and deterioration," Omega, Elsevier, vol. 35(4), pages 397-402, August.
  • Handle: RePEc:eee:jomega:v:35:y:2007:i:4:p:397-402
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(05)00099-X
    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. Kunnathur, Anand S. & Gupta, Sushil K., 1990. "Minimizing the makespan with late start penalties added to processing times in a single facility scheduling problem," European Journal of Operational Research, Elsevier, vol. 47(1), pages 56-64, July.
    2. Mosheiov, Gur, 2001. "Scheduling problems with a learning effect," European Journal of Operational Research, Elsevier, vol. 132(3), pages 687-693, August.
    3. 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.
    4. Bachman, Aleksander & Janiak, Adam, 2000. "Minimizing maximum lateness under linear deterioration," European Journal of Operational Research, Elsevier, vol. 126(3), pages 557-566, November.
    5. Biskup, Dirk & Simons, Dirk, 2004. "Common due date scheduling with autonomous and induced learning," European Journal of Operational Research, Elsevier, vol. 159(3), pages 606-616, December.
    6. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    7. Mosheiov, Gur & Sidney, Jeffrey B., 2003. "Scheduling with general job-dependent learning curves," European Journal of Operational Research, Elsevier, vol. 147(3), pages 665-670, June.
    8. 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.
    9. W. Townsend, 1978. "The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution," Management Science, INFORMS, vol. 24(5), pages 530-534, 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. Lee, Wen-Chiung & Chung, Yu-Hsiang, 2013. "Permutation flowshop scheduling to minimize the total tardiness with learning effects," International Journal of Production Economics, Elsevier, vol. 141(1), pages 327-334.
    2. Gawiejnowicz, Stanisław & Kurc, Wiesław, 2015. "Structural properties of time-dependent scheduling problems with the lp norm objective," Omega, Elsevier, vol. 57(PB), pages 196-202.
    3. 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.
    4. Lai, Peng-Jen & Lee, Wen-Chiung, 2011. "Single-machine scheduling with general sum-of-processing-time-based and position-based learning effects," Omega, Elsevier, vol. 39(5), pages 467-471, October.
    5. Sáenz-Royo, Carlos & Salas-Fumás, Vicente, 2013. "Learning to learn and productivity growth: Evidence from a new car-assembly plant," Omega, Elsevier, vol. 41(2), pages 336-344.
    6. Wang, J.-B. & Ng, C.T. & Cheng, T.C.E. & Liu, L.L., 2008. "Single-machine scheduling with a time-dependent learning effect," International Journal of Production Economics, Elsevier, vol. 111(2), pages 802-811, February.
    7. Sawik, Tadeusz, 2010. "An integer programming approach to scheduling in a contaminated area," Omega, Elsevier, vol. 38(3-4), pages 179-191, June.
    8. Lee, Wen-Chiung & Wu, Chin-Chia & Hsu, Peng-Hsiang, 2010. "A single-machine learning effect scheduling problem with release times," Omega, Elsevier, vol. 38(1-2), pages 3-11, February.
    9. 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.
    10. Chang, Pei-Chann & Chen, Shih-Hsin & Mani, V., 2009. "A note on due-date assignment and single machine scheduling with a learning/aging effect," International Journal of Production Economics, Elsevier, vol. 117(1), pages 142-149, January.
    11. Finke, Gerd & Gara-Ali, Ahmed & Espinouse, Marie-Laure & Jost, Vincent & Moncel, Julien, 2017. "Unified matrix approach to solve production-maintenance problems on a single machine," Omega, Elsevier, vol. 66(PA), pages 140-146.
    12. Corominas, Albert & Olivella, Jordi & Pastor, Rafael, 2010. "A model for the assignment of a set of tasks when work performance depends on experience of all tasks involved," International Journal of Production Economics, Elsevier, vol. 126(2), pages 335-340, August.
    13. repec:eee:jomega:v:78:y:2018:i:c:p:21-38 is not listed on IDEAS
    14. Gara-Ali, Ahmed & Finke, Gerd & Espinouse, Marie-Laure, 2016. "Parallel-machine scheduling with maintenance: Praising the assignment problem," European Journal of Operational Research, Elsevier, vol. 252(1), pages 90-97.
    15. 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.
    16. Biskup, Dirk, 2008. "A state-of-the-art review on scheduling with learning effects," European Journal of Operational Research, Elsevier, vol. 188(2), pages 315-329, July.
    17. 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.
    18. Qian, Jianbo & Steiner, George, 2013. "Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine," European Journal of Operational Research, Elsevier, vol. 225(3), pages 547-551.
    19. repec:pal:jorsoc:v:60:y:2009:i:4:d:10.1057_palgrave.jors.2602607 is not listed on IDEAS
    20. Janiak, Adam & Rudek, RadosLaw, 2010. "A note on a makespan minimization problem with a multi-ability learning effect," Omega, Elsevier, vol. 38(3-4), pages 213-217, June.

    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:35:y:2007:i:4:p:397-402. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.