A deteriorating jobs problem with quadratic function of job lateness

Authors:
Yu-Hsiang Chung;Han-Chu Liu;Chin-Chia Wu;Wen-Chiung Lee
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;Department of Statistics, Feng Chia University, Taichung, Taiwan
Venue:
Computers and Industrial Engineering
Year:
2009

Citing 7
Cited 4

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
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 group scheduling problems with deterioration consideration

Computers and Operations Research
Single machine group scheduling under decreasing linear deterioration

Journal of Applied Mathematics and Computing
Scheduling deteriorating jobs on a single machine with release times

Computers and Industrial Engineering

Single-machine scheduling with a nonlinear deterioration function

Information Processing Letters
Scheduling problems with general effects of deterioration and learning

Information Sciences: an International Journal
Deteriorating job scheduling to minimize the number of late jobs with setup times

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Deteriorating jobs scheduling has received increasing attention in recent years. However, most researchers focused on regular criteria such as the makespan, and the total (weighted) completion time. However, in many real-life situations, early completion of a job is equally undesirable as its late completion. In such cases, minimizing the quadratic function of job lateness may be an appropriate objective for the decision makers. Therefore, this paper addresses a single-machine problem where the objective is to minimize the sum of squares of job lateness under the simple linear deterioration assumption. A branch-and-bound algorithm and two heuristic algorithms are provided to search for the optimal solution and the near-optimal solutions, respectively. Computational results are presented to evaluate the performance of the proposed algorithms.