JZUS - Journal of Zhejiang University SCIENCE

Frontiers of Information Technology & Electronic Engineering

Accepted manuscript available online (unedited version)

A review of the flexible job shop scheduling problems considering transportation vehicles

Author(s): Bin XIN, Sai LU, Qing WANG, Fang DENG
Affiliation(s): School of Automation, Beijing Institute of Technology, Beijing 100081, China; more
Corresponding email(s): brucebin@bit.edu.cn, bit_lusai@163.com, wangqing1020@bit.edu.cn, dengfang@bit.edu.cn
Key Words: Flexible manufacturing system; Transportation vehicle; Processing machine; Integrated scheduling; Review

Share this article to： More <<< Previous Paper \|Next Paper >>>

Bin XIN, Sai LU, Qing WANG, Fang DENG. A review of the flexible job shop scheduling problems considering transportation vehicles[J]. Frontiers of Information Technology & Electronic Engineering,in press.https://doi.org/10.1631/FITEE.2300795

@article{title="A review of the flexible job shop scheduling problems considering transportation vehicles",
author="Bin XIN, Sai LU, Qing WANG, Fang DENG",
journal="Frontiers of Information Technology & Electronic Engineering",
year="in press",
publisher="Zhejiang University Press & Springer",
doi="https://doi.org/10.1631/FITEE.2300795"
}

%0 Journal Article
%T A review of the flexible job shop scheduling problems considering transportation vehicles
%A Bin XIN
%A Sai LU
%A Qing WANG
%A Fang DENG
%J Frontiers of Information Technology & Electronic Engineering
%P
%@ 2095-9184
%D in press
%I Zhejiang University Press & Springer
doi="https://doi.org/10.1631/FITEE.2300795"

TY - JOUR
T1 - A review of the flexible job shop scheduling problems considering transportation vehicles
A1 - Bin XIN
A1 - Sai LU
A1 - Qing WANG
A1 - Fang DENG
J0 - Frontiers of Information Technology & Electronic Engineering
SP -
EP -
%@ 2095-9184
Y1 - in press
PB - Zhejiang University Press & Springer
ER -
doi="https://doi.org/10.1631/FITEE.2300795"

Abstract
Chinese Summary
Academic Network
Reviewer Comment

Abstract: The flexible job shop scheduling problem for processing machines and transportation vehicles (FJSP_PT) has garnered significant attention from academia and industry. Due to the inclusion of transportation vehicle scheduling in the scheduling problem of flexible manufacturing systems, solving FJSP_PT becomes more challenging and significantly more practically relevant compared to the flexible job shop scheduling problem. This paper summarizes the assumptions, constraints, objective functions and benchmarks of the FJSP_PT. Then, statistical analysis is conducted on relevant literature up to 2023, including journals, number of articles published each year, and solving algorithms. This paper analyzes recent literature on FJSP_PT, categorizing it based on algorithms into exact algorithms, heuristic algorithms, metaheuristic algorithms, and swarm intelligence-based algorithms. Finally, the research trends and challenges faced by the FJSP_PT problem are summarized.

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Reference

Open peer comments: Debate/Discuss/Question/Opinion

<1>

- Go to

Darkslateblue:Affiliate; Royal Blue:Author; Turquoise:Article

Reference