Jeffrey Dean Kelly

Learn More
It is well-known that production scheduling can be largely categorized into open and closed-shops (Graves (1981)). Open-shops are job-shops, flow-shops, machine-shops and project-shops and deal exclusively with the assignment, sequencing and timing decisions (Pinedo (1995)). Closed-shops on the other hand also deal with the same three decision-groups as(More)
This article describes an effective and simple primal heuristic to greedily encourage a reduction in the number of binary or 0-1 logic variables before an implicit enumerative-type search heuristic is deployed to find integer-feasible solutions to " hard " production scheduling problems. The basis of the technique is to employ well-known smoothing functions(More)
Nonlinear planning and scheduling models for crude-oil atmospheric and vacuum distillation units are essential to manage increased complexities and narrow margins present in the petroleum industry. Traditionally, conventional swing-cut modeling is based on fixed yields with fixed properties for the hypothetical cuts that swing between adjacent light and(More)
The purpose of this article is to express a novel stewardship procedure to aid in the detection and identification of production execution and process instrumentation problems. The technique bridges the gap between well-known data reconciliation and production scheduling by formulating both quantity and timing constraints into two reconciliation problems to(More)