Solution algorithms for the total weighted completion time minimization flow shop scheduling with decreasing linear deterioration

2013 ◽  
Vol 67 (1-4) ◽  
pp. 243-253 ◽  
Author(s):  
Ji-Bo Wang ◽  
Ming-Zheng Wang
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Total Weighted Completion Time ◽  
Shop Scheduling ◽  
Solution Algorithms ◽  
Linear Deterioration ◽  
Time Minimization ◽  
Weighted Completion Time ◽  
Decreasing Linear Deterioration

A Heuristic Algorithm for Flow Shop Scheduling Problem

2014 ◽  
Vol 643 ◽  
pp. 374-379
Author(s):  
Hua Wei Yuan ◽  
Yuan Wei Jing ◽  
Tao Ren
Keyword(s):  
Heuristic Algorithm ◽  
Completion Time ◽  
Numerical Experiments ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Shop Scheduling ◽  
Large Size ◽  
Flow Shop Problem ◽  
Weighted Completion Time

This paper considers the m-machine flow shop problem to minimize weighted completion time. A heuristic algorithm is presented to deal with the problem for large size problem. At the end of the paper, some numerical experiments show the effectiveness of the heuristic.

Sign in / Sign up

Export Citation Format

Share Document