Optimal sequences in stochastic single machine shops

https://doi.org/10.1016/0305-0548(95)00069-0Get rights and content

Abstract

This article addresses the problem of sequencing a given set of jobs with random processing times for uninterrupted processing on a single machine. The objective is to identify the “optimal” sequence which minimizes the expected value of a “scheduler's” disutility (or cost) function with respect to a performance measure. The general problem is difficult to solve; however, special cases can be modeled and solved exactly when (1) processing times are statistically independent, (2) disutility functions for sequence evaluation are linear, exponential, or quadratic, and (3) performance measures are mean flow time, mean waiting time, or mean lateness. Illustrative examples demonstrate that the proposed models create sequences which are (a) influenced by both schedulers' risk taking behavior and the stochasticity of processing times, and (b) more “realistic” than those provided by the classical single machine models. This paper also extends the developed models to include multi-dimensional deterministic single machine problems.

References (63)

  • H.D. Sherali et al.

    A flexible, polynomial-time, construction and improvement heuristic for the quadratic assignment problem

    Computers Ops Res.

    (1986)
  • C.L. Huntley et al.

    A parallel heuristic for quadratic assignment problems

    Computers Ops Res.

    (1991)
  • J.W.M. Bertrand

    The use of workload information to control job lateness in controlled and uncontrolled release production systems

    J. Ops Mgmt

    (1983)
  • K.R. Baker

    Introduction to Sequencing and Scheduling

    (1974)
  • R.W. Conway et al.

    Theory of Scheduling

    (1967)
  • K.R. Baker et al.

    Sequencing with earliness and tardiness penalties: a review

    Ops Res.

    (1990)
  • U. Bagchi et al.

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

    Mgt Sci.

    (1987)
  • P. De et al.

    A note on the minimization of mean squared deviation of completion times about a common due date

    Mgt Sci.

    (1989)
  • W. Townsend

    The single machine problem with quadratic penalty function of completion times: a branch-and-bound solution

    Mgt Sci.

    (1978)
  • V. Vani et al.

    Deterministic and random single machine sequencing with variance minimization

    Op Res.

    (1987)
  • D.J. Hoitomt et al.

    A practical approach to job-shop scheduling problems

    IEEE Trans Robotics Automation

    (1993)
  • H. Emmons

    One machine sequencing to minimize certain functions of job tardiness

    Ops Res.

    (1969)
  • P.B. Henderson et al.

    A problem in single-machine sequencing with nonlinear delay costs

    Mgmt Sci.

    (1976)
  • M. Raghavachari

    Schedulng problems with nonlinear penalty functions—a review

    Ops Res.

    (1988)
  • A.H.G. Rinnooy Kan et al.

    Minimizing total costs in one-machine scheduling

    Ops Res.

    (1975)
  • R.R. Weber et al.

    Scheduling jobs with stochastically ordered processing times on parallel machines to minimize flow time

    J. Appl. Probability

    (1986)
  • K.N. McKay et al.

    Job-shop scheduling theory: what is relevant?

    Interfaces

    (1988)
  • S.G. Taylor et al.

    Process flow scheduling principles

    Production Inventory Mgmt J.

    (1991)
  • S.E. Fawcett et al.

    Understanding and applying constraint management in today's manufacturing environments

    Production Inventory Mgmt J.

    (1991)
  • M.M. Umble et al.

    Synchronous Manufacturing

    (1990)
  • M.L. Pinedo

    Stochastic scheduling with release and due dates

    Op Res.

    (1983)
  • Cited by (7)

    View all citing articles on Scopus

    H. M. Soroush is on the faculty of Operations Research and Statistics at the College of Science, Kuwait University. He received a B.S. degree in Economic Management from Karaj College of Mathematics and Economic Management, Iran, a M.S. in Operations Research from George Washington University, and a M.S. and a Ph.D. in Operations Research and Statistics from Rensselaer Polytechnic Institute. Dr Soroush's research interests include modeling and optimization of stochastic processes and networks, production scheduling, project management and transportation and decision analyses. He has published papers in Computers and Operations Research, Transportation Science, Networks, European Journal of Operational Research and Journal of Operational Research Society.

    View full text