Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Scheduling (production processes)
open-in-new
<h2 id="overview">Overview</h2> <p>Scheduling is the process of arranging, controlling and optimizing work and workloads in a production process. Companies use backward and forward scheduling to allocate plant and machinery resources, plan human resources, plan production processes and purchase materials. </p> <ul><li>Forward scheduling is planning the tasks from the date resources become available to determine the shipping date or the due date.</li> <li>Backward scheduling is planning the tasks from the due date or required-by date to determine the start date and/or any changes in capacity required.</li></ul> <p>The benefits of production scheduling include: </p> <ul><li>Process change-over reduction</li> <li>Inventory reduction, levelling</li> <li>Reduced scheduling effort</li> <li>Increased production efficiency</li> <li>Labour load levelling</li> <li>Accurate delivery date quotes</li> <li>Real time information</li> <li>Accurately measure utilized man/equipment hours</li></ul> <p>Production scheduling tools greatly outperform older manual scheduling methods. These provide the production scheduler with powerful graphical interfaces which can be used to visually optimize real-time work loads in various stages of production, and pattern recognition allows the software to <a href="/facts/Automated_planning_and_scheduling/VL1TcrmD">automatically create scheduling opportunities</a> which might not be apparent without this view into the data. For example, an airline might wish to minimize the number of airport gates required for its aircraft, in order to reduce costs, and scheduling software can allow the planners to see how this can be done, by analysing time tables, aircraft usage, or the flow of passengers. </p> <h2 id="key-concepts-in-scheduling">Key concepts in scheduling</h2> <p>A key character of scheduling is the productivity, the relation between quantity of inputs and quantity of output. Key concepts here are: </p> <ul><li>Inputs : Inputs are plant, labour, materials, tooling, energy and a clean environment.</li> <li>Outputs : Outputs are the products produced in factories either for other factories or for the end buyer. The extent to which any one product is produced within any one factory is governed by <a href="/facts/Transaction_cost/APnk8KdX">transaction cost</a>.</li> <li>Output within the factory : The output of any one work area within the factory is an input to the next work area in that factory according to the manufacturing process. For example, the output of cutting is an input to the bending room.</li> <li>Output for the next factory : By way of example, the output of a paper mill is an input to a print factory. The output of a petrochemicals plant is an input to an asphalt plant, a cosmetics factory and a plastics factory.</li> <li>Output for the end buyer : Factory output goes to the consumer via a service business such as a retailer or an asphalt paving company.</li> <li>Resource allocation : <a href="/facts/Resource_allocation/QmQWt2Yg">Resource allocation</a> is assigning inputs to produce output. The aim is to maximize output with given inputs or to minimize quantity of inputs to produce required output.</li></ul> <h2 id="scheduling-algorithms">Scheduling algorithms</h2> <p class="note">Main article: <a href="/facts/Job_shop_scheduling/1JjAvD3m">Job shop scheduling</a></p> <p class="note">See also: <a href="/facts/Genetic_algorithm_scheduling/pXlA7MkG">Genetic algorithm scheduling</a></p> <p>Production scheduling can take a significant amount of computing power if there are a large number of tasks. Therefore, a range of short-cut algorithms (<a href="/facts/Heuristics/BcBEkv9c">heuristics</a>) (a.k.a. <a href="/facts/Dispatching/hfgdxbcr">dispatching</a> rules) are used: </p> <ul><li>Stochastic Algorithms : <a href="/facts/Economic_Lot_Scheduling_Problem/cxWjsRas">Economic Lot Scheduling Problem</a> and <a href="/facts/Economic_production_quantity/S81pm10W">Economic production quantity</a></li> <li>Heuristic Algorithms : <a href="/facts/Modified_due_date_scheduling_heuristic/3o0PYKgB">Modified due date scheduling heuristic</a> and <a href="/facts/Shifting_bottleneck_heuristic/rCILaDp0">Shifting bottleneck heuristic</a></li></ul> <h2 id="batch-production-scheduling">Batch production scheduling</h2> <p><a href="/facts/Batch_production/cXFjDSl1">Batch production</a> scheduling is the practice of planning and scheduling of batch manufacturing processes. Although scheduling may apply to traditionally continuous processes such as refining,<a class="footnote-ref" id="fnref:1" href="#fn:1"><sup>1</sup></a><a class="footnote-ref" id="fnref:2" href="#fn:2"><sup>2</sup></a> it is especially important for batch processes such as those for pharmaceutical active ingredients, biotechnology processes and many specialty chemical processes.<a class="footnote-ref" id="fnref:3" href="#fn:3"><sup>3</sup></a><a class="footnote-ref" id="fnref:4" href="#fn:4"><sup>4</sup></a> Batch production scheduling shares some concepts and techniques with finite capacity scheduling which has been applied to many manufacturing problems.<a class="footnote-ref" id="fnref:5" href="#fn:5"><sup>5</sup></a> </p> <h2 id="see-also">See also</h2> <ul><li><a href="/facts/Advanced_planning_and_scheduling/rvYHldhG">Advanced planning and scheduling</a></li> <li><a href="/facts/Gantt_chart/HooQgCvs">Gantt chart</a></li> <li><a href="/facts/Kanban/B6FThvRJ">Kanban</a></li> <li><a href="/facts/Manufacturing_process_management/QcQHYDIT">Manufacturing process management</a></li> <li>Resource-Task Network</li> <li><a href="/facts/Single-machine_scheduling/d0jkcNrh">Single-machine scheduling</a></li> <li><a href="/facts/Schedule_(project_management)/h9nqwer4">Schedule (project management)</a></li> <li><a href="/facts/Scheduling_(computing)/XptmcM1a">Scheduling (computing)</a></li> <li><a href="/facts/Stochastic_scheduling/K3A2IeDC">Stochastic scheduling</a></li></ul> <h2 id="further-reading">Further reading</h2> <ul><li>Blazewicz, J., Ecker, K.H., Pesch, E., Schmidt, G. und J. Weglarz, Scheduling Computer and Manufacturing Processes, Berlin (Springer) 2001, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 3-540-41931-4</li> <li>Herrmann, Jeffrey W., editor, 2006, <i>Handbook of Production Scheduling,</i> Springer, New York.</li> <li>McKay, K.N., and Wiers, V.C.S., 2004, <i>Practical Production Control: a Survival Guide for Planners and Schedulers,</i> J. Ross Publishing, Boca Raton, Florida. Co-published with APICS.</li> <li>Pinedo, Michael L. 2005. <i>Planning and Scheduling in Manufacturing and Services,</i> Springer, New York.</li> <li><a href="/facts/Richard_W._Conway/rIPdBjkU">Conway, Richard W.</a>, <a href="/facts/William_L._Maxwell/TMo5WMSH">Maxwell, William L.</a>, Miller, Louis W., Theory of Scheduling, Dover Publications June 2003, <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-0486428178</li> <li><i>Brucker P.</i> <a href="https://link.springer.com/content/pdf/bfm%3A978-3-540-24804-0%2F1.pdf">Scheduling Algorithms</a>. Heidelberg, Springer. Fifth ed. <a href="/facts/ISBN_(identifier)/15AdSPa9">ISBN</a> 978-3-540-24804-0</li></ul> <h2 id="references">References</h2> <ol> <li id="fn:1"><p>Marcus V. Magalhaes and Nilay Shah, “Crude Oil Scheduling,” Foundations of Computer-Aided Operations (FOCAPO) 2003, pp 323-325. <a href="#fnref:1" class="footnote-back-ref">↩</a></p></li> <li id="fn:2"><p>Zhenya Jia and Marianthi Ierapetritou, “Efficient Short-Term Scheduling of Refinery Operation Based on a Continuous Time Formulation,” Foundations of Computer-Aided Operations (FOCAPO) 2003, pp 327-330 <a href="#fnref:2" class="footnote-back-ref">↩</a></p></li> <li id="fn:3"><p>Toumi, A., Jurgens, C., Jungo, C., MAier, B.A., Papavasileiou, V., and Petrides, D., “Design and Optimization of a Large Scale Biopharmaceutical Facility using Process Simulation and Scheduling Tools,” Pharmaceutical Engineering (the ISPE magazine) 2010, vol 30, no 2, pp 1-9. <a href="https://web.archive.org/web/20190803140950/https://pdfs.semanticscholar.org/c158/7827817381781d104c9ac2c67d565e5008f6.pdf" target="_blank">https://web.archive.org/web/20190803140950/https://pdfs.semanticscholar.org/c158/7827817381781d104c9ac2c67d565e5008f6.pdf</a> <a href="#fnref:3" class="footnote-back-ref">↩</a></p></li> <li id="fn:4"><p>Papavasileiou, V., Koulouris, A., Siletti, C., and Petrides, D., “Optimize Manufacturing of Pharmaceutical Products with Process Simulation and Production Scheduling Tools,” Chemical Engineering Research and Design (IChemE publication) 2007, vol 87, pp 1086-1097 <a href="https://www.researchgate.net/profile/Demetri_Petrides/publication/244387138_Optimize_Manufacturing_of_Pharmaceutical_Products_with_Process_Simulation_and_Production_Scheduling_Tools/links/59de7b1c0f7e9bcfab2405bf/Optimize-Manufacturing-of-Pharmaceutical-Products-with-Process-Simulation-and-Production-Scheduling-Tools.pdf" target="_blank">https://www.researchgate.net/profile/Demetri_Petrides/publication/244387138_Optimize_Manufacturing_of_Pharmaceutical_Products_with_Process_Simulation_and_Production_Scheduling_Tools/links/59de7b1c0f7e9bcfab2405bf/Optimize-Manufacturing-of-Pharmaceutical-Products-with-Process-Simulation-and-Production-Scheduling-Tools.pdf</a> <a href="#fnref:4" class="footnote-back-ref">↩</a></p></li> <li id="fn:5"><p>Michael Pinedo, Scheduling Theory, Algorithms, and Systems, Prentice Hall, 2002, pp 1-6. <a href="#fnref:5" class="footnote-back-ref">↩</a></p></li> </ol>