Abstract
In this chapter, we consider scheduling problems on parallel machines, provided that actual processing times of the jobs are subject to various effects.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Biskup D (2008) A state-of-the-art review on scheduling with learning effects. Eur J Oper Res 188:315–329
Chen Z-L (1996) Parallel machine scheduling with time dependent processing times. Discret Appl Math 70:81–93
Chen Z-L (1997) Erratum: Parallel machine scheduling with time dependent processing times. Discret Appl Math 75:103
Gara-Ali A, Finke G, Espinouse ML (2016) Parallel-machine scheduling with maintenance: praising the assignment problem. Eur J Oper Res 252:90–97
Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco
Johnson DS (1981) The NP-completeness column: an ongoing guide. J Algorithm 2:393–405
Kang L, Ng CT (2007) A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs. Int J Prod Econ 109:180–184
Kononov A (1997) Scheduling problems with linear increasing processing times. In: Zimmermann U et al (eds) Operations Research Proceedings. Springer, Berlin, pp 199–206
Kovalyov MY, Kubiak W (1998) A fully polynomial approximation scheme for minimizing makespan of deteriorating jobs. J Heur 3:287–297
Kovalyov MY, Kubiak W (2012) A generic FPTAS for partition type optimization problems. Int J Plan Sched 1:209–233
Kuo W-H, Yang D-L (2008) Parallel-machine scheduling with time dependent processing times. Theor Comput Sci 393:204–210
Mosheiov G (2001) Parallel machine scheduling with a learning effect. J Oper Res Soc 52:1165–1169
Mosheiov G, Sidney JB (2003) Scheduling with general job-dependent learning curves. Eur J Oper Res 147:665–670
Ng CT, Barketau MS, Cheng TCE, Kovalyov MY (2010) “Product Partition” and related problems of scheduling and systems reliability: computational complexity and approximation. Eur J Oper Res 207:601–604
Rustogi K, Strusevich VA (2012) Simple matching vs linear assignment in scheduling models with positional effects: A critical review. Eur J Oper Res 222:393–407
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Strusevich, V.A., Rustogi, K. (2017). Scheduling on Parallel Machines with Various 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-319-39574-6_11
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39572-2
Online ISBN: 978-3-319-39574-6
eBook Packages: Business and ManagementBusiness and Management (R0)