Abstract
We present a novel genetic algorithm for the Robotic Cell Problem with controllable processing times. This challenging problem arises in an automated production cell that consists of m consecutive machines as well as a material handling robot. The problem requires finding the operations processing times, job assignment, and robot movements. The objective is to minimize the makespan subject to a budget constraint. We describe a free-slack-based genetic algorithm for the linear resource consumption case. We present the results of a computational study and we provide evidence that the proposed algorithm consistently outperforms MIP-based heuristics from the literature.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Akturk MS, Ilhan T (2011) Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness. Comput Oper Res 38(4):771–781
Al-Salem M, Kharbeche M, Khallouli W, Haouari M (2015) Mip-based heuristics for the robotic cell problem with controllable processing times. Technical Report, CENG/MIE, Qatar University
Biskup D, Cheng TCE (1999) Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties. Eng Optim 31(3):329–336
Carlier J, Haouari M, Kharbeche M, Aziz M (2010) An optimization-based heuristic for the robotic cell problem. Eur J Oper Res 202(3):636–645
Dawande MW, Geismar HN, Sethi SP, Chelliah S (2007) Throughput optimization in robotic cells, vol 101. Springer, New York
Janiak A (1991) Single machine scheduling problem with a common deadline and resource dependent release dates. Eur J Oper Res 53(3):317–325
Kharbeche M, Carlier J, Haouari M, Aziz M (2011) Exact methods for the robotic cell problem. Flex Serv Manuf J 23(2):242–261
Koulamas C, Gupta S, Kyparisis GJ (2010) A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times. Eur J Oper Res 205(2):479–482
Shabtay D, Steiner G (2007) A survey of scheduling with controllable processing times. Discret Appl Math 155(13):1643–1666
Wang J-B, Xia Z-Q (2007) Single machine scheduling problems with controllable processing times and total absolute differences penalties. Eur J Oper Res 177(1):638–645
Xu K, Feng Z, Keliang J (2010) A tabu-search algorithm for scheduling jobs with controllable processing times on a single machine to meet due-dates. Comput Oper Res 37(11):1924–1938
Zdrzałka S (1991) Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis. Oper Res Lett 10(9):519–523
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
Al-Salem, M., Haouari, M., Kharbeche, M., Khallouli, W. (2016). A Free-Slack-Based Genetic Algorithm for the Robotic Cell Problem with Controllable Processing Times. 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_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-26024-2_4
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)