Abstract
This paper studies a simultaneous scheduling of production and material transfer in a flexible job shop environment. The simultaneous scheduling approach has been recently adopted by a robotic mobile fulfillment system, wherein transbots pick up jobs and deliver to pick-stations for processing, which requires a simultaneous scheduling of jobs, transbots, and stations. Two different constraint programming formulations are proposed for the first time for a flexible job shop scheduling problem with transbots, significantly outperforming all other benchmark approaches in the literature and proving optimality of the well-known benchmark instances.
Similar content being viewed by others
References
Adams, J., Balas, E., & Zawack, D. (1988). The shifting bottleneck procedure for job shop scheduling. Management Science, 34(3), 391–401.
Alibaba. (2017). Inside Alibaba’s smart warehouse staffed by robots [Video file]. Retrieved from https://www.youtube.com/watch?v=FBl4Y55V2Z4.
Amazon. (2014). Meet the robots making Amazon even faster [Video file]. Retrieved from https://www.youtube.com/watch?v=UtBa9yVZBJM.
Baruwa, O. T., & Piera, M. A. (2016). A coloured Petri net-based hybrid heuristic search approach to simultaneous scheduling of machines and automated guided vehicles. International Journal of Production Research, 54(16), 4773–4792.
Berkshire Grey. (2019). AI and Robotics based omni-channel fulfillment company. https://www.berkshiregrey.com/.
Bilge, Ü., & Ulusoy, G. (1995). A time window approach to simultaneous scheduling of machines and material handling system in an FMS. Operations Research, 43(6), 1058–1070.
Boden, M. A. (2016). AI: Its nature and future (1st ed.). Oxford: Oxford University Press.
CHIP. (2019). http://www.cosytec.com/.
CHOCO. (2019). http://www.choco-solver.org/.
Deroussi, L. (2014). A hybrid PSO applied to the flexible job shop with transport. In International conference on swarm intelligence based optimization (pp. 115–122). Cham: Springer.
Deroussi, L., & Norre, S. (2010). Simultaneous scheduling of machines and vehicles for the flexible job shop problem. In International conference on metaheuristics and nature inspired computing (pp. 1–2).
Fisher, H., & Thompson, G. L. (1963). Probabilistic learning combinations of local job-shop scheduling rules (pp. 225–251). Englewood Cliffs: Prentice-Hall.
GECODE. (2019). http://www.gecode.org/.
Gerkey, B. P., & Matarić, M. J. (2004). A formal analysis and taxonomy of task allocation in multi-robot systems. The International Journal of Robotics Research, 23(9), 939–954.
Ham, A. (2017). Scheduling of dual resource constrained lithography production: Using CP and MIP/CP. IEEE Transactions on Semiconductor Manufacturing, 31(1), 52–61.
Ham, A. (2018). Integrated scheduling of m-truck, m-drone, and m-depot constrained by time-window, drop-pickup, and m-visit using constraint programming. Transportation Research Part C: Emerging Technologies, 91, 1–14.
Ham, A. (2020). Transfer-robot task scheduling in job shop. International Journal of Production Research. https://doi.org/10.1080/00207543.2019.1709671.
Ham, A., & Cakici, E. (2016). Flexible job shop scheduling problem with parallel batch processing machines: MIP and CP approaches. Computers & Industrial Engineering, 102, 160–165.
Homayouni, S. M., & Fontes, D. B. (2019). Joint scheduling of production and transport with alternative job routing in flexible manufacturing systems. In AIP Conference Proceedings (Vol. 2070, No. 1, p. 020045). AIP Publishing.
Hurink, J., Jurisch, B., & Thole, M. (1994). Tabu search for the job-shop scheduling problem with multi-purpose machines. Operations-Research-Spektrum, 15(4), 205–215.
Kapanoglu, M., Alikalfa, M., Ozkan, M., & Parlaktuna, O. (2012). A pattern-based genetic algorithm for multi-robot coverage path planning minimizing completion time. Journal of Intelligent Manufacturing, 23(4), 1035–1045.
Karimi, S., Ardalan, Z., Naderi, B., & Mohammadi, M. (2017). Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm. Applied Mathematical Modellíng, 41, 667–682.
Korsah, G. A., Stentz, A., & Dias, M. B. (2013). A comprehensive taxonomy for multi-robot task allocation. The International Journal of Robotics Research, 32(12), 1495–1512.
Kumar, M. S., Janardhana, R., & Rao, C. S. P. (2011). Simultaneous scheduling of machines and vehicles in an FMS environment with alternative routing. The International Journal of Advanced Manufacturing Technology, 53(1–4), 339–351.
Kusiak, A. (2019). Fundamentals of smart manufacturing: a multi-thread perspective. Annual Reviews in Control.
Laborie, P., Rogerie, J., Shaw, P., & Vilím, P. (2018). IBM ILOG CP optimizer for scheduling. Constraints, 23(2), 210–250.
Lamballais, T., Roy, D., & De Koster, M. B. M. (2017). Estimating performance in a robotic mobile fulfillment system. European Journal of Operational Research, 256(3), 976–990.
Nouri, H., Driss, O. B., & Ghédira, K. (2016). Simultaneous scheduling of machines and transport robots in flexible job shop environment using hybrid metaheuristics based on clustered holonic multiagent model. Computers & Industrial Engineering, 102, 488–501.
Nunes, E., Manner, M., Mitiche, H., & Gini, M. (2017). A taxonomy for task allocation problems with temporal and ordering constraints. Robotics and Autonomous Systems, 90, 55–70.
Ocado. (2018). Inside a warehouse where thousands of robots pack groceries [Video file]. Retrieved from https://www.youtube.com/watch?v=4DKrcpa8Z_E.
Raileanu, S., Anton, F., Iatan, A., Borangiu, T., Anton, S., & Morariu, O. (2017). Resource scheduling based on energy consumption for sustainable manufacturing. Journal of Intelligent Manufacturing, 28(7), 1519–1530.
Wang, C. N., & Chen, L. C. (2012). The heuristic preemptive dispatching method of material transportation system in 300 mm semiconductor fabrication. Journal of Intelligent Manufacturing, 23(5), 2047–2056.
Zhang, Q., Manier, H., & Manier, M. A. (2012). A genetic algorithm with tabu search procedure for flexible job shop scheduling with transportation constraints and bounded processing times. Computers & Operations Research, 39(7), 1713–1723.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Ham, A. Transfer-robot task scheduling in flexible job shop. J Intell Manuf 31, 1783–1793 (2020). https://doi.org/10.1007/s10845-020-01537-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10845-020-01537-6