Skip to main content
SpringerLink
Log in

Single-machine group scheduling problems with deteriorating jobs

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

Abstract

This paper investigates single-machine scheduling problems with deteriorating jobs and the group technology (GT) assumption. By deteriorating jobs and the group technology assumption, we mean that the group setup times and job processing times are both increasing functions of their starting times, i.e., the group setup times and job processing times are both described by a function which is proportional to a linear function of time. The two objectives of scheduling problems are to minimize the makespan and the total weighted completion time, respectively. We show that these problems remain solvable in polynomial time when deterioration and group technology are considered simultaneously.

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

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

  3. Guo A-X, Wang J-B (2005) Single machine scheduling with deteriorating jobs under the group technology assumption. Int J Pure Appli Math 18:225–231

    MATH  MathSciNet  Google Scholar 

  4. Janiak A, Kovalyov MY (2006) Scheduling in a contaminated area: a model and polynomial algorithms. Eur J Oper Res 173:125–132

    Article  MATH  MathSciNet  Google Scholar 

  5. Wang J-B, Ng CTD, Cheng TCE, Liu L-L (2006) Minimizing total completion time in a two-machine flow shop with deteriorating jobs. Appl Math Comput 180:185–193

    Article  MATH  MathSciNet  Google Scholar 

  6. Wang J-B, Xia Z-Q (2005) Scheduling jobs under decreasing linear deterioration. Inf Process Lett 94:63–69

    Article  MathSciNet  Google Scholar 

  7. Wang J-B, Xia Z-Q (2006) Flow shop scheduling with deteriorating jobs under dominating machines. Omega 34:327–336

    Article  MathSciNet  Google Scholar 

  8. Wang J-B, Xia Z-Q (2006) Flow shop scheduling problems with deteriorating jobs under dominating machines. J Oper Res Soc 57:220–226

    MATH  Google Scholar 

  9. Xu F, Guo A-X, Wang J-B, Shan F (2006) Single machine scheduling problem with linear deterioration under group technology. Int J Pure Appli Math 28:401–406

    MATH  MathSciNet  Google Scholar 

  10. Gawiejnowicz S, Kurc W, Pankowska L (2006) Pareto and scalar bicriterion optimization in scheduling deteriorating jobs. Comput Oper Res 33:746–767

    Article  MATH  MathSciNet  Google Scholar 

  11. Gawiejnowicz S (2007) Scheduling deteriorating jobs subject to job or machine availability constraints. Eur J Oper Res 180:472–478

    Article  MATH  Google Scholar 

  12. Wang J-B (2007) Flow shop scheduling problems with decreasing linear deterioration under dominant machines. Comput Oper Res 34:2043–2058

    Article  MATH  Google Scholar 

  13. Wang J-B, Guo A-X, Shan F, Jiang B, Wang L-Y (2007) Single machine group scheduling under decreasing linear deterioration. J Appl Math Comput 24:283–293

    Article  MATH  MathSciNet  Google Scholar 

  14. Wu C-C, Shiau Y-R, Lee W-C (2007) Single-machine group scheduling problems with deterioration consideration. Comput Oper Res 35:1652–1659

    Article  Google Scholar 

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

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

  17. Wang J-B, Ng CT, Cheng TCE (2007) Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint. Comput Oper Res (in press)

  18. Potts CN, Van Wassenhove LN (1992) Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J Oper Res Soc 43:395–406

    Article  MATH  Google Scholar 

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

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, Lin Lin & Feng Shan

Authors
  1. Ji-Bo Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lin Lin
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Feng Shan
    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., Lin, L. & Shan, F. Single-machine group scheduling problems with deteriorating jobs. Int J Adv Manuf Technol 39, 808–812 (2008). https://doi.org/10.1007/s00170-007-1255-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00170-007-1255-x

Keywords

Search

Navigation