Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work

2016 ◽  
Vol 63 (2) ◽  
pp. 172-183 ◽  
Author(s):  
Yunqiang Yin ◽  
Jianyou Xu ◽  
T. C. E. Cheng ◽  
Chin-Chia Wu ◽  
Du-Juan Wang
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Approximation Schemes ◽  
Late Work ◽  
Maintenance Activity

Single-Machine Scheduling to Minimize Makespan with Deterioration Jobs and Multi-Maintenance Activities

2013 ◽  
Vol 690-693 ◽  
pp. 3007-3013
Author(s):  
Chou Jung Hsu ◽  
Hung Chi Chen
Keyword(s):  
Lower Bound ◽  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Initial Condition ◽  
Computational Results ◽  
Maintenance Activity ◽  
Deterioration Jobs ◽  
Deterioration Effect ◽  
Maintenance Activities

This paper explored a single-machine scheduling deterioration jobs with multi-maintenance activities. The non-resumable case and simple linear deterioration effect were taken into account as well. We assumed that after a maintenance activity, the machine will revert to its initial condition and the deterioration effect will start anew. The objective was to minimize the makespan in the system. The problem was proven to be NP-hard in the strong sense. Therefore, a heuristic and a lower bound were introduced and tested numerically. Computational results showed that the proposed algorithm performed well.

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.

Single‐machine scheduling with deadlines to minimize the total weighted late work

2019 ◽  
Vol 66 (7) ◽  
pp. 582-595 ◽  
Author(s):  
Rubing Chen ◽  
Jinjiang Yuan ◽  
C.T. Ng ◽  
T.C.E. Cheng
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Late Work

Robust single machine scheduling with a flexible maintenance activity

2019 ◽  
Vol 107 ◽  
pp. 19-31 ◽  
Author(s):  
Paolo Detti ◽  
Gaia Nicosia ◽  
Andrea Pacifici ◽  
Garazi Zabalo Manrique de Lara
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Maintenance Activity

Single-machine scheduling with a variable maintenance activity

2015 ◽  
Vol 79 ◽  
pp. 168-174 ◽  
Author(s):  
Wenchang Luo ◽  
T.C.E. Cheng ◽  
Min Ji
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Maintenance Activity

Single Machine Scheduling to Minimize Total Late Work

1992 ◽  
Vol 40 (3) ◽  
pp. 586-595 ◽  
Author(s):  
C. N. Potts ◽  
L. N. Van Wassenhove
Keyword(s):  
Single Machine ◽  
Machine Scheduling ◽  
Single Machine Scheduling ◽  
Late Work
Sign in / Sign up

Export Citation Format

Share Document