skip to main content
10.1145/3325730.3325741acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicmaiConference Proceedingsconference-collections
research-article

A Metaheuristic to Solve a Robotic Cell Job-shop Scheduling Problem with Time Window Constraints

Published: 12 April 2019 Publication History

Abstract

This paper deals with a robotic cell job-shop scheduling problem with time window constraints. In this scene, jobs are processed successively on a set of machines. Specially, the loading/unloading of jobs between the machines is transported by robots. The aim is to minimize the total weighted earliness and tardiness. A novel metaheuristic is proposed to solve this problem. The proposed method combines a memetic algorithm and a powerful local search (variable neighborhood descent). The experiment results show that the proposed algorithm achieved better solution quality in comparison of other algorithms.

References

[1]
Dawande, M., Geismar, H, Sethi, S and Sriskandarajah C. 2007. Throughput Optimization in Robotic Cells. Springer US.
[2]
Sethi, S., Sriskandarajah, C, Sorger, G, Blazewicz, J and Kubiak, W. 1992. Sequencing of parts and robot moves in a robotic cell. International Journal. Flexible Manufacture. 4 (Nov. 1992), 331--358.
[3]
Fazlollahtabar., H, Mohammad, S. 2015. Mathematical optimization for earliness/tardiness minimization in a multiple automated guided vehicle manufacturing system via integrated heuristic algorithms. Robotics and Autonomous Systems. 72 (Oct. 2015), 131--138.
[4]
Gultekin, H., Coban, B and Akhlaghi, V. 2016. Cyclic scheduling of parts and robot moves in m-machine robotic cells. Computers & Operations Research. 90 (Feb. 2018), 161--172.
[5]
Elmi, A., Topaloglu, S. 2016. Multi-degree cyclic flow shop robotic cell scheduling problem: Ant colony optimization. Computers & Operations Research. 73 (Sept. 2016), 67--83.
[6]
Didem., G, Batur, Erol, S and Karasan, O. 2016. Robot move sequence determining and multiple part-type scheduling in hybrid flexible flow shop robotic cells. Computers & Industrial Engineering. 100 (Oct. 2016), 72--87.
[7]
Shabtay, D., Arviv, K, 2015. Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times. Applied Mathematical Modelling. 40 (Mar. 2016), 4231--4247.
[8]
Inna, G., Drobouchevitch, H, Neil, G and Chelliah, S. 2010. Throughput optimization in robotic cells with input and output machine buffers: A comparative study of two key models. European Journal of Operational Research. 206 (Nov. 2010), 623--633.
[9]
Yan, P.Y., Che, A. D, Cai, X. Q and Tang, X.W. 2014.Two-phase branch and bound algorithm for robotic cells rescheduling considering limited disturbance. Computers & Operations Research. 50 (Oct. 2014), 128--140.
[10]
Zhou, Z., Che, A. D and Yan, P. Y. A mixed integer programming approach for multi-cyclic robotic flowshop scheduling with time window constraints. Applied Mathematical Modelling, 36(Aug. 2012), 3621--3629.
[11]
Che, A. D., Chabrol, M, Gourgand, M and Wang, Y. 2012.Scheduling multiple robots in a no-wait re-entrant robotic flowshop. International Journal of Production Economics. 135 (Jan. 2012), 199--208.
[12]
Caumond, A., Lacomme, P, Moukrim, A and Tchernev, N. 2008. An MILP for scheduling problems in an FMS with one vehicle. European Journal of Operational Research. 199 (Mar. 2009), 706--722.
[13]
Tavakkoli-Moghaddam, R., Azarkish, M and Sadeghnejad-Barkousaraie, A. 2011. A new hybrid multi-objective Pareto archive PSO algorithm for a bi-objective job shop scheduling problem. Expert Systems with Applications. 38 (Feb. 2011), 10812--10821.
[14]
Chiang, T. C, Lin, H. J. 2013. Flexible Job Shop Scheduling Using a Multiobjective Memetic Algorithm. Advanced Intelligent Computing Theories and Applications. 6839 (Aug. 2013), 49--56.
[15]
Pan, Q. K, Fatih, M, Tasgetiren and Liang, Y.C. 2008. A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Computers & Operations Research. 269 (Sept 2008), 2807--2839.

Index Terms

  1. A Metaheuristic to Solve a Robotic Cell Job-shop Scheduling Problem with Time Window Constraints

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Other conferences
    ICMAI '19: Proceedings of the 2019 4th International Conference on Mathematics and Artificial Intelligence
    April 2019
    232 pages
    ISBN:9781450362580
    DOI:10.1145/3325730
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    In-Cooperation

    • Southwest Jiaotong University
    • Xihua University: Xihua University

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 12 April 2019

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Job-shop
    2. Memetic algorithm
    3. Robotic Cell
    4. Time window constraints
    5. Variable Neighborhood Descent

    Qualifiers

    • Research-article
    • Research
    • Refereed limited

    Conference

    ICMAI 2019

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • 0
      Total Citations
    • 80
      Total Downloads
    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 08 Mar 2025

    Other Metrics

    Citations

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media