A note on flow shop scheduling problems with a learning effect on no-idle dominant machines

2007 ◽  
Vol 184 (2) ◽  
pp. 945-949 ◽  
Author(s):  
MingBao Cheng ◽  
ShiJie Sun ◽  
Ying Yu
Keyword(s):  
Learning Effect ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling

A Note on Flow Shop Scheduling with the Effects of Learning and Deterioration

2014 ◽  
Vol 513-517 ◽  
pp. 2149-2152
Author(s):  
Yu Ping Niu ◽  
Ji Bo Wang
Keyword(s):  
Learning Effect ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Processing Times ◽  
Polynomially Solvable ◽  
Machine Scheduling Problems ◽  
Completion Times ◽  
Sum Of Completion Times

In this note, we consider the machine scheduling problems with the effects of learning and deterioration. In this model, job processing times are defined by functions dependent on their starting times and positions in the sequence. The scheduling objectives are makespan, sum of completion times. It is shown that even with the introduction of learning effect and deterioration jobs to job processing times, several flow shop problems remain polynomially solvable.

Several flow shop scheduling problems with truncated position-based learning effect

2013 ◽  
Vol 40 (12) ◽  
pp. 2906-2929 ◽  
Author(s):  
Xiao-Yuan Wang ◽  
Zhili Zhou ◽  
Xi Zhang ◽  
Ping Ji ◽  
Ji-Bo Wang
Keyword(s):  
Learning Effect ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling

Two-machine flow shop scheduling problems with minimal and maximal delays

4OR ◽  
2006 ◽  
Vol 4 (1) ◽  
pp. 15-28 ◽  
Author(s):  
Jean-Louis Bouquard ◽  
Christophe Lenté
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling
Sign in / Sign up

Export Citation Format

Share Document