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

Authors:
Min Ji;T. C. E. Cheng
Affiliations:
School of Computer Science and Information Engineering, Zhejiang Gongshang University, Hangzhou 310018, PR China and Department of Logistics and Maritime Studies, The Hong Kong Polytechnic Univers ...;Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong
Venue:
Computers and Industrial Engineering
Year:
2010

Citing 7
Cited 3

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
When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

INFORMS Journal on Computing
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 makespan with an availability constraint on a single machine under simple linear deterioration

Computers & Mathematics with Applications

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
Deteriorating job scheduling to minimize the number of late jobs with setup times

Computers and Industrial Engineering
Short Communication: A note on "Single machine scheduling with time-dependent deterioration and exponential learning effect"

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a single-machine scheduling problem in which the processing time of each job is a simple linear deteriorating function of its waiting time. The machine is subject to an availability constraint. Jobs interrupted by machine unavailability can resume their processing. The objective is to minimize the makespan. We first show that the problem can be solved optimally by 0-1 integer programming. We then prove that the problem is NP-hard in the ordinary sense and there exists a fully polynomial time approximation scheme for it.