Skip to main content
SpringerLink
Log in

Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning

  • ORIGINAL ARTICLE
  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

Abstract

The paper deals with some single-machine scheduling problems with setup time considerations where the processing time of a job is given as a function of its starting times and position in a sequence. The setup times are proportional to the length of the already processed jobs, i.e., the setup times are past-sequence-dependent (p-s-d). We consider the following objective functions: the makespan, the total completion time, the sum of the δth (\( \delta \geqslant 0 \)) power of job completion times, the total weighted completion time, the maximum lateness and the number of tardy jobs. We show that the makespan minimization problem, the total completion time minimization problem, and the sum of the δth power of job completion times minimization problem can be solved in polynomial time, respectively. We also show that the total weighted completion time minimization problem, the maximum lateness minimization problem and the number of tardy jobs minimization problem can be solved in polynomial time under certain conditions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Allahverdi A, Gupta JND, Aldowaisan T (1999) A review of scheduling research involving setup considerations. Omega 27:219–239

    Article  Google Scholar 

  2. Allahverdi A, Ng CT, Cheng TCE, Kovalyov MY (2008) A survey of scheduling problems with setup times or costs. Eur J Oper Res 187:985–1032

    Article  MathSciNet  Google Scholar 

  3. Koulamas C, Kyparisis GJ (2008) Single-machine scheduling problems with past-sequence-dependent setup times. Eur J Oper Res 187:68–72

    Google Scholar 

  4. Kuo W-H, Yang D-L (2007) Single-machine scheduling with past-sequence-dependent setup and learning effects. Inf Process Lett 102:22–26

    Article  MathSciNet  Google Scholar 

  5. Alidaee B, Womer NK (1999) Scheduling with time-dependent processing times: review and extensions. J Oper Res Soc 50:711–720

    Article  MATH  Google Scholar 

  6. Cheng TCE, Ding Q, Lin BMT (2004) A concise survey of scheduling with time-dependent processing times. Eur J Oper Res 152:1–13

    Article  MATH  MathSciNet  Google Scholar 

  7. Biskup D (2008) A state-of-the-art review on scheduling with learning effects. Eur J Oper Res 188:315–329

    Article  MATH  MathSciNet  Google Scholar 

  8. Wu C-C, Lee W-C, Shiau Y-R (2007) Minimizing the total weighted completion time on a single machine under linear deterioration. Int J Adv Manuf Technol 33:1237–1243

    Article  Google Scholar 

  9. Shiau Y-R, Lee W-C, Wu C-C, Chang C-M (2007) Two-machine flowshop scheduling to minimize mean flow time under simple linear deterioration. Int J Adv Manuf Technol 34:774–782

    Article  Google Scholar 

  10. Wang J-B, Lin L, Shan F (2007) Single-machine group scheduling problems with deteriorating jobs. Int J Adv Manuf Technol DOI 10.1007/s00170-007-1255-x

  11. Toksar MD, Guner E (2007) Minimizing the earliness/tardiness costs on parallel machine with learning effects and deteriorating jobs: a mixed nonlinear integer programming approach. Int J Adv Manuf Technol DOI 10.1007/s00170-007-1128-3

  12. Eren T, Guner E (2008) A bicriteria parallel machine scheduling with a learning effect. Int J Adv Manuf Technol DOI 10.1007/s00170-008-1436-2

  13. Wang J-B, Cheng TCE (2007) Scheduling problems with the effects of deterioration and learning. Asia-Pac J Oper Res 24(2):245–261

    Article  MathSciNet  Google Scholar 

  14. Graham RL, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discrete Math 5:287–326

    Article  MATH  MathSciNet  Google Scholar 

  15. Townsend W (1978) The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution. Manage Sci 24:530–534

    Article  MATH  Google Scholar 

  16. Moore J (1968) An n job, one machine sequencing algorithm for minimizing the number of late jobs. Manage Sci 15:102–109

    Article  MATH  Google Scholar 

  17. Pinedo M (1995) Scheduling theory, algorithms, and systems. Prentice Hall, New Jersey

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Science, Shenyang Institute of Aeronautical Engineering, Shenyang, 110136, People’s Republic of China

    Ji-Bo Wang & Yong Jiang

  2. School of Humanities and Social Sciences, Dalian University of Technology, Dalian, 116024, People’s Republic of China

    Gang Wang

  3. School of Marxism, Shenyang Normal University, Shenyang, 110034, People’s Republic of China

    Gang Wang

Authors
  1. Ji-Bo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yong Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gang Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ji-Bo Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, JB., Jiang, Y. & Wang, G. Single-machine scheduling with past-sequence-dependent setup times and effects of deterioration and learning. Int J Adv Manuf Technol 41, 1221–1226 (2009). https://doi.org/10.1007/s00170-008-1512-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-008-1512-7

Keywords

Search

Navigation