A simulated multi-objective model for flexible job shop transportation scheduling

Yiyi Xu (), M’hammed Sahnoun (), Fouad Ben Abdelaziz () and David Baudry ()
Additional contact information
Yiyi Xu: CESI-LINEACT laboratory
M’hammed Sahnoun: CESI-LINEACT laboratory
Fouad Ben Abdelaziz: Neoma Business School
David Baudry: CESI-LINEACT laboratory

Annals of Operations Research, 2022, vol. 311, issue 2, No 14, 899-920

Abstract: Abstract This paper proposes a new dynamic algorithm based on simulation approach and multi-objective optimization to solve the FJSP with transportation assignment. The objectives considered in scheduling jobs and transportation tasks in a flexible job shop manufacturing system include makespan, robot travel distance, time difference with due date and critical waiting time. The results obtained from the computational experiments have shown that the proposed approach is efficient and competitive.

Keywords: Flexible job shop scheduling; Multi-objective programming; Simulation; Multi-agent systems; Transportation (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-020-03600-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:311:y:2022:i:2:d:10.1007_s10479-020-03600-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-020-03600-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().