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

Authors:
Chin-Chia Wu;Wen-Chiung Lee
Affiliations:
Department of Statistics, Feng Chia University, Taichung 407, Taiwan, R.O.C.;Department of Statistics, Feng Chia University, Taichung 407, Taiwan, R.O.C.
Venue:
Information Processing Letters
Year:
2003

Citing 6
Cited 15

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
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
Scheduling linearly deteriorating jobs on multiple machines

Computers and Industrial Engineering - Special issue: new advances in analysis of manufacturing systems
Scheduling: Theory, Algorithms, and Systems

Scheduling: Theory, Algorithms, and Systems

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

Theoretical Computer Science
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint

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

Computers & Mathematics with Applications
Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine

COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Parallel-machine scheduling of simple linear deteriorating jobs

Theoretical Computer Science
A survey of scheduling with deterministic machine availability constraints

Computers and Industrial Engineering
Preemptive scheduling with simple linear deterioration 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
Scheduling resumable deteriorating jobs on a single machine with non-availability constraints

Theoretical Computer Science
Approximation scheme for scheduling resumable proportionally deteriorating jobs

FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Single-machine scheduling problems simultaneously with deterioration and learning effects under deteriorating multi-maintenance activities consideration

Computers and Industrial Engineering
Scheduling linear deteriorating jobs to minimize the number of tardy jobs

Journal of Global Optimization
Unrelated parallel-machine scheduling problems with aging effects and deteriorating maintenance activities

Information Sciences: an International Journal

Quantified Score

Hi-index	0.90

Visualization

Abstract

The scheduling problem with deteriorating jobs to minimize the makespan on a single machine where the facility has an availability constraint is studied in this paper. By a deteriorating job we mean that the processing time for the job is a function of its starting time. Even with the introduction of the availability to a facility, the linear deteriorating model can be solved using the 0-1 integer programming technique if the actual job processing time is proportional to the starting time.