Unrelated parallel-machine scheduling with deteriorating maintenance activities

Authors:
T. C. E. Cheng;Chou-Jung Hsu;Dar-Li Yang
Affiliations:
Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong;Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou 542, Taiwan;Department of Information Management, National Formosa University, Yun-Lin 632, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2011

Citing 2
Cited 2

Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering

Heuristics for scheduling problems with an unavailability constraint and position-dependent processing times

Computers and Industrial Engineering
Short Communication: Note on "Unrelated parallel-machine scheduling with deteriorating maintenance activities"

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study the problem of unrelated parallel-machine scheduling with deteriorating maintenance activities. Each machine has at most one maintenance activity, which can be performed at any time throughout the planning horizon. The length of the maintenance activity increases linearly with its starting time. The objective is to minimize the total completion time or the total machine load. We show that both versions of the problem can be optimally solved in polynomial time.