Permutation flowshop manufacturing cell scheduling problems with deteriorating jobs and sequence dependent setup times under dominant machines

2018 ◽  
Author(s):  
Shaojun Lu ◽  
Xinbao Liu ◽  
Jun Pei ◽  
Panos M. Pardalos
Keyword(s):  
Deteriorating Jobs ◽  
Setup Times ◽  
Scheduling Problems ◽  
Permutation Flowshop ◽  
Manufacturing Cell ◽  
Sequence Dependent ◽  
Cell Scheduling ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

scholarly journals Due Date Single Machine Scheduling Problems with Nonlinear Deterioration and Learning Effects and Past Sequence Dependent Setup Times

2014 ◽  
Vol 2014 ◽  
pp. 1-7
Author(s):  
Hüseyin Ceylan
Keyword(s):  
Processing Time ◽  
Single Machine Scheduling ◽  
Setup Times ◽  
Scheduling Problems ◽  
Due Dates ◽  
Sequence Dependent ◽  
Special Cases ◽  
Sequence Dependent Setup ◽  
Dependent Setup Times ◽  
Sequence Dependent Setup Times

We present some problems against due dates with nonlinear learning and deterioration effects and past sequence dependent setup times. In this study, two effects (learning and deterioration) are used for the same processing time. The processing time of a job is shorter if it is scheduled later, rather than in the sequence. This phenomenon is known in the literature as a “learning effect.” On the other hand, in many realistic scheduling settings, a job processed later consumes more time than the same job processed earlier—this is known as scheduling with deteriorating jobs. In the past sequence dependent setup times approach, the setup time of a job is proportionate to the sum of processing times of the jobs already scheduled. In this study, we demonstrated that some problems with due dates remain polynomially solvable. However, for some other problems, we concentrated on finding polynomially solves under their special cases.

Sign in / Sign up

Export Citation Format

Share Document