Multi-objective stochastic scheduling of job ready times
Paul Stanfield,
Russell King and
Thom Hodgson
Annals of Operations Research, 1997, vol. 70, issue 0, 239 pages
Abstract:
A fundamental scheduling problem is to determine a production start (ready) time based on customer-specified due dates. Typically, the objective is to delay the ready time in an attempt to minimize work-in-process inventory and maximize production system utilization. In many practical situations, highly variable service times complicate this problem. In such a case, the ready time implies a level of on-time completion confidence for each job. As the ready time increases, the on-time confidence decreases. This paper investigates the ready time/job confidence level tradeoff. A multi-objective model balances the ready time and confidence level maximization goals. The model involves combinatorial and numerical optimization and has an exceptionally complex state space. In view of these complexities, we investigate a pairwise interchange heuristic and a genetic algorithm search solution. Experimental results support solution through a process involving both the heuristic and the genetic algorithm. Copyright Kluwer Academic Publishers 1997
Date: 1997
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018974221508 (text/html)
Access to full text is restricted to subscribers.
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:spr:annopr:v:70:y:1997:i:0:p:221-239:10.1023/a:1018974221508
Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479
DOI: 10.1023/A:1018974221508
Access Statistics for this article
Annals of Operations Research is currently edited by Endre Boros
More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().