Abstract
This chapter discusses the capability and effectiveness of a Meta-heuristic for Randomized Priority Search to solve multi-objective problems. The multi-objective problem of unrelated parallel machine scheduling is considered in the chapter. The two objectives to minimize are total weighted tardiness and total weighted completion time. An existing construction rule in the literature named Apparent Tardiness Cost-bi heuristic is used as the basis for the meta-heuristic construction phase to generate non-dominated solutions. The computational results obtained are promising when results of the meta-heuristic approach proposed are compared with those of the original construction rule. This chapter illustrates that the meta-heuristic approach proposed is effective and flexible enough to generate Pareto-frontiers in order to solve multi-objective scheduling problems by modifying a simple existing heuristic found in the literature.
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
Similar content being viewed by others
Notes
- 1.
Data sets and its solutions are available at www.SchedulingResearch.com.
References
Arcus A (1966) A computer method of sequencing operations for assembly lines. Int J Prod Res 4:259–277
DePuy GW, Moraga RJ, Whitehouse GE (2005) Meta-RaPS: a simple and effective approach for solving the traveling salesman problem. Transp Res Part E Logistics Transp Rev 41(2):115–130
Eren T (2009) A bicriteria parallel machine scheduling with a learning effect. Appl Math Model 33:1141–1150
Garcia C, Rabadi G (2011) A Meta-RaPS algorithm for spatial scheduling with release times. Int J Planning Scheduling 1(1/2):19–31
Guo J (2013) A meta-heuristic algorithm to generate Pareto frontiers for a simulation-based flexible flow shop scheduling problem. Master Thesis, Northern Illinois University. Retrieved from ProQuest Database. (Publication No. 1552367)
Hepdogan S, Moraga R, DePuy GW, Whitehouse GE (2009) A Meta-RaPS for the early/tardy single machine scheduling problem. Int J Prod Res 47(7):1717–1732
Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum Press, New York, pp 85–103
Kayvanfar V, Aalaei A, Hosseininia M, Rajabi M (2014a) Unrelated parallel machine scheduling problem with sequence dependent setup times. In: International conference on industrial engineering and operations management, Bali, pp 7–9
Kayvanfar V, Komaki GM, Aalaei A, Zandieh M (2014b) Minimizing total tardiness and earliness on unrelated parallel machines with controllable processing times. Comput Oper Res 41:31–43
Lei D (2009) Multi-objective production scheduling: a survey. Int J Adv Manuf Technol 43(9–10):926–938
Lin YK, Fowler JW, Pfund ME (2013) Multiple-objective heuristics for scheduling unrelated parallel machines. Eur J Oper Res 227(2):239–253
Moghaddam RT, Taheri F, Bazzazi M, Izadi M, Sassani F (2009) Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints. Comput Oper Res 36(12):3224–3230
Nogueira JC, Arroyo JC, Villadiego HM, Goncalves LB (2014) Hybrid GRASP heuristics to solve an unrelated parallel machine scheduling problem with earliness and tardiness penalties. Theor Comput Sci 302:53–72
Rabadi G, Moraga RJ, Salem AA (2006) Heuristics for the unrelated parallel machine scheduling problem with setup times. J Intell Manuf 17(1):85–97
Torabi S, Sahebjamnia N, Mansouri S, Bajestani MA (2013) A particle swarm optimization for a fuzzy multi-objective unrelated parallel machines scheduling problem. Appl Soft Comput 13(12):4750–4762
Wang X (2007) Adaptation of the Meta-RaPS meta-heuristic to a multi-objective environment. Master’s thesis, Retrieved from WorldCat Database. (OCLC No. 429700897)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Dcoutho, N., Moraga, R. (2016). Meta-RaPS for a Bi-objective Unrelated Parallel Machine Scheduling Problem. In: Rabadi, G. (eds) Heuristics, Metaheuristics and Approximate Methods in Planning and Scheduling. International Series in Operations Research & Management Science, vol 236. Springer, Cham. https://doi.org/10.1007/978-3-319-26024-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-26024-2_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-26022-8
Online ISBN: 978-3-319-26024-2
eBook Packages: Business and ManagementBusiness and Management (R0)