Two-machine group scheduling problems in discrete parts manufacturing with sequence-dependent setups

2006 ◽  
Vol 33 (1) ◽  
pp. 158-180 ◽  
Author(s):  
Rasaratnam Logendran ◽  
Nasser Salmasi ◽  
Chelliah Sriskandarajah
Keyword(s):  
Group Scheduling ◽  
Scheduling Problems ◽  
Machine Group ◽  
Sequence Dependent ◽  
Parts Manufacturing

Sequence-dependent group scheduling problems in flexible flow shops

2006 ◽  
Vol 102 (1) ◽  
pp. 66-86 ◽  
Author(s):  
Rasaratnam Logendran ◽  
Paula deSzoeke ◽  
Faith Barnard
Keyword(s):  
Group Scheduling ◽  
Scheduling Problems ◽  
Flow Shops ◽  
Sequence Dependent

Single Machine Group Scheduling Problems with the Effects of Deterioration and Learning

2009 ◽  
Vol 35 (10) ◽  
pp. 1290-1295 ◽  
Author(s):  
Yang YAN ◽  
Da-Zhi WANG ◽  
Ding-Wei WANG ◽  
H.Ip W ◽  
Hong-Feng WANG
Keyword(s):  
Single Machine ◽  
Group Scheduling ◽  
Scheduling Problems ◽  
Machine Group

scholarly journals Single-Machine Group Scheduling Problems with Deterioration to Minimize the Sum of Completion Times

2012 ◽  
Vol 2012 ◽  
pp. 1-9 ◽  
Author(s):  
Yong He ◽  
Li Sun
Keyword(s):  
Single Machine ◽  
Group Scheduling ◽  
Scheduling Problems ◽  
Minimization Problems ◽  
Processing Times ◽  
Machine Group ◽  
Polynomially Solvable ◽  
Decreasing Functions ◽  
Completion Times ◽  
Sum Of Completion Times

We consider two single-machine group scheduling problems with deteriorating group setup and job processing times. That is, the job processing times and group setup times are linearly increasing (or decreasing) functions of their starting times. Jobs in each group have the same deteriorating rate. The objective of scheduling problems is to minimize the sum of completion times. We show that the sum of completion times minimization problems remains polynomially solvable under the agreeable conditions.

scholarly journals Single-Machine Group Scheduling Problems with Variable Job Processing Times

2015 ◽  
Vol 2015 ◽  
pp. 1-9
Author(s):  
Ping Ji ◽  
Lin Li
Keyword(s):  
Single Machine ◽  
Minimization Problem ◽  
Deteriorating Jobs ◽  
Setup Time ◽  
Resource Consumption ◽  
Group Scheduling ◽  
Scheduling Problems ◽  
Processing Times ◽  
Machine Group ◽  
Total Resource

This paper considers two resource constrained single-machine group scheduling problems. These problems involve variable job processing times (general position-dependent learning effects and deteriorating jobs); that is, the processing time of a job is defined by the function that involves its starting time and position in the group, and groups’ setup time is a positive strictly decreasing continuous function of the amount of consumed resource. Polynomial time algorithms are proposed to optimally solve the makespan minimization problem under the constraint that the total resource consumption does not exceed a given limit and the total resource consumption minimization problem under the constraint that the makespan does not exceed a given limit, respectively.

Single Machine Group Scheduling Problems with the Effects of Deterioration and Learning

2009 ◽  
Vol 35 (10) ◽  
pp. 1290-1295 ◽  
Author(s):  
Yang YAN ◽  
Da-Zhi WANG ◽  
Ding-Wei WANG ◽  
W.H. Ip ◽  
Hong-Feng WANG
Keyword(s):  
Single Machine ◽  
Group Scheduling ◽  
Scheduling Problems ◽  
Machine Group
Sign in / Sign up

Export Citation Format

Share Document