Skip to main content
SpringerLink
Log in

Assignment and sequencing models for thescheduling of process systems

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. K.R. Baker, Introduction to Sequencing and Scheduling, Wiley, New York, 1974.

    Google Scholar 

  2. A.P. Barbosa-Póvoa, Detailed design and retrofit of multipurpose batch plants, Ph.D. Thesis, University of London, London, 1994.

    Google Scholar 

  3. D.B. Birewar and I.E. Grossmann, Incorporating scheduling in the optimal design of multiproduct batch plants, Computers Chem. Eng. 13(1989)141–161.

    Article  Google Scholar 

  4. D.B. Birewar and I.E. Grossmann, Efficient optimization algorithms for zero-wait scheduling of multiproduct plants, I&EC Research 28(1989)1333–1345.

    Google Scholar 

  5. J. Cerdá, G. Henning and I.E. Grossmann, A mixed-integer linear programming model for short term batch scheduling in parallel lines, presented at the ORSA/TIMS Meeting–Global Manufacturing in the 21st Century, Detroit, MI, 1994.

  6. C.A. Crooks, Synthesis of operating procedures for chemical plants, Ph.D. thesis, University of London, London, 1992.

    Google Scholar 

  7. S. French, Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop, Ellis Horwood, England, 1982.

    Google Scholar 

  8. W.B. Gooding, J.F. Pekny and P.S. McCroskey, Enumerative approaches to parallel flowshop scheduling via problem transformation, Computers Chem. Eng. 18(1994)909–927.

    Article  Google Scholar 

  9. I.E. Grossmann, J. Quesada, R. Raman and V. Voudouris, Mixed integer optimization techniques for the design and scheduling of batch processes, in: Batch Processing Systems Engineering, eds. G.V. Reklaitis, A.K. Sunol, D.W.T. Rippin and O. Hortacsu, Springer, Berlin, 1996, pp. 451–494.

    Google Scholar 

  10. J.N.D. Gupta, Optimal flowshop schedules with no intermediate storage space, Nav. Res. Logist. Quart. 23(1976)235–243.

    Google Scholar 

  11. E. Kondili, C.C. Pantelides and R.W.H. Sargent, A general algorithm for short-term scheduling of batch operations. I. MILP formulation, Computers Chem. Eng. 17(1993)211–227.

    Article  Google Scholar 

  12. H. Ku, D. Rajagopalan and I.A. Karimi, Scheduling in batch processes, Chem. Eng. Prog. 83 (1987)35–45.

    Google Scholar 

  13. C.C. Pantelides, Unified frameworks for optimal process planning and scheduling, in: Foundations of Computer Aided Process Operations, eds. D.W.T. Rippin, J.C. Hale and J.F. Davis, CACHE, Austin, TX, 1994, pp. 253–274.

    Google Scholar 

  14. J.F. Pekny and D.L. Miller, Exact solution of the no-wait flowshop scheduling problem with a comparison to heuristic methods, Computers Chem. Eng. 15(1991)741–748.

    Article  Google Scholar 

  15. J.F. Pekny and M.G. Zentner, Learning to solve process scheduling problems: The role of rigorous knowledge acquisition frameworks, in: Foundations of Computer Aided Process Operations, eds. D.W.T. Rippin, J.C. Hale and J.F. Davis, CACHE, Austin, TX, 1994, pp. 275–309.

    Google Scholar 

  16. J.M. Pinto and I.E. Grossmann, Optimal cyclic scheduling of multistage continuous multiproduct plants, Computers Chem. Eng. 18(1994)797–816.

    Article  Google Scholar 

  17. J.M. Pinto and I.E. Grossmann, A continuous time mixed-integer linear programming model for short term scheduling of multistage batch plants, I&EC Research 34(1995)3037–3051.

    Google Scholar 

  18. J. Pinto and I.E. Grossmann, An alternate MILP model for short term batch scheduling with preordering constraints, Ind. Eng. Chem. Research 35(1996)338–342.

    Article  Google Scholar 

  19. G.V. Reklaitis, Perspectives on scheduling and planning of process operations, presented at the 4th International Symposium on Process Systems Engineering, Montebello, Canada, 1991.

  20. G.V. Reklaitis, Overview of scheduling and planning of batch process operations, NATO Advanced Study Institute–Batch Process Systems Engineering, Antalya, Turkey, 1992.

  21. S.H. Rich and G.J. Prokopakis, Scheduling and sequencing of batch operations in a multipurpose plant, Ind. Eng. Chem. Process Des. Dev. 25(1986)979–988.

    Article  Google Scholar 

  22. D.W.T. Rippin, Batch process systems engineering: a retrospective and prospective review, Computers Chem. Eng. 17 (suppl. issue)1993, S1–S13.

    Article  Google Scholar 

  23. N.V. Sahinidis and I.E. Grossmann, MINLP model for cyclic multiproduct scheduling on continuous parallel lines, Computers Chem. Eng. 15(1991)85–103.

    Article  Google Scholar 

  24. N.V. Sahinidis and I.E. Grossmann, Reformulation of multiperiod MILP models for planning and scheduling of chemical processes, Computers Chem. Eng. 15(1991)255–272.

    Article  Google Scholar 

  25. G. Schilling, Y.-E. Pineau, C.C. Pantelides and N. Shah, Optimal scheduling of multipurpose continuous plants, presented at the AIChE National Meeting, San Francisco, CA, 1994.

  26. N. Shah, Efficient scheduling, planning and design of multipurpose batch plants, Ph.D. Thesis, University of London, London, 1992.

    Google Scholar 

  27. N. Shah, C.C. Pantelides and R.W.H. Sargent, A general algorithm for short-term scheduling of batch operations. II. Computational issues, Computers Chem. Eng. 17(1993)229–244.

    Article  Google Scholar 

  28. N. Shah, C.C. Pantelides and R.W.H. Sargent, Optimal periodic scheduling of multipurpose batch plants, Ann. Oper. Res. 42(1993)193–228.

    Article  Google Scholar 

  29. V.T. Voudouris and I.E. Grossmann, Optimal synthesis of multiproduct batch plants with cyclic scheduling and inventory considerations, Ind. Eng. Chem. Res. 32(1993)1962 –1980.

    Article  Google Scholar 

  30. V.T. Voudouris and I.E. Grossmann, An MILP model for the optimal design and scheduling of a special class of multipurpose plants, Computers Chem. Eng. 20(1996)1335–1360.

    Article  Google Scholar 

  31. S.J. Wilkinson, N. Shah and C.C. Pantelides, Scheduling of multisite flexible production systems, paper presented at the AIChE Annual Meeting, San Francisco, CA, 1994.

  32. P. Williams, Model Building in Mathematical Programming, 2nd ed., Wiley, Chichester, Northern Ireland, 1985.

    Google Scholar 

  33. Z. Xueya and R.W.H. Sargent, The optimal operation of mixed production facilities–a general formulation and some approaches to the solution, Proceedings of the 5th Symposium on Process Systems Engineering, Kyongju, Korea, 1994.

  34. Z. Xueya, Algorithms for optimal process scheduling using nonlinear models, Ph.D. Thesis, University of London, London, 1995.

    Google Scholar 

Download references

Authors
  1. Jose M. Pinto
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ignacio E. Grossmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pinto, J.M., Grossmann, I.E. Assignment and sequencing models for thescheduling of process systems. Annals of Operations Research 81, 433–466 (1998). https://doi.org/10.1023/A:1018929829086

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1018929829086

Keywords

Search

Navigation