IDEAS home Printed from
   My bibliography  Save this article

A Note on Deteriorating Jobs and Learning in Single-Machine Scheduling Problems


  • Wen-Chiung Lee

    (Department of Statistics, Feng Chia University, Taiwan)


In this note, we investigate the effects of deterioration and learning in single-machine scheduling problems. Although the learning effect and the concept of deteriorating jobs have been extensively studied, they have never been considered simultaneously. It is shown in several examples that the optimal schedule of the problem may be different from that of the classical one. Nevertheless, the makespan and the total flow time minimization problems remain polynomial solvable.

Suggested Citation

  • Wen-Chiung Lee, 2004. "A Note on Deteriorating Jobs and Learning in Single-Machine Scheduling Problems," International Journal of Business and Economics, College of Business and College of Finance, Feng Chia University, Taichung, Taiwan, vol. 3(1), pages 83-89, April.
  • Handle: RePEc:ijb:journl:v:3:y:2004:i:1:p:83-89

    Download full text from publisher

    File URL:
    Download Restriction: no

    File URL:
    Download Restriction: no

    References listed on IDEAS

    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. Biskup, Dirk, 1999. "Single-machine scheduling with learning considerations," European Journal of Operational Research, Elsevier, vol. 115(1), pages 173-178, May.
    3. Mosheiov, Gur, 2001. "Scheduling problems with a learning effect," European Journal of Operational Research, Elsevier, vol. 132(3), pages 687-693, August.
    4. Voutsinas, Theodore G. & Pappis, Costas P., 2002. "Scheduling jobs with values exponentially deteriorating over time," International Journal of Production Economics, Elsevier, vol. 79(3), pages 163-169, October.
    5. 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 are extracted by the CitEc Project, subscribe to its RSS feed for this item.

    Cited by:

    1. Jun Pei & Xinbao Liu & Panos M. Pardalos & Athanasios Migdalas & Shanlin Yang, 2017. "Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine," Journal of Global Optimization, Springer, vol. 67(1), pages 251-262, January.
    2. repec:pal:jorsoc:v:60:y:2009:i:4:d:10.1057_palgrave.jors.2602607 is not listed on IDEAS
    3. 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.
    4. 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.

    More about this item


    scheduling; single machine; learning effect; deteriorating jobs;

    JEL classification:

    • C69 - Mathematical and Quantitative Methods - - Mathematical Methods; Programming Models; Mathematical and Simulation Modeling - - - Other


    Access and download statistics


    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:ijb:journl:v:3:y:2004:i:1:p:83-89. 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: (Yi-Ju Su). General contact details of provider: .

    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.