scholarly journals A Parallel Permutation Flow-Shop Scheduling Model by Using a Two-Step Evolutionary Algorithm to Minimize Intermediate Storage with Tolerable Maximum Completion Time

2021 ◽  
Vol 14 (6) ◽  
pp. 464-475
Keyword(s):  
Evolutionary Algorithm ◽  
Completion Time ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Scheduling Model ◽  
Permutation Flow Shop ◽  
Maximum Completion Time ◽  
Intermediate Storage

Minimizing Makespan in Permutation Flow Shop Scheduling with Proportional Deterioration

2015 ◽  
Vol 32 (06) ◽  
pp. 1550050 ◽  
Author(s):  
Na Yin ◽  
Liying Kang
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Special Cases ◽  
Permutation Flow Shop ◽  
Maximum Completion Time ◽  
Permutation Schedule ◽  
Job Deterioration ◽  
Increasing Function

The [Formula: see text]-job and [Formula: see text]-machine permutation flow shop scheduling problem with a proportional deterioration is considered in which all machines process the jobs in the same order, i.e., a permutation schedule. A proportional deterioration means that the job deterioration as an increasing function that is proportional to a linear function of time. The objective is to minimize the makespan, i.e., the maximum completion time. When some dominant relationships between [Formula: see text] machines can be satisfied, we show that some special cases of the problem can be polynomial solvable. For the general case, we also propose a heuristic algorithm and give the computational experiments.

Sign in / Sign up

Export Citation Format

Share Document