Single-machine scheduling with decreasing time-dependent processing times to minimize total absolute differences in waiting times

2012 ◽  
Vol 29 (7) ◽  
pp. 444-453 ◽  
Author(s):  
Dan Wang ◽  
Yu-Bin Wu ◽  
Ji-Bo Wang ◽  
Ping Ji
Keyword(s):  
Single Machine ◽  
Waiting Times ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Time Dependent ◽  
Processing Times

scholarly journals Two-Agent Single-Machine Scheduling of Jobs with Time-Dependent Processing Times and Ready Times

2013 ◽  
Vol 2013 ◽  
pp. 1-13 ◽  
Author(s):  
Jan-Yee Kung ◽  
Yuan-Po Chao ◽  
Kuei-I Lee ◽  
Chao-Chung Kang ◽  
Win-Chin Lin
Keyword(s):  
Single Machine ◽  
Processing Time ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Time Dependent ◽  
Research Attention ◽  
Processing Times ◽  
Ready Time ◽  
Increasing Function ◽  
Actual Processing Time

Scheduling involving jobs with time-dependent processing times has recently attracted much research attention. However, multiagent scheduling with simultaneous considerations of jobs with time-dependent processing times and ready times is relatively unexplored. Inspired by this observation, we study a two-agent single-machine scheduling problem in which the jobs have both time-dependent processing times and ready times. We consider the model in which the actual processing time of a job of the first agent is a decreasing function of its scheduled position while the actual processing time of a job of the second agent is an increasing function of its scheduled position. In addition, each job has a different ready time. The objective is to minimize the total completion time of the jobs of the first agent with the restriction that no tardy job is allowed for the second agent. We propose a branch-and-bound and several genetic algorithms to obtain optimal and near-optimal solutions for the problem, respectively. We also conduct extensive computational results to test the proposed algorithms and examine the impacts of different problem parameters on their performance.

Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times

2015 ◽  
Vol 32 (05) ◽  
pp. 1550033 ◽  
Author(s):  
Xin-Jun Li ◽  
Jian-Jun Wang ◽  
Xue-Ru Wang
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Learning Effect ◽  
Waiting Times ◽  
Deteriorating Jobs ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Optimal Sequence ◽  
Processing Times ◽  
Convex Resource Allocation

This paper considers single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times, i.e., the processing time of a job is a function of its starting time, its position in a sequence and its convex resource allocation. The objective is to find the optimal sequence of jobs and the optimal convex resource allocation separately to minimize a cost function containing makespan, total completion (waiting) time, total absolute differences in completion (waiting) times and total resource cost. It is proved that the problem can be solved in polynomial time.

Sign in / Sign up

Export Citation Format

Share Document