Assignment and sequencing models for thescheduling of process systems

Jose Pinto and Ignacio Grossmann

Annals of Operations Research, 1998, vol. 81, issue 0, 433-466

Abstract: This paper presents an overview of assignment and sequencing models that are used inthe scheduling of process operations with mathematical programming techniques. Althoughscheduling models are problem specific, there are common features which translate intosimilar types of constraints. Two major categories of scheduling models are identified:single-unit assignment models in which the assignment of tasks to units is known a priori,and multiple-unit assignment models in which several machines compete for the processingof products. The most critical modeling issues are the time domain representation and networkstructure of the processing plant. Furthermore, a summary of the major features of thescheduling model is presented along with computational experience, as well as a discussionon their strengths and limitations. Copyright Kluwer Academic Publishers 1998

Date: 1998
References: Add references at CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1018929829086 (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:81:y:1998:i:0:p:433-466:10.1023/a:1018929829086

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1023/A:1018929829086

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 ().