Abstract
In this paper we approach the problem of set-up scheduling in a parallel machine environment with size dependent setup time, release time and minimizing the makespan (Cmax). The jobs’ process times, set-up times and release times are stochastic for better depiction of the real world. The problem is NP-hard. Therefore, in this paper we will compare different heuristics with a special simulation approach then we will analyze the obtained results.
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
Banks J, Carson J, Nelson BL, Nicol D (2004) Discrete-event system simulation, 4th edn. Prentice Hall
Chandru V, Lee C, Uzsoy R (1993) Minimizing total completion time on batch processing machine. Int J Prod Res 31:2097–2121
Chang P, Damodaran P, Melouk S (2004) Minimizing makespan on parallel batch processing machines. Int J Prod Res 42:4211–4220
Cheng B, Yang S, Hu X, Chen B (2011) Minimizing makespan and total completion time for parallel batch processing machines with non-identical job sizes. Appl Math Model 1:1010–1016
Damodaran P, Velez-Gallego MC (2010) Heuristics for makespan minimization on parallel batch processing machines with unequal job ready times. Int J Adv Manuf Technol 49:1119–1128
Graham R, Lawler E, Lenstra J, Rinnooy Kan A (1979) Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann Discret Mathem 5:287–326
Kashan A, Karimi B, Jenabi M (2008) A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. Comput Oper Res 35:1084–1098
Kelton D, Sadowski R, Sturrock D (2004) Simulation with arena, 3rd edn. McGraw-Hill, New York
Pidd M (2004) Computer simulation in management science, 5th edn. Wiley
Stewart R (2004) Simulation: the practice of model development and use. Wiley
Weng M, Lu J, Ren H (2001) Unrelated parallel machine scheduling with setup consideration and a total weighted completion time objective. Int J Prod Econ 70(3):215–226
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag London
About this paper
Cite this paper
Sahraeian, R., Samaei, F., Rastgar, I. (2014). Minimizing the Makespan on Parallel Batch Scheduling with Stochastic Times. In: Prado-Prado, J., García-Arca, J. (eds) Annals of Industrial Engineering 2012. Springer, London. https://doi.org/10.1007/978-1-4471-5349-8_25
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5349-8_25
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5348-1
Online ISBN: 978-1-4471-5349-8
eBook Packages: EngineeringEngineering (R0)