Single machine stochastic scheduling to minimize the expected number of tardy jobs using mathematical programming models

Authors:
Dong K. Seo;Cerry M. Klein;Wooseung Jang
Affiliations:
Department of Industrial and Manufacturing Systems Engineering, University of Missouri--Columbia, E3437 Engineering Building East, Columbia, MO;Department of Industrial and Manufacturing Systems Engineering, University of Missouri--Columbia, E3437 Engineering Building East, Columbia, MO;Department of Industrial and Manufacturing Systems Engineering, University of Missouri--Columbia, E3437 Engineering Building East, Columbia, MO
Venue:
Computers and Industrial Engineering
Year:
2005

Citing 2
Cited 2

On the minimization of the weighted number of tardy jobs with random processing times and deadline

Computers and Operations Research
Rearrangement, majorization and stochastic scheduling

Mathematics of Operations Research

Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: a case study based on the apparel industry

Computers and Industrial Engineering
A GA-based parameter design for single machine turning process with high-volume production

Computers and Industrial Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies the single machine scheduling problem for the objective of minimizing the expected number of tardy jobs. Jobs have normally distributed processing times and a common deterministic due date. We develop new approaches for this problem that generate near optimal solutions. The original stochastic problem is transformed into a non-linear integer programming model and its relaxations. Computational study validates their effectiveness by comparison with optimal solutions.