Scheduling deteriorating jobs on a single machine with release times

Authors:
Wen-Chiung Lee;Chin-Chia Wu;Yu-Hsiang Chung
Affiliations:
Department of Statistics, Feng Chia University, Taichung, Taiwan;Department of Statistics, Feng Chia University, Taichung, Taiwan;Department of Statistics, Feng Chia University, Taichung, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2008

Citing 8
Cited 8

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
V-shaped policies for scheduling deteriorating jobs

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
Three scheduling problems with deteriorating jobs to minimize the total completion time

Information Processing Letters
Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine

Computers and Operations Research

Single-machine scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
A deteriorating jobs problem with quadratic function of job lateness

Computers and Industrial Engineering
Single-machine scheduling with a nonlinear deterioration function

Information Processing Letters
Minimizing the number of tardy jobs under piecewise-linear deterioration

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
Online makespan scheduling of linear deteriorating jobs on parallel machines

TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Scheduling linear deteriorating jobs to minimize the number of tardy jobs

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

Journal of Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper investigates a single-machine deteriorating job scheduling problem with job release times where its objective is to minimize the makespan. The problem is known to be NP-hard. Therefore, a branch-and-bound algorithm incorporating with several dominance properties and lower bounds is proposed to derive the optimal solution for the problem. In addition, easy-implemented heuristic algorithms are also provided to obtain the near-optimal solution. The computational experiments indicate that the branch-and-bound algorithm can solve most of the medium-job-sized problems within a reasonable time, and the heuristic is quite accurate with an average error percentage of less than 0.3%.