Rescheduling with Controllable Processing Times and Preventive Maintenance in the Presence of New Arrival Jobs and Deterioration Effect

2020 ◽  
pp. 89-114
Author(s):  
Dujuan Wang ◽  
Yunqiang Yin ◽  
Yaochu Jin
Keyword(s):  
Preventive Maintenance ◽  
Controllable Processing Times ◽  
Processing Times ◽  
Deterioration Effect

Bicriterion scheduling with truncated learning effects and convex controllable processing times

2020 ◽  
Vol 28 (3) ◽  
pp. 1573-1593
Author(s):  
Ji‐Bo Wang ◽  
Dan‐Yang Lv ◽  
Jian Xu ◽  
Ping Ji ◽  
Fuqiang Li
Keyword(s):  
Controllable Processing Times ◽  
Learning Effects ◽  
Processing Times

Unrelated Parallel-Machine Scheduling with Controllable Processing Times and Impact of Deteriorating Maintenance Activities under Consideration

2016 ◽  
Vol 33 (01) ◽  
pp. 1650001 ◽  
Author(s):  
Chun-Lai Liu ◽  
Jian-Jun Wang
Keyword(s):  
Processing Time ◽  
Machine Scheduling ◽  
Parallel Machine Scheduling ◽  
Parallel Machine ◽  
Controllable Processing Times ◽  
Maintenance Activity ◽  
Processing Times ◽  
Unrelated Parallel Machine Scheduling ◽  
Deteriorating Maintenance ◽  
Maintenance Activities

In this paper, we study the problem of unrelated parallel machine scheduling with controllable processing times and deteriorating maintenance activity. The jobs are nonresumable. The processing time of each job is a linear function of the amount of a continuously divisible resource allocated to the job. During the planning horizon, there is at most one maintenance activity scheduled on each machine. Additionally, if the starting time of maintenance activity is delayed, the length of the maintenance activity required to perform will increase. Considering the total completion times of all jobs, the impact of maintenance activity in the form of the variation in machine load and the amounts of compression, we need to determine the job sequence on each machine, the location of maintenance activities and processing time compression of each job simultaneously. Accordingly, a polynomial time solution to the problem is provided.

Efficient scheduling of a stochastic no-wait job shop with controllable processing times

2020 ◽  
Vol 162 ◽  
pp. 113879
Author(s):  
Alexander Aschauer ◽  
Florian Roetzer ◽  
Andreas Steinboeck ◽  
Andreas Kugi
Keyword(s):  
Job Shop ◽  
Controllable Processing Times ◽  
Processing Times ◽  
No Wait

scholarly journals Preemptive Scheduling with Controllable Processing Times on Parallel Machines

2015 ◽  
Vol 3 (1) ◽  
pp. 68-76
Author(s):  
Guiqing Liu ◽  
Kai Li ◽  
Bayi Cheng
Keyword(s):  
Polynomial Time ◽  
Resource Use ◽  
Parallel Machines ◽  
Optimal Algorithm ◽  
Parallel Machine Scheduling ◽  
Controllable Processing Times ◽  
Scheduling Problems ◽  
Processing Times ◽  
Online Problems ◽  
Machine Scheduling Problems

AbstractThis paper considers several parallel machine scheduling problems with controllable processing times, in which the goal is to minimize the makespan. Preemption is allowed. The processing times of the jobs can be compressed by some extra resources. Three resource use models are considered. If the jobs are released at the same time, the problems under all the three models can be solved in a polynomial time. The authors give the polynomial algorithm. When the jobs are not released at the same time, if all the resources are given at time zero, or the remaining resources in the front stages can be used to the next stages, the offline problems can be solved in a polynomial time, but the online problems have no optimal algorithm. If the jobs have different release dates, and the remaining resources in the front stages can not be used in the next stages, both the offline and online problems can be solved in a polynomial time.

Sign in / Sign up

Export Citation Format

Share Document