Ready-Time Scheduling with Stochastic Service Times
Thom J. Hodgson,
Russell E. King and
Paul M. Stanfield
Additional contact information
Thom J. Hodgson: North Carolina State University, Raleigh, North Carolina
Russell E. King: North Carolina State University, Raleigh, North Carolina
Paul M. Stanfield: North Carolina State University, Raleigh, North Carolina
Operations Research, 1997, vol. 45, issue 5, 779-783
Abstract:
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.
Keywords: production/scheduling; stochastic sequencing probabilities; scheduling facilities with stochastic service; probability; stochastic models; service time data probabilistically distributed; networks; stochastic; shop modeled as stochastic networks (search for similar items in EconPapers)
Date: 1997
References: Add references at CitEc
Citations: View citations in EconPapers (5)
Downloads: (external link)
http://dx.doi.org/10.1287/opre.45.5.779 (application/pdf)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:45:y:1997:i:5:p:779-783
Access Statistics for this article
More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().