Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration

Authors:
Min Ji;Chou-Jung Hsu;Dar-Li Yang
Affiliations:
School of Computer Science and Information Engineering, Contemporary Business and Trade Research Center, Zhejiang Gongshang University, Hangzhou, P.R. China 310018;Department of Industrial Engineering and Management, Nan Kai University of Technology, Nan-Tou, Taiwan, ROC 542;Department of Information Management, National Formosa University, Yun-Lin, Taiwan, ROC 632
Venue:
Journal of Combinatorial Optimization
Year:
2013

Citing 21
Cited 0

Scheduling deteriorating jobs on a single processor

Operations Research
Scheduling jobs under simple linear deterioration

Computers and Operations Research
Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine

Computers and Industrial Engineering
A note on scheduling on a single processor with speed dependent on a number of executed jobs

Information Processing Letters
A Fully Polynomial Approximation Scheme for Minimizing Makespan of Deteriorating Jobs

Journal of Heuristics
A Fully Polynomial Approximation Scheme for the Weighted Earliness-Tardiness Problem

Operations Research
An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan

Information Processing Letters
Single-machine group scheduling problems with deterioration consideration

Computers and Operations Research
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint

Computers and Operations Research
Scheduling deteriorating jobs on a single machine with release times

Computers and Industrial Engineering
Some scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
Minimizing the makespan with an availability constraint on a single machine under simple linear deterioration

Computers & Mathematics with Applications
An FPTAS for parallel-machine scheduling under a grade of service provision to minimize makespan

Information Processing Letters
Parallel-machine scheduling of simple linear deteriorating jobs

Theoretical Computer Science
Experience-based approach to scheduling problems with the learning effect

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Single-machine scheduling with a nonlinear deterioration function

Information Processing Letters
Scheduling with job-dependent learning effects and multiple rate-modifying activities

Information Processing Letters
Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities

Computers & Mathematics with Applications
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints

Theoretical Computer Science
Single-machine group scheduling with both learning effects and deteriorating jobs

Computers and Industrial Engineering
Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This article studies a single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity. We assume that after maintenance activity, the machine will revert to its initial condition and the aging effects will start anew. Moreover, due to the restriction of budget of maintenance, the limitation of the maintenance frequency on the machine is assumed to be known in advance. The optional maintenance activity of this study means that the starting time of the maintenance activity is unknown in advance. It can be scheduled immediately after the processing of any job that has been completed. Therefore, the planner must to make decision on whether or when to schedule the maintenance activity during the scheduling horizon to optimal the performance measures. The objective is to minimize the makespan. We first show that the addressed problem is NP-hard in the strong sense. Then a fully polynomial-time approximation scheme (FPTAS) for the proposed problem is presented.