Skip to main content

Scheduling with Pure and Combined Additive Start-Time-Dependent Effects

  • Chapter
  • First Online:
Scheduling with Time-Changing Effects and Rate-Modifying Activities

Part of the book series: International Series in Operations Research & Management Science ((ISOR,volume 243))

  • 586 Accesses

Abstract

In this chapter, we study the problems of minimizing the makespan and the total completion time on a single machine, provided that the actual processing times of the jobs are subject to a special form of a start-time-dependent effect. We also study effects in which such a start-time-dependent effect is combined with a positional effect.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

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

    Article  Google Scholar 

  • Bachman A, Janiak A, Kovalyov MY (2002) Minimizing the total weighted completion time of deteriorating jobs. Inf Process Lett 81:81–84

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Browne S, Yechiali U (1990) Scheduling deteriorating jobs on a single processor. Oper Res 38:495–498

    Google Scholar 

  • 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  Google Scholar 

  • Gawiejnowicz S (2008) Time-dependent scheduling. Springer, Berlin

    Google Scholar 

  • Gawiejnowicz S, Pankovska L (1995) Scheduling jobs with varying processing times. Inf Process Lett 54:175–178

    Article  Google Scholar 

  • Gordon VS, Potts CN, Strusevich VA, Whitehead JD (2008) Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. J Sched 11:357–370

    Article  Google Scholar 

  • Gupta JND, Gupta SK (1988) Single facility scheduling with nonlinear processing times. Comput Ind Engine 14:387–393

    Article  Google Scholar 

  • Ho KI-J, Leung JY-T, Wei W-D (1993) Complexity of scheduling tasks with time dependent execution times. Inf Process Lett 48:315–320

    Article  Google Scholar 

  • Janiak A, Kovalyov MY (2006) Scheduling deteriorating jobs. In: Janiak A (ed) Scheduling in computer and manufacturing systems. Wydawnictwa Komuniikacji i Łączności, Warsaw, pp 12–25

    Google Scholar 

  • Kubale M, Ocetkiewicz KM (2009) A new optimal algorithm for a time-dependent scheduling problem, Contr Cybern 38:713–21

    Google Scholar 

  • Kuo W-H, Yang D-L (2007) Single-machine scheduling problems with start-time dependent processing time. Comp Math Appl 53:1658–1664

    Article  Google Scholar 

  • Melnikov OI, Shafransky YM (1980) Parametric problem of scheduling theory. Cybernetics 15:352–357

    Google Scholar 

  • Mosheiov G (1991) \(V\)-shaped policies for scheduling deteriorating jobs. Oper Res 39:979–991

    Article  Google Scholar 

  • Mosheiov G (1996) \(\Lambda \)-shaped policies to schedule deteriorating jobs. J Oper Res Soc 47:1184–1191

    Article  Google Scholar 

  • Ng CT, Cheng CTE, Bachman A, Janiak A (2002) Three scheduling problems with deteriorating jobs to minimize the total completion time. Inf Process Lett 81:327–333

    Article  Google Scholar 

  • Ocetkiewicz KM (2009) A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem. Eur J Oper Res 203:316–320

    Google Scholar 

  • Shafransky YM (1978) On optimal sequencing for deterministic systems with a tree-like partial order. Vestsi Akad Navuk BSSR, Ser Fiz-Mat Navuk, vol 2, 120 (in Russian)

    Google Scholar 

  • Tanaev VS, Gordon VS, Shafransky YM (1984) Scheduling theory. Single-stage systems. Moscow, Nauka (in Russian); Kluwer, Dordrecht, 1994 (in English)

    Google Scholar 

  • Wang JB (2006) A note on scheduling problems with learning effects and deteriorating jobs. Int J Syst Sci 37:827–832

    Article  Google Scholar 

  • Yang SJ (2010) Single-machine scheduling problems with both start-time dependent learning and position dependent aging effects under deteriorating maintenance consideration. Appl Math Comput 217:3321–3329

    Article  Google Scholar 

  • Yang DL, Kuo WH (2009) Single-machine scheduling with both deterioration and learning effects. Ann Oper Res 172:315–327

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vitaly A. Strusevich .

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Strusevich, V.A., Rustogi, K. (2017). Scheduling with Pure and Combined Additive Start-Time-Dependent Effects. In: Scheduling with Time-Changing Effects and Rate-Modifying Activities. International Series in Operations Research & Management Science, vol 243. Springer, Cham. https://doi.org/10.1007/978-3-319-39574-6_8

Download citation

Publish with us

Policies and ethics