Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance

Authors:
Ju-Yong Lee;Yeong-Dae Kim
Affiliations:
Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Yusong-gu, Daejon 305-701, Republic of Korea;Department of Industrial Engineering, Korea Advanced Institute of Science and Technology, Yusong-gu, Daejon 305-701, Republic of Korea
Venue:
Computers and Operations Research
Year:
2012

Citing 10
Cited 0

Minimum number of tardy jobs in single machine scheduling with release dates—an improved algorithm

Computers and Industrial Engineering
Single machine flow-time scheduling with a single breakdown

Acta Informatica
Minimizing the number of tardy job units under release time constraints

Discrete Applied Mathematics - Combinatorial Optimization
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Annals of Operations Research
Scheduling jobs under simple linear deterioration

Computers and Operations Research
Single-machine scheduling with periodic maintenance and nonresumable jobs

Computers and Operations Research
An Exact Method to Minimize the Number of Tardy Jobs in Single Machine Scheduling

Journal of Scheduling
Single-machine scheduling with periodic and flexible periodic maintenance to minimize maximum tardiness

Computers and Industrial Engineering
Minimizing the number of tardy jobs under piecewise-linear deterioration

Computers and Industrial Engineering
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

This research focuses on the problem of scheduling jobs on a single machine that requires periodic maintenance with the objective of minimizing the number of tardy jobs. We present a two-phase heuristic algorithm in which an initial solution is obtained first with a method modified from Moore's algorithm for the problem without maintenance and then the solution is improved in the second phase. Performance of the proposed heuristic algorithm is evaluated through computational experiments on randomly generated problem instances and results show that the heuristic gives solutions close to those obtained from a commercial integer programming solver in much shorter time and works better than an existing heuristic algorithm in terms of the solution quality.