Abstract
Short-term scheduling of a multi-stage factory consisting of many parallel and competing resources is a problem encountered in many process industries, such as the fast-moving consumer goods’, pharmaceutical, food and cosmetics’ industries. In such factories, there can be from 2 to 15 packing lines, which can pack one or more formats (sizes). There are several intermediate storage resources as well as several making units. Some packing lines are dedicated to packing different formats of one product, while others can pack different products in different formats. A combination size/product is called Stock Holding Units (SKU). Packing rates depend on both SKU and line. Although it will be assumed throughout that a line packs at its constant nominal rate once started for a SKU, start-up rates are generally slower and a line may take significant time to reach full efficiency. The making units are batch or continuous processing units with finite rates/ capacities. The storage resources store intermediate and finished products. These resources may be dedicated, semi-dedicated or flexible in nature.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Driscoll, W. and H. Emmons (1977) ‘Scheduling Production on One Machine with Changeover Costs’, AIIE Transactions, 9, 388–95.
Geoffrion, A.M. and G.M. Graves (1976) ‘Scheduling Parallel Production Lines with Changeover Considerations’, Operations Research, 24, 595–610.
Glassey, C.R. (1968) ‘Minimum Changeover Scheduling on One Machine’, Operations Research, 16, 343–53.
Gooding, W.B., J.F. Pekny and P.S. McCroskey (1994) ‘Enumerative Approaches to Parallel Fellowship Scheduling via Problem Transformations’, Computers and Chemical Engineering, 18, 909–27.
Kondili, E., C.C. Pantelides and R.W.H. Sargent (1993) A General Algorithm for Short term Scheduling of Batch Operations - I.MILP Formulation’, Computer and Chemical Engineering, 17, 211–28.
Love, R.R., Jr and R.R. Vegumanti (1978) ‘The Single Plant Old Allocation Problem with Capacity and Changeover Restrictions’, Operations Research, 26, 156–65.
Moore, J. (1975) An Algorithm for a Single-machine Scheduling Problem with Sequence Dependent Setup Times and Scheduling Windows’, A HE Transactions, 1, 35–41.
Musier, R.F.H. and L.B. Evans (1989) An Approximate Method for Production Scheduling of Industrial Batch Processes with Parallel Units,’ Computers and Chemical Engineering, 13, 229–38.
Parker, R.G., R.H. Deane and R.A. Holmes (1977) ‘On the Use of a Vehicle Routing Algorithm for the Parallel Processor Problem with Sequence Dependent Changeover Costs’, AIIE Transactions, 9, 155–60.
Pinto, J.M. and I.E. Grossmann (1995) A Continuous Time Mixed Integer Linear Programming Model for Short Term Scheduling of Multistage Batch Plant’, Industrial Engineering Chemistry Research, 34, 3037–51.
Pinto, J.M. and I.E. Grossmann (1996) A Continuous Time MILP Model for Short Term Scheduling of Batch Plants with Pre-ordering Constraints’, Computers and Chemical Engineering, 29, SI 197—S1202.
Prabhakhar, T. (1974) A Production Scheduling Problem with Sequencing Considerations’, Management Science, 21, 34–43.
Reklaitis, G.V. (1991) ‘Perspective on Scheduling and Planning of Process Operation’, Proceedings of the Fourth International Symposium on Process Systems Engineering, Montreal.
Reklaitis, G.V. and L. Mockus (1995) ‘Mathematical Programming Formulation for Scheduling of Batch Operations on Non-uniform Time Discretisation’, Acta Quimica Slovenica, 42, 81–6.
Robert, L., Jr. (1976) ‘Sequencing with Setup Costs by Zero–one Mixed Integer Linear Programming’, AIIE Transaction, 8, 369–71.
Sahinidis, N.V. and I.E. Grossmann (1991) ‘MINLP Model for Cyclic Multipurpose Scheduling on Continuos Parallel Lines’, Computers and Chemical Engineering, 15, 85–103.
Schilling, G. and CCA. Pantelides (1996) ‘Simple Continuos Time Process Scheduling Formulation and a Novel Solution Algorithm’, Computers and Chemical Engineering, 20,S-B, SI221-SI226.
oudoris, T.V. and I.E. Grossmann (1993) ‘Optimal Synthesis of Multiproduct Batch Plants with Cyclic Scheduling and Inventory Consideration’, Industrial Engineering Chemistry Research, 32, 1962–80.
Zentner, M.G. and G.V. Reklaitis (1992) An Interval-based Mathematical Model for the Scheduling of Resource-Constrained Batch Chemical Processes’,Proceedings of NATO. A SI on Batch Processing Systems Engineering, Antalya.
Zhang, X. and R.W.H. Sargent (1994) ‘The Optimal Operations of Mixed Production Facilities - A General Formulation and Some Solution Approaches for the Solution’, Proceedings of the 5th International Symposium on Process Systems Engineering, Kyongju, 171–7.
Editor information
Editors and Affiliations
Copyright information
© 1999 Turaj Tahmassebi
About this chapter
Cite this chapter
Tahmassebi, T. (1999). A Continuous-time Representation for Multi-stage Factory Design and Scheduling. In: Ciriani, T.A., Gliozzi, S., Johnson, E.L., Tadei, R. (eds) Operational Research in Industry. Palgrave Macmillan, London. https://doi.org/10.1057/9780230372924_6
Download citation
DOI: https://doi.org/10.1057/9780230372924_6
Publisher Name: Palgrave Macmillan, London
Print ISBN: 978-1-349-41051-4
Online ISBN: 978-0-230-37292-4
eBook Packages: Palgrave Business & Management CollectionBusiness and Management (R0)