Single machine scheduling with multiple common due date assignment and aging effect under a deteriorating maintenance activity consideration

2013 ◽  
Vol 46 (1-2) ◽  
pp. 51-66 ◽  
Author(s):  
Yan-Peng Fan ◽  
Chuan-Li Zhao
Keyword(s):  
Single Machine ◽  
Aging Effect ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Due Date ◽  
Due Date Assignment ◽  
Common Due Date ◽  
Maintenance Activity ◽  
Deteriorating Maintenance

Single-machine scheduling and common due date assignment with potential machine disruption

2017 ◽  
Vol 56 (3) ◽  
pp. 1345-1360 ◽  
Author(s):  
Xiaoyun Xiong ◽  
Dujuan Wang ◽  
T.C. Edwin Cheng ◽  
Chin-Chia Wu ◽  
Yunqiang Yin
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Due Date ◽  
Due Date Assignment ◽  
Common Due Date ◽  
Machine Disruption

Single machine scheduling with a variable common due date and resource-dependent processing times

2003 ◽  
Vol 30 (8) ◽  
pp. 1173-1185 ◽  
Author(s):  
C.T.Daniel Ng ◽  
T.C.Edwin Cheng ◽  
Mikhail Y. Kovalyov ◽  
S.S. Lam
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Due Date ◽  
Common Due Date ◽  
Processing Times

Single Machine Scheduling and due Date Assignment with Past-Sequence-Dependent Delivery Times and General Position-Dependent Processing Times

2014 ◽  
Vol 624 ◽  
pp. 675-680
Author(s):  
Yu Fang Zhao
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Scheduling Problems ◽  
Due Date ◽  
Due Date Assignment ◽  
Processing Times ◽  
Delivery Times ◽  
Weighted Number ◽  
Tardy Jobs

We studied single machine scheduling problems in which the jobs need to be delivered to customers after processing. It is assumed that the delivery times are proportional to the length of the already processed jobs, and a job's processing time depended on its position in a sequence. The objective functions include total earliness, the weighted number of tardy jobs and the cost of due date assignment. We analyzed these problems with two different due date assignment methods and conclude that the problems are polynomial time solvable.

A Bicriteria Approach for Single Machine Scheduling with Resource Allocation, Learning Effect and a Deteriorating Maintenance Activity

2017 ◽  
Vol 34 (04) ◽  
pp. 1750011 ◽  
Author(s):  
Zhusong Liu ◽  
Zhenyou Wang ◽  
Yuan-Yuan Lu
Keyword(s):  
Resource Allocation ◽  
Single Machine ◽  
Learning Effect ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Maintenance Activity ◽  
Optimal Resource ◽  
Deteriorating Maintenance ◽  
Polynomially Solvable ◽  
Completion Times

This paper considers the single machine scheduling with learning effect, resource allocation and deteriorating maintenance activity simultaneously. For the convex resource allocation consumption function, we provide a bicriteria analysis where the first (schedule) criterion is to minimize the total weighted sum of makespan, total completion time and total absolute differences in completion times, and the second (resource) criterion is to minimize the total weighted resource consumption. Our aim is to find the optimal resource allocations and job sequence that minimize the three different models of considering the two criterion. We show that these three models are polynomially solvable respectively.

Sign in / Sign up

Export Citation Format

Share Document