An Integrated Heuristic for Machine Sequencing With Specific Reference to the Permutation Flow-Shop Scheduling Problem

2019 ◽  
Vol 2 (2) ◽  
pp. 1-8
Author(s):  
Kaveh Sheibani
Keyword(s):  
Operations Management ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Specific Reference ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Permutation Flow Shop Scheduling ◽  
Wide Range ◽  
Permutation Flow Shop ◽  
Sequencing Problems

This article presents an integrated heuristic for the permutation flow-shop scheduling problem with the makespan criterion as one of the most widely studied classical sequencing problems in operations management. The proposed method consists of two phases: arranging the jobs in a priority order and then constructing a sequence by a job insertion principle. A fuzzy greedy evaluation function is employed to prioritize the jobs for incorporating into the construction phase of the proposed heuristic. It is shown that the developed method gives a significantly improved performance for a wide range of standard problems of varying sizes.

Sign in / Sign up

Export Citation Format

Share Document