A general flow shop scheduling problem with consideration of position-based learning effect and multiple availability constraints

2014 ◽  
Vol 73 (5-8) ◽  
pp. 601-611 ◽  
Author(s):  
Behdin Vahedi-Nouri ◽  
Parviz Fattahi ◽  
Reza Tavakkoli-Moghaddam ◽  
Reza Ramezanian
Keyword(s):  
Learning Effect ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
General Flow ◽  
Availability Constraints

GA-BASED IMPROVEMENT HEURISTIC FOR MINIMIZING MAKESPAN IN A GENERAL FLOW-SHOP SCHEDULING PROBLEM

2021 ◽  
pp. 1109-1115
Author(s):  
Brahma Datta Shukla, Pragya Singh Tomar
Keyword(s):  
Lower Bound ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
General Flow ◽  
Constructive Heuristic ◽  
Permutation Flow Shop ◽  
Constructive Heuristics ◽  
Flow Shop Problem

The study proposes an evolutionary algorithm-based improvement heuristic for the permutation flow-shop problem. The method uses a constructive heuristic to arrive at a good first solution. The GA-based improvement heuristic is used in conjunction with CDS, Gupta's algorithm, and Palmer's Slope Index, which are all well-known constructive heuristics. The method is put to the test on a series of ten issues that vary from 4 to 25 tasks and 4 to 30 machines. The outcomes are also compared to some of the most well-known lower-bound options

Sign in / Sign up

Export Citation Format

Share Document