IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v81y1998i0p433-46610.1023-a1018929829086.html
   My bibliography  Save this article

Assignment and sequencing models for thescheduling of process systems

Author

Listed:
  • Jose Pinto
  • Ignacio Grossmann

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

Suggested Citation

  • Jose Pinto & Ignacio Grossmann, 1998. "Assignment and sequencing models for thescheduling of process systems," Annals of Operations Research, Springer, vol. 81(0), pages 433-466, June.
    • Handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:433-466:10.1023/a:1018929829086
    DOI: 10.1023/A:1018929829086
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018929829086
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018929829086?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Bhattacharya, Subir & Bose, Sumit Kumar, 2007. "Mathematical model for scheduling operations in cascaded continuous processing units," European Journal of Operational Research, Elsevier, vol. 182(1), pages 1-14, October.
    2. Monkman, Susan K. & Morrice, Douglas J. & Bard, Jonathan F., 2008. "A production scheduling heuristic for an electronics manufacturer with sequence-dependent setup costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1100-1114, June.
    3. Li, Nianqi & Klemeš, Jiří Jaromír & Sunden, Bengt & Wu, Zan & Wang, Qiuwang & Zeng, Min, 2022. "Heat exchanger network synthesis considering detailed thermal-hydraulic performance: Methods and perspectives," Renewable and Sustainable Energy Reviews, Elsevier, vol. 168(C).
    4. Casey Chung & Milind Dawande & Divakar Rajamani & Chelliah Sriskandarajah, 2011. "A Short-Range Scheduling Model for Blockbuster's Order-Processing Operation," Interfaces, INFORMS, vol. 41(5), pages 466-484, October.
    5. Sumit Bose & Subir Bhattacharya, 2008. "A two pass heuristic algorithm for scheduling ‘blocked out’ units in continuous process industry," Annals of Operations Research, Springer, vol. 159(1), pages 293-313, March.
    6. Lara, Cristiana L. & Koenemann, Jochen & Nie, Yisu & de Souza, Cid C., 2023. "Scalable timing-aware network design via lagrangian decomposition," European Journal of Operational Research, Elsevier, vol. 309(1), pages 152-169.
    7. Philip Doganis & Haralambos Sarimveis, 2008. "Optimal production scheduling for the dairy industry," Annals of Operations Research, Springer, vol. 159(1), pages 315-331, March.
    8. Christodoulos Floudas & Xiaoxia Lin, 2005. "Mixed Integer Linear Programming in Process Scheduling: Modeling, Algorithms, and Applications," Annals of Operations Research, Springer, vol. 139(1), pages 131-162, October.
    9. Yanina Fumero & Gabriela Corsano & Jorge Montagna, 2012. "Planning and scheduling of multistage multiproduct batch plants operating under production campaigns," Annals of Operations Research, Springer, vol. 199(1), pages 249-268, October.
    10. Shehadeh, Karmel S. & Cohn, Amy E.M. & Epelman, Marina A., 2019. "Analysis of models for the Stochastic Outpatient Procedure Scheduling Problem," European Journal of Operational Research, Elsevier, vol. 279(3), pages 721-731.
    11. Susan Heath & Jonathan Bard & Douglas Morrice, 2013. "A GRASP for simultaneously assigning and sequencing product families on flexible assembly lines," Annals of Operations Research, Springer, vol. 203(1), pages 295-323, March.
    12. Michael C. Ferris & Christos T. Maravelias & Arul Sundaramoorthy, 2009. "Simultaneous Batching and Scheduling Using Dynamic Decomposition on a Grid," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 398-410, August.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:433-466:10.1023/a:1018929829086. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.