IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v30y2000i6p64-76.html
   My bibliography  Save this article

Production Scheduling Theory: Just Where Is It Applicable?

Author

Listed:
  • Victor Portougal

    (Department of Management Science and Information Systems, The University of Auckland, Private Bag 92019, Auckland, New Zealand)

  • David J. Robb

    (Department of Management Science and Information Systems, The University of Auckland)

Abstract

A proliferation of scheduling research has done little to improve production planning practice, despite calls for more comprehensive models. Using a four-factor classification of planning environments (planning level, production type, production strategy, and production cycle time) we show scheduling theory is relevant in few settings. For example, in increasingly common short-cycle environments, where production cycle times are shorter than the planning period, the order in which one processes jobs is seldom important. Moreover, even in long-cycle environments, capacity is seldom fixed, with managers often negotiating for enough capacity to make scheduling fairly easy. Based on extensive consulting experience in Australasia, we call for caution in applying scheduling theory. While complex models are pertinent in some cases, more benefit often arises from establishing appropriate performance measures, planning periods, capacity negotiation processes, and uncertainty reduction measures.

Suggested Citation

  • Victor Portougal & David J. Robb, 2000. "Production Scheduling Theory: Just Where Is It Applicable?," Interfaces, INFORMS, vol. 30(6), pages 64-76, December.
  • Handle: RePEc:inm:orinte:v:30:y:2000:i:6:p:64-76
    DOI: 10.1287/inte.30.6.64.11623
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.30.6.64.11623
    Download Restriction: no

    File URL: https://libkey.io/10.1287/inte.30.6.64.11623?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
    ---><---

    References listed on IDEAS

    as
    1. Sen, Tapan & Gupta, Sushil K, 1984. "A state-of-art survey of static scheduling research involving due dates," Omega, Elsevier, vol. 12(1), pages 63-76.
    2. Stephen C. Graves, 1981. "A Review of Production Scheduling," Operations Research, INFORMS, vol. 29(4), pages 646-675, August.
    3. Kenneth R. Baker & Gary D. Scudder, 1990. "Sequencing with Earliness and Tardiness Penalties: A Review," Operations Research, INFORMS, vol. 38(1), pages 22-36, February.
    4. Kenneth N. McKay & Frank R. Safayeni & John A. Buzacott, 1988. "Job-Shop Scheduling Theory: What Is Relevant?," Interfaces, INFORMS, vol. 18(4), pages 84-90, August.
    5. R. A. Dudek & S. S. Panwalkar & M. L. Smith, 1992. "The Lessons of Flowshop Scheduling Research," Operations Research, INFORMS, vol. 40(1), pages 7-13, February.
    6. Cheng, T. C. E. & Gupta, M. C., 1989. "Survey of scheduling research involving due date determination decisions," European Journal of Operational Research, Elsevier, vol. 38(2), pages 156-166, January.
    7. Buxey, Geoff, 1989. "Production scheduling: Practice and theory," European Journal of Operational Research, Elsevier, vol. 39(1), pages 17-31, March.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Khalil Tliba & Thierno M. L. Diallo & Olivia Penas & Romdhane Ben Khalifa & Noureddine Ben Yahia & Jean-Yves Choley, 2023. "Digital twin-driven dynamic scheduling of a hybrid flow shop," Journal of Intelligent Manufacturing, Springer, vol. 34(5), pages 2281-2306, June.
    2. Seokcheol Chang & Jaewoo Chung, 2013. "Optimization Models for Production Planning in LG Display," Interfaces, INFORMS, vol. 43(6), pages 518-529, December.
    3. Agnetis, Alessandro & Bianciardi, Caterina & Iasparra, Nicola, 2019. "Integrating lean thinking and mathematical optimization: A case study in appointment scheduling of hematological treatments," Operations Research Perspectives, Elsevier, vol. 6(C).
    4. Jiawen Hu & Zuhua Jiang & Hong Wang, 2017. "Joint Optimization of Production Plan and Preventive Maintenance Schedule by Stackelberg Game," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 34(04), pages 1-28, August.
    5. Singer, Marcos & Donoso, Patricio, 2008. "Empirical validation of an activity-based optimization system," International Journal of Production Economics, Elsevier, vol. 113(1), pages 335-345, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Soroush, H. M., 1999. "Sequencing and due-date determination in the stochastic single machine problem with earliness and tardiness costs," European Journal of Operational Research, Elsevier, vol. 113(2), pages 450-468, March.
    2. Ilkyeong Moon & Sanghyup Lee & Moonsoo Shin & Kwangyeol Ryu, 2016. "Evolutionary resource assignment for workload-based production scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 375-388, April.
    3. Framinan, Jose M. & Ruiz, Rubén, 2010. "Architecture of manufacturing scheduling systems: Literature review and an integrated proposal," European Journal of Operational Research, Elsevier, vol. 205(2), pages 237-246, September.
    4. Adamopoulos, G. I. & Pappis, C. P., 1996. "Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method," European Journal of Operational Research, Elsevier, vol. 88(2), pages 336-344, January.
    5. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    6. Wiers, V. C. S., 1997. "A review of the applicability of OR and AI scheduling techniques in practice," Omega, Elsevier, vol. 25(2), pages 145-153, April.
    7. Adamopoulos, G. I. & Pappis, C. P., 1995. "The CON due-date determination method with processing time-dependent lateness penalties," International Journal of Production Economics, Elsevier, vol. 40(1), pages 29-36, June.
    8. Ruiz, Ruben & Maroto, Concepcion, 2006. "A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility," European Journal of Operational Research, Elsevier, vol. 169(3), pages 781-800, March.
    9. Shabtay, Dvir & Steiner, George & Zhang, Rui, 2016. "Optimal coordination of resource allocation, due date assignment and scheduling decisions," Omega, Elsevier, vol. 65(C), pages 41-54.
    10. Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1994. "Due‐date assignment and early/tardy scheduling on identical parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(1), pages 17-32, February.
    11. X. Cai & F. S. Tu, 1996. "Scheduling jobs with random processing times on a single machine subject to stochastic breakdowns to minimize early‐tardy penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(8), pages 1127-1146, December.
    12. P J Kalczynski & J Kamburowski, 2004. "Generalization of Johnson's and Talwar's scheduling rules in two-machine stochastic flow shops," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(12), pages 1358-1362, December.
    13. Kolahan, F. & Liang, M., 1998. "An adaptive TS approach to JIT sequencing with variable processing times and sequence-dependent setups," European Journal of Operational Research, Elsevier, vol. 109(1), pages 142-159, August.
    14. Cai, X. & Lum, V. Y. S. & Chan, J. M. T., 1997. "Scheduling about a common due date with kob-dependent asymmetric earliness and tardiness penalties," European Journal of Operational Research, Elsevier, vol. 98(1), pages 154-168, April.
    15. Li, Shisheng & Ng, C.T. & Yuan, Jinjiang, 2011. "Group scheduling and due date assignment on a single machine," International Journal of Production Economics, Elsevier, vol. 130(2), pages 230-235, April.
    16. Xia, Yu & Chen, Bintong & Yue, Jinfeng, 2008. "Job sequencing and due date assignment in a single machine shop with uncertain processing times," European Journal of Operational Research, Elsevier, vol. 184(1), pages 63-75, January.
    17. Koltai, Tamás, 2009. "Robustness of a production schedule to inventory cost calculations," International Journal of Production Economics, Elsevier, vol. 121(2), pages 494-504, October.
    18. Awi Federgruen & Gur Mosheiov, 1993. "Simultaneous optimization of efficiency and performance balance measures in single‐machine scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(7), pages 951-970, December.
    19. Bernard Dickman & Yonah Wilamowsky & Sheldon Epstein, 2001. "Multiple common due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(4), pages 293-298, June.
    20. Zhi-Long Chen, 1997. "Scheduling with batch setup times and earliness-tardiness penalties," European Journal of Operational Research, Elsevier, vol. 96(3), pages 518-537, February.

    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:inm:orinte:v:30:y:2000:i:6:p:64-76. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.