Paper Info
Title
Unrelated Parallel-Machine Scheduling with Controllable Processing Times and Impact of Deteriorating Maintenance Activities under Consideration.
Abstract
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.
Year
DOI
Venue
2016
10.1142/S0217595916500019
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
Keywords
Field
DocType
Scheduling,unrelated parallel machines,controllable processing times,maintenance activities,assignment problem
Mathematical optimization,Time horizon,Time compression,Machine scheduling,Scheduling (computing),Real-time computing,Assignment problem,Linear function,Time complexity,Mathematics
Journal
Volume
Issue
ISSN
33
1
0217-5959
Citations 
PageRank 
References 
2
0.37
21
Authors
2
Name
Order
Citations
PageRank
Chun-Lai Liu120.37
Jian-Jun Wang2845.21