IDEAS home Printed from https://ideas.repec.org/a/spr/joinma/v28y2017i8d10.1007_s10845-015-1084-y.html
   My bibliography  Save this article

Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms

Author

Listed:
  • Hao-Chin Chang

    (National Kaohsiung First University of Science and Technology)

  • Tung-Kuan Liu

    (National Kaohsiung First University of Science and Technology)

Abstract

In contrast to traditional job-shop scheduling problems, various complex constraints must be considered in distributed manufacturing environments; therefore, developing a novel scheduling solution is necessary. This paper proposes a hybrid genetic algorithm (HGA) for solving the distributed and flexible job-shop scheduling problem (DFJSP). Compared with previous studies on HGAs, the HGA approach proposed in this study uses the Taguchi method to optimize the parameters of a genetic algorithm (GA). Furthermore, a novel encoding mechanism is proposed to solve invalid job assignments, where a GA is employed to solve complex flexible job-shop scheduling problems (FJSPs). In addition, various crossover and mutation operators are adopted for increasing the probability of finding the optimal solution and diversity of chromosomes and for refining a makespan solution. To evaluate the performance of the proposed approach, three classic DFJSP benchmarks and three virtual DFJSPs were adapted from classical FJSP benchmarks. The experimental results indicate that the proposed approach is considerably robust, outperforming previous algorithms after 50 runs.

