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

Authors:
Chinyao Low;Chou-Jung Hsu;Chwen-Tzeng Su
Affiliations:
Institute of Industrial Engineering and Management, National Yunlin University of Science and Technology, Taiwan;Institute of Industrial Engineering and Management, National Yunlin University of Science and Technology, Taiwan and Department of Industrial Engineering and Management, Nan Kai Institute of Techn ...;Institute of Industrial Engineering and Management, National Yunlin University of Science and Technology, Taiwan
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 7
Cited 11

The NP-completeness column: An ongoing guide

Journal of Algorithms
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
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine

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

Theoretical Computer Science

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

Computers & Mathematics with Applications
Minimizing the number of tardy jobs under piecewise-linear deterioration

Computers and Industrial Engineering
Scheduling resumable simple linear deteriorating jobs on a single machine with an availability constraint to minimize makespan

Computers and Industrial Engineering
A heuristic approach for a scheduling problem with periodic maintenance and sequence-dependent setup times

Computers & Mathematics with Applications
Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness

Computers and Operations Research
Some single-machine and flowshop scheduling problems with a non-linear deterioration function

Computers & Mathematics with Applications
Single-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities consideration

Computers and Industrial Engineering
Joint reply to the erratum and the note on "Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning" [Math. Comput. Modelling 50 (2009) 401-406]

Mathematical and Computer Modelling: An International Journal
Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities

Information Sciences: an International Journal
A multi-start tabu search method for a single-machine scheduling problem with periodic maintenance and sequence-dependent set-up times

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

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.09

Visualization

Abstract

This article considers a single machine scheduling problem with an availability constraint under simple linear deterioration. The non-preemptive case is taken into account as well. The objective is to minimize the makespan in the system. The addressed problem is first described as a 0-1 integer programming model, and is then solved optimally. Subsequently, we prove that the addressed problem belongs to NP-hard. Thus, some heuristic algorithms based on the bin packing concepts are provided for solving the addressed problem. Computational results show that the proposed algorithm H3 performs well. In addition, a good strategy that sets the maintenance to start epoch when half the jobs have been already processed is suggested as well.