IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v43y2022i1d10.1007_s10878-021-00748-8.html
   My bibliography  Save this article

A simple two-agent system for multi-objective flexible job-shop scheduling

Author

Listed:
  • Yingli Li

    (Tongji University)

  • Jiahai Wang

    (Tongji University)

  • Zhengwei Liu

    (Tongji University)

Abstract

In this paper, a simple two-agent multi-objective scheduling system for flexible job-shop scheduling problem is proposed and corresponding framework is given. Under the framework, a broadcast communication mechanism with task mark and leader–follower control mode are designed and used to ensure orderly activities among agents. To obtain initial solution and improve it, competition and cooperation strategies are developed. To jump out of the local optimal solution and expend the search space, an adaptive iterative loop solving mechanism is designed. Three commonly used benchmark instance sets are adopted to test the performance of the proposed method. Computation results and comparison analysis with other excellent algorithms demonstrate that it is feasible and effective.

Suggested Citation

  • Yingli Li & Jiahai Wang & Zhengwei Liu, 2022. "A simple two-agent system for multi-objective flexible job-shop scheduling," Journal of Combinatorial Optimization, Springer, vol. 43(1), pages 42-64, January.
    • Handle: RePEc:spr:jcomop:v:43:y:2022:i:1:d:10.1007_s10878-021-00748-8
    DOI: 10.1007/s10878-021-00748-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-021-00748-8
    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/s10878-021-00748-8?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. Wei Xiong & Dongmei Fu, 2018. "A new immune multi-agent system for the flexible job shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 29(4), pages 857-873, April.
    2. Manzhan Gu & Jinwei Gu & Xiwen Lu, 2018. "An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines," Journal of Scheduling, Springer, vol. 21(5), pages 483-492, October.
    3. Xiuli Wu & Shaomin Wu, 2017. "An elitist quantum-inspired evolutionary algorithm for the flexible job-shop scheduling problem," Journal of Intelligent Manufacturing, Springer, vol. 28(6), pages 1441-1457, August.
    4. Chong Peng & Guanglin Wu & T Warren Liao & Hedong Wang, 2019. "Research on multi-agent genetic algorithm based on tabu search for the job shop scheduling problem," PLOS ONE, Public Library of Science, vol. 14(9), pages 1-19, September.
    5. Muhammad Kamal Amjad & Shahid Ikramullah Butt & Rubeena Kousar & Riaz Ahmad & Mujtaba Hassan Agha & Zhang Faping & Naveed Anjum & Umer Asgher, 2018. "Recent Research Trends in Genetic Algorithm Based Flexible Job Shop Scheduling Problems," Mathematical Problems in Engineering, Hindawi, vol. 2018, pages 1-32, February.
    Full references (including those not matched with items on IDEAS)

    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. Fei Luan & Zongyan Cai & Shuqiang Wu & Shi Qiang Liu & Yixin He, 2019. "Optimizing the Low-Carbon Flexible Job Shop Scheduling Problem with Discrete Whale Optimization Algorithm," Mathematics, MDPI, vol. 7(8), pages 1-17, August.
    2. Shun Jia & Yang Yang & Shuyu Li & Shang Wang & Anbang Li & Wei Cai & Yang Liu & Jian Hao & Luoke Hu, 2024. "The Green Flexible Job-Shop Scheduling Problem Considering Cost, Carbon Emissions, and Customer Satisfaction under Time-of-Use Electricity Pricing," Sustainability, MDPI, vol. 16(6), pages 1-22, March.
    3. Li-Han Zhang & Dan-Yang Lv & Ji-Bo Wang, 2023. "Two-Agent Slack Due-Date Assignment Scheduling with Resource Allocations and Deteriorating Jobs," Mathematics, MDPI, vol. 11(12), pages 1-12, June.
    4. Jun Pei & Jinling Wei & Baoyu Liao & Xinbao Liu & Panos M. Pardalos, 2020. "Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent," Annals of Operations Research, Springer, vol. 294(1), pages 191-223, November.
    5. Xuan Jing & Xifan Yao & Min Liu & Jiajun Zhou, 2024. "Multi-agent reinforcement learning based on graph convolutional network for flexible job shop scheduling," Journal of Intelligent Manufacturing, Springer, vol. 35(1), pages 75-93, January.
    6. Gregory A. Kasapidis & Dimitris C. Paraskevopoulos & Panagiotis P. Repoussis & Christos D. Tarantilis, 2021. "Flexible Job Shop Scheduling Problems with Arbitrary Precedence Graphs," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4044-4068, November.
    7. Didden, Jeroen B.H.C. & Dang, Quang-Vinh & Adan, Ivo J.B.F., 2024. "Enhancing stability and robustness in online machine shop scheduling: A multi-agent system and negotiation-based approach for handling machine downtime in industry 4.0," European Journal of Operational Research, Elsevier, vol. 316(2), pages 569-583.
    8. Jesús Isaac Vázquez-Serrano & Leopoldo Eduardo Cárdenas-Barrón & Rodrigo E. Peimbert-García, 2021. "Agent Scheduling in Unrelated Parallel Machines with Sequence- and Agent–Machine–Dependent Setup Time Problem," Mathematics, MDPI, vol. 9(22), pages 1-34, November.
    9. Xiuli Wu & Xianli Shen & Qi Cui, 2018. "Multi-Objective Flexible Flow Shop Scheduling Problem Considering Variable Processing Time due to Renewable Energy," Sustainability, MDPI, vol. 10(3), pages 1-30, March.
    10. Xiuli Wu & Junjian Peng & Xiao Xiao & Shaomin Wu, 2021. "An effective approach for the dual-resource flexible job shop scheduling problem considering loading and unloading," Journal of Intelligent Manufacturing, Springer, vol. 32(3), pages 707-728, March.
    11. Tifenn Rault & Faiza Sadi & Jean-Charles Billaut & Ameur Soukhal, 2024. "Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization," Journal of Scheduling, Springer, vol. 27(5), pages 485-505, October.
    12. Mohd. Shaaban Hussain & Mohammed Ali, 2019. "A Multi-agent Based Dynamic Scheduling of Flexible Manufacturing Systems," Global Journal of Flexible Systems Management, Springer;Global Institute of Flexible Systems Management, vol. 20(3), pages 267-290, September.
    13. Tsegay Tesfay Mezgebe & Hind Bril El Haouzi & Guillaume Demesure & Remi Pannequin & Andre Thomas, 2020. "Multi-agent systems negotiation to deal with dynamic scheduling in disturbed industrial context," Journal of Intelligent Manufacturing, Springer, vol. 31(6), pages 1367-1382, August.
    14. Anran Zhao & Peng Liu & Xiyu Gao & Guotai Huang & Xiuguang Yang & Yuan Ma & Zheyu Xie & Yunfeng Li, 2022. "Data-Mining-Based Real-Time Optimization of the Job Shop Scheduling Problem," Mathematics, MDPI, vol. 10(23), pages 1-30, December.
    15. Ming Jiang & Haihan Yu & Jiaqing Chen, 2023. "Improved Self-Learning Genetic Algorithm for Solving Flexible Job Shop Scheduling," Mathematics, MDPI, vol. 11(22), pages 1-17, November.
    16. Seyed Mahdi Homayouni & Dalila B. M. M. Fontes, 2021. "Production and transport scheduling in flexible job shop manufacturing systems," Journal of Global Optimization, Springer, vol. 79(2), pages 463-502, February.
    17. Olumide Emmanuel Oluyisola & Swapnil Bhalla & Fabio Sgarbossa & Jan Ola Strandhagen, 2022. "Designing and developing smart production planning and control systems in the industry 4.0 era: a methodology and case study," Journal of Intelligent Manufacturing, Springer, vol. 33(1), pages 311-332, January.
    18. Tamssaouet, Karim & Dauzère-Pérès, Stéphane & Knopp, Sebastian & Bitar, Abdoul & Yugma, Claude, 2022. "Multiobjective optimization for complex flexible job-shop scheduling problems," European Journal of Operational Research, Elsevier, vol. 296(1), pages 87-100.
    19. Neumann, Anas & Hajji, Adnene & Rekik, Monia & Pellerin, Robert, 2024. "Integrated planning and scheduling of engineer-to-order projects using a Lamarckian Layered Genetic Algorithm," International Journal of Production Economics, Elsevier, vol. 267(C).
    20. Du, Mengyu & Li, Yan-Fu, 2020. "An investigation of new local search strategies in memetic algorithm for redundancy allocation in multi-state series-parallel systems," Reliability Engineering and System Safety, Elsevier, vol. 195(C).

    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:jcomop:v:43:y:2022:i:1:d:10.1007_s10878-021-00748-8. 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.