Job-shop scheduling models with set-up times

Author(s):  
M. Ballicu ◽  
A. Giua ◽  
C. Seatzu
2013 ◽  
Vol 475-476 ◽  
pp. 1019-1024
Author(s):  
Zhi Gang Chen ◽  
Tao Yang ◽  
He Hua Li

The exhibition logistics, which generally deals with set-up, breakdown, transport, and storage to ensure that all specific exhibition requirements are met. It is very special from traditional logistics service that its transportation distant is very short and transportation cost can almost be ignored. To address the problems. a modal to optimize the total cost of exhibition logistics provider was proposed in this paper. Firstly the framwork of exhibition logistics was illustrated by a job-shop schedule modal. Secondly we used genetic algorithm (GA) to deal with problem of job shop scheduling. Finally the experiment result indicate that the proposed algorithm is feasible and effiective for this problem.


2011 ◽  
Vol 411 ◽  
pp. 407-410
Author(s):  
Yan Cao ◽  
Lei Lei ◽  
Ya Dong Fang

Production sequence of workpieces on machines, also called job-shop scheduling problem (JSP), is a focus both in academics and in practices. The research on the problem can promote theoretical progress, shorten the production cycles, improve efficiency in using resources, and strengthen market response in actual production. Ant colony optimization (ACO) is very suitable for the solving of the problem. In the paper, a disjunctive graph model of JSP is set up, which transforms the problem into a natural expression that is suitable for ACO. Then, realization steps of ACO for JSP are discussed. Finally, a 3×3 JSP problem is solved in Jbuilder X. The obtained optimal solution verifies the feasibility and effectiveness of ACO in solving JSP.


Machines ◽  
2021 ◽  
Vol 9 (12) ◽  
pp. 344
Author(s):  
Mingliang Wu ◽  
Dongsheng Yang ◽  
Bowen Zhou ◽  
Zhile Yang ◽  
Tianyi Liu ◽  
...  

The flexible job shop scheduling problem has always been the focus of research in the manufacturing field. However, most of the previous studies focused more on efficiency and ignored energy consumption. Energy, especially non-renewable energy, is an essential factor affecting the sustainable development of a country. To this end, this paper designs a flexible job shop scheduling problem model with energy consideration more in line with the production field. Except for the processing stage, the energy consumption of the transport, set up, unload, and idle stage are also included in our model. The weight property of jobs is also considered in our model. The heavier the job, the more energy it consumes during the transport, set up, and unload stage. Meanwhile, this paper invents an adaptive population non-dominated sorting genetic algorithm III (APNSGA-III) that combines the dual control strategy with the non-dominated sorting genetic algorithm III (NSGA-III) to solve our flexible job shop scheduling problem model. Four flexible job shop scheduling problem instances are formulated to examine the performance of our algorithm. The results achieved by the APNSGA-III method are compared with five classic multi-objective optimization algorithms. The results show that our proposed algorithm is efficient and powerful when dealing with the multi-objective flexible job shop scheduling problem model that includes energy consumption.


Sign in / Sign up

Export Citation Format

Share Document