Suggested Citation

  • Hao-Chin Chang & Tung-Kuan Liu, 2017. "Optimisation of distributed manufacturing flexible job shop scheduling by using hybrid genetic algorithms," Journal of Intelligent Manufacturing, Springer, vol. 28(8), pages 1973-1986, December.
    • Handle: RePEc:spr:joinma:v:28:y:2017:i:8:d:10.1007_s10845-015-1084-y
    DOI: 10.1007/s10845-015-1084-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10845-015-1084-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10845-015-1084-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Ho, Nhu Binh & Tay, Joc Cing & Lai, Edmund M.-K., 2007. "An effective architecture for learning and evolving flexible job-shop schedules," European Journal of Operational Research, Elsevier, vol. 179(2), pages 316-333, June.
    2. De Giovanni, L. & Pezzella, F., 2010. "An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problem," European Journal of Operational Research, Elsevier, vol. 200(2), pages 395-408, January.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Lilan Liu & Kai Guo & Zenggui Gao & Jiaying Li & Jiachen Sun, 2022. "Digital Twin-Driven Adaptive Scheduling for Flexible Job Shops," Sustainability, MDPI, vol. 14(9), pages 1-17, April.
    2. Konstantinos S. Boulas & Georgios D. Dounias & Chrissoleon T. Papadopoulos, 2023. "A hybrid evolutionary algorithm approach for estimating the throughput of short reliable approximately balanced production lines," Journal of Intelligent Manufacturing, Springer, vol. 34(2), pages 823-852, February.
    3. Wenxiang Xu & Shunsheng Guo, 2019. "A Multi-Objective and Multi-Dimensional Optimization Scheduling Method Using a Hybrid Evolutionary Algorithms with a Sectional Encoding Mode," Sustainability, MDPI, vol. 11(5), pages 1-24, March.
    4. Guiliang Gong & Raymond Chiong & Qianwang Deng & Qiang Luo, 2020. "A memetic algorithm for multi-objective distributed production scheduling: minimizing the makespan and total energy consumption," Journal of Intelligent Manufacturing, Springer, vol. 31(6), pages 1443-1466, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Sicheng & Li, Xiang & Zhang, Bowen & Wang, Shouyang, 2020. "Multi-objective optimisation in flexible assembly job shop scheduling using a distributed ant colony system," European Journal of Operational Research, Elsevier, vol. 283(2), pages 441-460.
    2. Li Zhou & Zhuoning Chen & Shaoping Chen, 2018. "An effective detailed operation scheduling in MES based on hybrid genetic algorithm," Journal of Intelligent Manufacturing, Springer, vol. 29(1), pages 135-153, January.
    3. Li, Xinyu & Gao, Liang, 2016. "An effective hybrid genetic algorithm and tabu search for flexible job shop scheduling problem," International Journal of Production Economics, Elsevier, vol. 174(C), pages 93-110.
    4. Seyed Habib A. Rahmati & Abbas Ahmadi & Kannan Govindan, 2018. "A novel integrated condition-based maintenance and stochastic flexible job shop scheduling problem: simulation-based optimization approach," Annals of Operations Research, Springer, vol. 269(1), pages 583-621, October.
    5. Sels, Veronique & Craeymeersch, Kjeld & Vanhoucke, Mario, 2011. "A hybrid single and dual population search procedure for the job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 215(3), pages 512-523, December.
    6. Mohammad Ali Beheshtinia & Parisa Feizollahy & Masood Fathi, 2021. "Supply Chain Optimization Considering Sustainability Aspects," Sustainability, MDPI, vol. 13(21), pages 1-23, October.
    7. Shoujing Zhang & Tiantian Hou & Qing Qu & Adam Glowacz & Samar M. Alqhtani & Muhammad Irfan & Grzegorz Królczyk & Zhixiong Li, 2022. "An Improved Mayfly Method to Solve Distributed Flexible Job Shop Scheduling Problem under Dual Resource Constraints," Sustainability, MDPI, vol. 14(19), pages 1-19, September.
    8. Arash Amirteimoori & Reza Kia, 2023. "Concurrent scheduling of jobs and AGVs in a flexible job shop system: a parallel hybrid PSO-GA meta-heuristic," Flexible Services and Manufacturing Journal, Springer, vol. 35(3), pages 727-753, September.
    9. Nicolás Álvarez-Gil & Rafael Rosillo & David de la Fuente & Raúl Pino, 2021. "A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 29(4), pages 1353-1374, December.
    10. García-Villoria, Alberto & Salhi, Said & Corominas, Albert & Pastor, Rafael, 2011. "Hyper-heuristic approaches for the response time variability problem," European Journal of Operational Research, Elsevier, vol. 211(1), pages 160-169, May.
    11. Shijin Wang & Ming Liu, 2016. "Two-machine flow shop scheduling integrated with preventive maintenance planning," International Journal of Systems Science, Taylor & Francis Journals, vol. 47(3), pages 672-690, February.
    12. J. Behnamian & S. M. T. Fatemi Ghomi, 2016. "A survey of multi-factory scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(1), pages 231-249, February.
    13. Yiyi Xu & M’hammed Sahnoun & Fouad Ben Abdelaziz & David Baudry, 2022. "A simulated multi-objective model for flexible job shop transportation scheduling," Annals of Operations Research, Springer, vol. 311(2), pages 899-920, April.
    14. Xiong, Fuli & Xing, Keyi & Wang, Feng, 2015. "Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time," European Journal of Operational Research, Elsevier, vol. 240(2), pages 338-354.
    15. Wang, Sheng-yao & Wang, Ling & Liu, Min & Xu, Ye, 2013. "An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem," International Journal of Production Economics, Elsevier, vol. 145(1), pages 387-396.
    16. Vilcot, Geoffrey & Billaut, Jean-Charles, 2008. "A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 190(2), pages 398-411, October.
    17. González, Miguel A. & Vela, Camino R. & Varela, Ramiro, 2015. "Scatter search with path relinking for the flexible job shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 245(1), pages 35-45.
    18. Sweeney, Kevin D. & Sweeney, Donald C. & Campbell, James F., 2019. "The performance of priority dispatching rules in a complex job shop: A study on the Upper Mississippi River," International Journal of Production Economics, Elsevier, vol. 216(C), pages 154-172.
    19. Abderraouf Maoudj & Brahim Bouzouia & Abdelfetah Hentout & Ahmed Kouider & Redouane Toumi, 2019. "Distributed multi-agent scheduling and control system for robotic flexible assembly cells," Journal of Intelligent Manufacturing, Springer, vol. 30(4), pages 1629-1644, April.
    20. Miguel S. E. Martins & Joaquim L. Viegas & Tiago Coito & Bernardo Firme & Andrea Costigliola & João Figueiredo & Susana M. Vieira & João M. C. Sousa, 2023. "Minimizing total completion time in large-sized pharmaceutical quality control scheduling," Journal of Heuristics, Springer, vol. 29(1), pages 177-206, February.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joinma:v:28:y:2017:i:8:d:10.1007_s10845-015-1084-y. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.