Solving a stochastic single machine problem with initial idle time and quadratic objective

Authors:
H. M. Soroush
Affiliations:
Department of Statistics and Operations Research, Kuwait University, P.O. Box 5969, 13060 Safat, Kuwait
Venue:
Computers and Operations Research
Year:
2010

Citing 8
Cited 1

Minimizing mean squared deviation of completion times about a common due date

Management Science
A note on the minimization of mean squared deviation of completion times about acommon due date

Management Science
Sequencing with earliness and tardiness penalties: a review

Operations Research
Sequencing JIT mixed-model assembly lines

Management Science
Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review

Operations Research
Principles of Sequencing and Scheduling

Principles of Sequencing and Scheduling
Group shops scheduling with makespan criterion subject to random release dates and processing times

Computers and Operations Research
Completion time variance minimization on a single machine is difficult

Operations Research Letters

Due-date assignment and machine scheduling in a low machine-rate situation with stochastic processing times

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

We study a static single machine scheduling problem in which processing times are stochastic, due-dates and penalties for not completing jobs on time are deterministic, and an initial fixed idle time is allowed to be inserted before the processing of the first job begins on the machine. The objective is to determine the optimal sequence and the optimal initial idle time that jointly minimize the expected value of the sum of a quadratic cost function of idle time and the weighted sum of a quadratic function of job lateness. The problem is NP-hard to solve; however, we develop an exact algorithm based on a precedence relation structure among adjacent jobs. Our extensive computational results show that the algorithm can solve large problem instances quickly. We also demonstrate that the proposed problem is general in the sense that its special cases reduce to new stochastic models while its limiting cases simplify to some deterministic models.