Full Text:   <323>

CLC number: 

On-line Access: 2024-03-04

Received: 2023-11-22

Revision Accepted: 2024-02-20

Crosschecked: 0000-00-00

Cited: 0

Clicked: 186

Citations:  Bibtex RefMan EndNote GB/T7714

-   Go to

Article info.
Open peer comments

Journal of Zhejiang University SCIENCE C 1998 Vol.-1 No.-1 P.

http://doi.org/10.1631/FITEE.2300795


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


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, 1998, -1(-1): .

@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",
volume="-1",
number="-1",
pages="",
year="1998",
publisher="Zhejiang University Press & Springer",
doi="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 Journal of Zhejiang University SCIENCE C
%V -1
%N -1
%P
%@ 2095-9184
%D 1998
%I Zhejiang University Press & Springer
%DOI 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 - Journal of Zhejiang University Science C
VL - -1
IS - -1
SP -
EP -
%@ 2095-9184
Y1 - 1998
PB - Zhejiang University Press & Springer
ER -
DOI - 10.1631/FITEE.2300795


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

Open peer comments: Debate/Discuss/Question/Opinion

<1>

Please provide your name, email address and a comment





Journal of Zhejiang University-SCIENCE, 38 Zheda Road, Hangzhou 310027, China
Tel: +86-571-87952783; E-mail: cjzhang@zju.edu.cn
Copyright © 2000 - 2024 Journal of Zhejiang University-SCIENCE