Study on Job Shop Scheduling Optimization with Multi-Objective

A new multi-objective scheduling method based on the GA is proposed to the job-shop scheduling problem (JSP) constrained by machines, workers. Function objectives of the proposed method are to minimize the completion time, the maximum load of machines and the total expense of machines and workers. Firstly, the mathematical model is constructed. Then, on the basis of the mathematical model, the genetic algorithm (GA) based on Pareto is applied, and an optimal or suboptimal scheduling plan can be obtained. The optimal solutions are not unique due to the multi-objective of JSP. Finally, a scheduling example is employed to illustrate that the proposed method could solve multi-objective job shop scheduling problem effectively.

Download Full-text

A FJSSP Method Based on Dynamic Multi-Objective Squirrel Search Algorithm

International Journal of Antennas and Propagation ◽

10.1155/2021/6062689 ◽

2021 ◽

Vol 2021 ◽

pp. 1-19

Author(s):

Yanjiao Wang ◽

Jieru Han

Keyword(s):

Mathematical Model ◽

Job Shop ◽

Job Shop Scheduling ◽

Search Algorithm ◽

Flexible Job Shop ◽

Flexible Job Shop Scheduling ◽

Job Shop Scheduling Problem ◽

Shop Scheduling ◽

Multi Objective ◽

The Mathematical Model

This paper comprehensively analyzes the characteristics of flexible job shop scheduling problem (FJSSP), takes the dynamic factors in the actual scheduling process such as the arrival and departure of jobs, the breakdown and recovery of machines into account at the same time, and establishes a new dynamic multi-objective mathematical model. Take the Squirrel Search Algorithm (SSA) as the core evolution strategy, and combine the multi-objective framework and the dynamic processing technology to solve the established mathematical model. Experimental results show that the mathematical model proposed in this paper can solve the flexible job shop scheduling problem effectively. Compared with other mathematical models, the mathematical model established in this paper can keep better balance between the efficiency and stability.

Download Full-text

Designing a Multi-Objective Mathematical Model for Flexible Job Shop Scheduling Problem With the Earliness/Tardiness Penalty

The Journal of Social Sciences Research ◽

10.32861/jssr.510.1375.1382 ◽

2019 ◽

pp. 1375-1382 ◽

Cited By ~ 1

Author(s):

Mir Hossein Seyyedi ◽

Amir Mohammad Fakoor Saghih ◽

Alireza Pooya ◽

Zahra Naji Azim

Keyword(s):

Mathematical Model ◽

Job Shop ◽

Job Shop Scheduling ◽

Flexible Job Shop ◽

Scheduling Problem ◽

Actual Situation ◽

Flexible Job Shop Scheduling ◽

Job Shop Scheduling Problem ◽

Shop Scheduling ◽

Multi Objective

The scheduling of flexible job shop systems is one of the most important issues in the various fields of production and is currently being addressed by many researchers in the field of optimization issues. The present research includes flexible job shop scheduling problem (FJSSP) with multi-objective, minimizing maximum completion time (makespan), maximum machine workload, total machines workload and also, earliness/tardiness penalty with different constraints. In this research, the researcher is looking to design a mathematical model that can cover all the constraints and assumptions related to the problem. Therefore, the mathematical model was designed with multi-objective and different constraints with exact details and different assumptions that are consistent with the actual situation of the problem and implemented at Comex Company. What that distinguishes this research from other similar researches is the approach of multi-objective with different constraints, which, at the same time, it raises the complexity of the problem but the problem gets closer to the actual situation, with less research done. Finally, the results of the study showed that this mathematical model designed, as well as in the real environment which has the flexible job shop system, can be implemented within a reasonable time with the highest efficiency before the implementation of the model.

Download Full-text