Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration

2011 ◽  
Vol 217 (9) ◽  
pp. 4819-4826 ◽  
Author(s):  
Shu-Hui Yang ◽  
Ji-Bo Wang
Keyword(s):  
Completion Time ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Total Weighted Completion Time ◽  
Shop Scheduling ◽  
Linear Deterioration ◽  
Weighted Completion Time

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.

SCHEDULING PROBLEMS WITH THE EFFECTS OF DETERIORATION AND LEARNING

2007 ◽  
Vol 24 (02) ◽  
pp. 245-261 ◽  
Author(s):  
JI-BO WANG ◽  
T. C. EDWIN CHENG
Keyword(s):  
Performance Measures ◽  
Single Machine ◽  
Completion Time ◽  
Flow Shop ◽  
Machine Scheduling ◽  
Total Weighted Completion Time ◽  
Scheduling Problems ◽  
Processing Times ◽  
Weighted Completion Time ◽  
Machine Scheduling Problems

This paper deals with the machine scheduling problems with the effects of deterioration and learning. In this model the processing times of jobs are defined as functions of their starting times and positions in a sequence. We introduce polynomial solutions for some single machine problems and flow shop problems. The performance measures include makespan, total completion time, total weighted completion time, and maximum lateness.

Sign in / Sign up

Export Citation Format

Share Document