Robust scheduling on a single machine to minimize total flow time

Authors:
Chung-Cheng Lu;Shih-Wei Lin;Kuo-Ching Ying
Affiliations:
Graduate Institute of Information and Logistics Management, National Taipei University of Technology, Taipei, Taiwan;Department of Information Management, Chang Gung University, Taoyuan, Taiwan;Department of Industrial Engineering and Management, National Taipei University of Technology, Taipei, Taiwan
Venue:
Computers and Operations Research
Year:
2012

Citing 14
Cited 1

Resource-constrained assignment scheduling

Operations Research
Single facility multi-class job scheduling

Computers and Operations Research
Robust scheduling to hedge against processing time uncertainty in single-stage production

Management Science
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Designing optimal aviation baggage screening strategies using simulated annealing

Computers and Operations Research
Near-shortest and K-shortest simple paths

Networks
Simulated annealing heuristics for the dynamic facility layout problem

Computers and Operations Research
Meta-heuristic approaches for minimizing total earliness and tardiness penalties of single-machine scheduling with a common due date

Journal of Heuristics
A Stochastic Optimization Algorithm Minimizing Expected Flow Times on Uniforn Processors

IEEE Transactions on Computers
Minimizing the number of late jobs in a stochastic setting using a chance constraint

Journal of Scheduling
Minimizing the number of tardy jobs with stochastically-ordered processing times

Journal of Scheduling
Lagrangian relaxation and enumeration for solving constrained shortest-path problems

Networks
Batch scheduling to minimize total completion time

Operations Research Letters
Minimizing maximal regret in the single machine sequencing problem with maximum lateness criterion

Operations Research Letters

Robust vertex p-center model for locating urgent relief distribution centers

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

In a real-world manufacturing environment featuring a variety of uncertainties, production schedules for manufacturing systems often cannot be executed exactly as they are developed. In these environments, schedule robustness that guarantees the best worst-case performance is a more appropriate criterion in developing schedules, although most existing studies have developed optimal schedules with respect to a deterministic or stochastic scheduling model. This study concerns robust single machine scheduling with uncertain job processing times and sequence-dependent family setup times explicitly represented by interval data. The objective is to obtain robust sequences of job families and jobs within each family that minimize the absolute deviation of total flow time from the optimal solution under the worst-case scenario. We prove that the robust single machine scheduling problem of interest is NP-hard. This problem is reformulated as a robust constrained shortest path problem and solved by a simulated annealing-based algorithmic framework that embeds a generalized label correcting method. The results of numerical experiments demonstrate that the proposed heuristic is effective and efficient for determining robust schedules. In addition, we explore the impact of degree of uncertainty on the performance measures and examine the tradeoff between robustness and optimality.