A two-machine flowshop makespan scheduling problem with deteriorating jobs

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

Citing 8
Cited 10

Single facility scheduling with nonlinear processing times

Computers and Industrial Engineering
Scheduling deteriorating jobs on a single processor

Operations Research
Scheduling jobs with step-deterioration; minimizing makespan on a single- and multi-machine

Computers and Industrial Engineering
Three scheduling problems with deteriorating jobs to minimize the total completion time

Information Processing Letters
Minimizing the total weighted completion time of deteriorating jobs

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 under decreasing linear deterioration

Journal of Applied Mathematics and Computing
Job Sequencing with Exponential Functions of Processing Times

Informatica

Single-machine scheduling problems with deteriorating jobs and learning effects

Computers and Industrial Engineering
The Browne-Yechiali single-machine sequence is optimal for flow-shops

Computers and Operations Research
Single-machine scheduling with a nonlinear deterioration function

Information Processing Letters
Flow shop scheduling to minimize makespan with decreasing time-dependent job processing times

Computers and Industrial Engineering
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
Flowshop scheduling of deteriorating jobs on dominating machines

Computers and Industrial Engineering
Application of particle swarm optimization and simulated annealing algorithms in flow shop scheduling problem under linear deterioration

Advances in Engineering Software
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
Minimizing makespan in three-machine flow shops with deteriorating jobs

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

In traditional scheduling problems, the job processing times are assumed to be known and fixed from the first job to be processed to the last job to be completed. However, in many realistic situations, a job will consume more time than it would have consumed if it had begun earlier. This phenomenon is known as deteriorating jobs. In the science literature, the deteriorating job scheduling problems are relatively unexplored in the flowshop settings. In this paper, we study a two-machine flowshop makespan scheduling problem in which job processing times vary as time passes, i.e. they are assumed as increasing functions of their starting times. First, an exact algorithm is established to solve most of the problems of up to 32 jobs in a reasonable amount of time. Then, three heuristic algorithms are provided to derive the near-optimal solutions. A simulation study is conducted to evaluate the performances of the proposed algorithms. In addition, the impact of the deterioration rate is also investigated.