Scheduling of a Job Shop with Two Machine Centers Having Parallel Machines

2010 ◽  
Author(s):  
Wieslaw Kubiak ◽  
Suresh Sethi ◽  
Chelliah Srishkandarajah
Keyword(s):  
Parallel Machines ◽  
Job Shop ◽  
Machine Centers

scholarly journals Utilizing Model Knowledge for Design Developed Genetic Algorithm to Solving Problem

2018 ◽  
Vol 3 (2) ◽  
pp. 172
Author(s):  
Hamidreza Salmani mojaveri
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Parallel Machines ◽  
Job Shop ◽  
Optimization Problems ◽  
Premature Convergence ◽  
Local Optimum ◽  
Scheduling Problems ◽  
Algorithm Implementation

One of the discussed topics in scheduling problems is Dynamic Flexible Job Shop with Parallel Machines (FDJSPM). Surveys show that this problem because of its concave and nonlinear nature usually has several local optimums. Some of the scheduling problems researchers think that genetic algorithms (GA) are appropriate approach to solve optimization problems of this kind. But researches show that one of the disadvantages of classical genetic algorithms is premature convergence and the probability of trap into the local optimum. Considering these facts, in present research, represented a developed genetic algorithm that its controlling parameters change during algorithm implementation and optimization process. This approach decreases the probability of premature convergence and trap into the local optimum. The several experiments were done show that the priority of proposed procedure of solving in field of the quality of obtained solution and convergence speed toward other present procedure.

scholarly journals A New Meta-Heuristic Algorithm for Solving the Flexible Dynamic Job-Shop Problem with Parallel Machines

Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 165 ◽  
Author(s):  
Arun Sangaiah ◽  
Mohsen Suraki ◽  
Mehdi Sadeghilalimi ◽  
Seyed Bozorgi ◽  
Ali Hosseinabadi ◽  
...  
Keyword(s):  
Manufacturing Systems ◽  
Parallel Machines ◽  
Job Shop ◽  
Two Dimensional ◽  
Scheduling Problems ◽  
Operational Flexibility ◽  
Machine Failure ◽  
Different Dimensions ◽  
First Time ◽  
Dynamic Job Shop

In a real manufacturing environment, the set of tasks that should be scheduled is changing over the time, which means that scheduling problems are dynamic. Also, in order to adapt the manufacturing systems with fluctuations, such as machine failure and create bottleneck machines, various flexibilities are considered in this system. For the first time, in this research, we consider the operational flexibility and flexibility due to Parallel Machines (PM) with non-uniform speed in Dynamic Job Shop (DJS) and in the field of Flexible Dynamic Job-Shop with Parallel Machines (FDJSPM) model. After modeling the problem, an algorithm based on the principles of Genetic Algorithm (GA) with dynamic two-dimensional chromosomes is proposed. The results of proposed algorithm and comparison with meta-heuristic data in the literature indicate the improvement of solutions by 1.34 percent for different dimensions of the problem.

scholarly journals Research on Construction and Application for the Model of Multistage Job Shop Scheduling Problem

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Jianzhong Xu ◽  
Song Zhang ◽  
Yuzhen Hu
Keyword(s):  
Production Efficiency ◽  
Parallel Machines ◽  
Job Shop ◽  
Job Shop Scheduling ◽  
Scheduling Problem ◽  
Job Shop Scheduling Problem ◽  
Shop Scheduling ◽  
Second Stage ◽  
Sequencing Algorithm ◽  
Two Stages

Based on the practical application of an enterprise, we address the multistage job shop scheduling problem with several parallel machines in the first stage (production), a few parallel machines in the second stage (processing and assembly), and one machine in the following stages (including joint debugging, testing, inspection, and packaging). First, we establish the optimization objective model for the first two stages. Then, based on the design of the sequencing algorithm in the first two stages, a correction algorithm is designed between the first stage and the second stage to solve this problem systematically. Finally, we propose two benchmark approaches to verify the performance of our proposed algorithm. Verification of numerical experiments shows that the model and algorithm constructed in this paper effectively improve the production efficiency of the enterprise.

scholarly journals Is a unit-time job shop not easier than identical parallel machines?

1998 ◽  
Vol 85 (2) ◽  
pp. 149-162 ◽  
Author(s):  
Vadim G. Timkovsky
Keyword(s):  
Parallel Machines ◽  
Job Shop ◽  
Identical Parallel Machines
Sign in / Sign up

Export Citation Format

Share Document