Single machine group scheduling with decreasing time-dependent processing times subject to release dates

2014 ◽  
Vol 234 ◽  
pp. 286-292 ◽  
Author(s):  
Yuan-Yuan Lu ◽  
Jian-Jun Wang ◽  
Ji-Bo Wang
Keyword(s):  
Single Machine ◽  
Time Dependent ◽  
Group Scheduling ◽  
Release Dates ◽  
Processing Times ◽  
Machine Group

Single machine group scheduling with resource dependent setup and processing times

2005 ◽  
Vol 162 (1) ◽  
pp. 112-121 ◽  
Author(s):  
Adam Janiak ◽  
Mikhail Y. Kovalyov ◽  
Marie-Claude Portmann
Keyword(s):  
Single Machine ◽  
Group Scheduling ◽  
Processing Times ◽  
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 with new models of position-dependent processing times

2018 ◽  
Vol 117 ◽  
pp. 1-5 ◽  
Author(s):  
Xin Zhang ◽  
Lijuan Liao ◽  
Wenya Zhang ◽  
T.C.E. Cheng ◽  
Yuanyuan Tan ◽  
...  
Keyword(s):  
Single Machine ◽  
Group Scheduling ◽  
Processing Times ◽  
Machine Group ◽  
New Models

Single Machine Group Scheduling Problem with Deteriorating Jobs and Release Dates

2014 ◽  
Vol 513-517 ◽  
pp. 2145-2148 ◽  
Author(s):  
Lu Liu ◽  
Yang Tao Xu ◽  
Na Yin ◽  
Ji Bo Wang
Keyword(s):  
Single Machine ◽  
Group Technology ◽  
Deteriorating Jobs ◽  
Single Machine Scheduling ◽  
Linear Functions ◽  
Release Dates ◽  
Scheduling Problem ◽  
Makespan Minimization ◽  
Processing Times ◽  
Machine Group

The paper deals with a single machine scheduling problem with deteriorating jobs and group technology (GT) assumption. By deteriorating jobs and group technology assumption, we mean that the group setup times and job processing times are both simple linear functions of their starting times. We show that the makespan minimization problem with release dates can be solved in polynomial time.

Sign in / Sign up

Export Citation Format

Share Document