Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities

Authors:
Chou-Jung Hsu;Min Ji;Jia-Yuarn Guo;Dar-Li Yang
Affiliations:
Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou 542, Taiwan;School of Computer Science and Information Engineering, Contemporary Business and Trade Research Center, Zhejiang Gongshang University, Hangzhou 310018, PR China;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:
Information Sciences: an International Journal
Year:
2013

Citing 17
Cited 0

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
Three scheduling problems with deteriorating jobs to minimize the total completion time

Information Processing Letters
Minimizing the total weighted completion time of deteriorating jobs

Information Processing Letters
Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine

Information Processing Letters
Scheduling Algorithms

Scheduling Algorithms
Scheduling linear deteriorating jobs with an availability constraint on a single machine

Theoretical Computer Science
Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration

Computers & Mathematics with Applications
Time-Dependent Scheduling

Time-Dependent Scheduling
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems
Experience-based approach to scheduling problems with the learning effect

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Scheduling problems with general effects of deterioration and learning

Information Sciences: an International Journal
Unrelated parallel-machine scheduling with rate-modifying activities to minimize the total completion time

Information Sciences: an International Journal
Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect

Information Sciences: an International Journal
Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties

Information Sciences: an International Journal
Notes on "Scheduling problems with general effects of deterioration and learning"

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

This paper explores the problems of unrelated parallel-machine scheduling with aging effects and deteriorating maintenance activities. The jobs are non-resumable. Each machine has at most one maintenance activity which is allowed throughout the planning horizon. Assume that once the maintenance activity is completed, the functions of machine and the properties of jobs e.g. the temperature (hardness) of materials that processed by the machine will be restored to their initial conditions. The length of the maintenance activity is a linear function of its starting time. The objectives of this study are to minimize the total completion time and the total machine load. Three basic types of aging effect model are proposed. We show that all the proposed models can be solved optimally in polynomial time.