Ready-Time Scheduling with Stochastic Service Times | Zendy

Thom J. Hodgson | Zendy; Russell E. King | Zendy; Paul Stanfield | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Ready-Time Scheduling with Stochastic Service Times

Author(s) -

Thom J. Hodgson,

Russell E. King,

Paul Stanfield

Publication year - 1997

Publication title -

operations research

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.797

H-Index - 140

eISSN - 1526-5463

pISSN - 0030-364X

DOI - 10.1287/opre.45.5.779

Subject(s) - computer science , scheduling (production processes) , mathematical optimization , flow shop scheduling , operations research , sequence (biology) , job shop scheduling , production (economics) , job shop , due date , mathematics , schedule , economics , macroeconomics , biology , genetics , operating system

A frequently encountered scheduling problem is to determine simultaneously a material and job ready time and production sequence based on customer-specified due dates. Each job has a stochastic production time and a deterministic due date. The ready time is constrained in that the probability that each job will be complete by its due date must meet some minimum level of confidence. The objective in such an instance is to postpone the ready time as late as possible without violating these constraints. The steps and effort necessary to determine the maximum ready time and optimal production sequence, and cases in which this effort may be significantly reduced are presented. The resulting model is applied directly to single-facility and flow-shop production environments. Methods are shown for scheduling in a dynamic environment.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research