IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v57y2006i1d10.1057_palgrave.jors.2601966.html
   My bibliography  Save this article

Bootstrapping to solve the limited data problem in production control: an application in batch process industries

Author

Listed:
  • V C Ivănescu

    (Technische Universiteit Eindhoven)

  • J W M Bertrand

    (Technische Universiteit Eindhoven)

  • J C Fransoo

    (Technische Universiteit Eindhoven)

  • J P C Kleijnen

    (Tilburg University)

Abstract

Batch process industries are characterized by complex precedence relationships among operations, which makes the estimation of an acceptable workload very difficult. Previous research indicated that a regression-based model that uses aggregate job set characteristics may be used to support order acceptance decisions. Applications of such models in real-life assume that sufficient historical data on job sets and the corresponding makespans are available. In practice, however, historical data maybe very limited and may not be sufficient to produce accurate regression estimates. This paper shows that such a lack of data significantly impacts the performance of regression-based order acceptance procedures. To resolve this problem, we devised a method that uses the bootstrap principle. A simulation study shows that performance improvements are obtained when using the parameters estimated from the bootstrapped data set, demonstrating that this bootstrapping procedure can indeed solve the limited data problem in production control.

Suggested Citation

  • V C Ivănescu & J W M Bertrand & J C Fransoo & J P C Kleijnen, 2006. "Bootstrapping to solve the limited data problem in production control: an application in batch process industries," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 2-9, January.
    • Handle: RePEc:pal:jorsoc:v:57:y:2006:i:1:d:10.1057_palgrave.jors.2601966
    DOI: 10.1057/palgrave.jors.2601966
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601966
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601966?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.

    References listed on IDEAS

    as
    1. Raaymakers, W. H. M. & Hoogeveen, J. A., 2000. "Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing," European Journal of Operational Research, Elsevier, vol. 126(1), pages 131-151, October.
    2. Carlier, Jacques, 1987. "Scheduling jobs with release dates and tails on identical machines to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 29(3), pages 298-306, June.
    3. Michael S. Lane & Ali H. Mansour & John L. Harpell, 1993. "Operations Research Techniques: A Longitudinal Update 1973–1988," Interfaces, INFORMS, vol. 23(2), pages 63-68, April.
    4. 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.
    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. Alessandro Agnetis & Alberto Coppi & Matteo Corsini & Gabriella Dellino & Carlo Meloni & Marco Pranzo, 2014. "A decomposition approach for the combined master surgical schedule and surgical case assignment problems," Health Care Management Science, Springer, vol. 17(1), pages 49-59, March.
    2. Kleijnen, J.P.C., 2007. "Simulation Experiments in Practice : Statistical Design and Regression Analysis," Discussion Paper 2007-09, Tilburg University, Center for Economic Research.
    3. Kleijnen, J.P.C., 2006. "White Noise Assumptions Revisited : Regression Models and Statistical Designs for Simulation Practice," Discussion Paper 2006-50, Tilburg University, Center for Economic Research.
    4. M I Reis dos Santos & P M Reis dos Santos, 2011. "Construction and validation of distribution-based regression simulation metamodels," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(7), pages 1376-1384, July.
    5. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    6. Kleijnen, J.P.C., 2006. "Generalized Response Surface Methodology : A New Metaheuristic," Discussion Paper 2006-77, Tilburg University, Center for Economic Research.

    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. Raaymakers, W. H. M. & Weijters, A. J. M. M., 2003. "Makespan estimation in batch process industries: A comparison between regression analysis and neural networks," European Journal of Operational Research, Elsevier, vol. 145(1), pages 14-30, February.
    2. Raaymakers, Wenny H. M. & Fransoo, Jan C., 2000. "Identification of aggregate resource and job set characteristics for predicting job set makespan in batch process industries," International Journal of Production Economics, Elsevier, vol. 68(2), pages 137-149, November.
    3. Groflin, Heinz & Klinkert, Andreas, 2007. "Feasible insertions in job shop scheduling, short cycles and stable sets," European Journal of Operational Research, Elsevier, vol. 177(2), pages 763-785, March.
    4. Zhenying Zhao & Michael Ball & Masahiro Kotake, 2005. "Optimization-Based Available-To-Promise with Multi-Stage Resource Availability," Annals of Operations Research, Springer, vol. 135(1), pages 65-85, March.
    5. Corti, Donatella & Pozzetti, Alessandro & Zorzini, Marta, 2006. "A capacity-driven approach to establish reliable due dates in a MTO environment," International Journal of Production Economics, Elsevier, vol. 104(2), pages 536-554, December.
    6. 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.
    7. 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.
    8. Sarper, H. & Henry, M. C., 1996. "Combinatorial evaluation of six dispatching rules in a dynamic two-machine flow shop," Omega, Elsevier, vol. 24(1), pages 73-81, February.
    9. Nekoiemehr, Nooshin & Zhang, Guoqing & Selvarajah, Esaignani, 2019. "Due date quotation in a dual-channel supply chain," International Journal of Production Economics, Elsevier, vol. 215(C), pages 102-111.
    10. Philip Kaminsky & Onur Kaya, 2008. "Scheduling and due‐date quotation in a make‐to‐order supply chain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(5), pages 444-458, August.
    11. Carlier, J. & Pinson, E. & Sahli, A. & Jouglet, A., 2020. "An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 468-476.
    12. Mukherjee, Saral & Chatterjee, A.K., 2006. "The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price," European Journal of Operational Research, Elsevier, vol. 169(1), pages 53-64, February.
    13. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    14. Vineet Jain & Tilak Raj, 2018. "An adaptive neuro-fuzzy inference system for makespan estimation of flexible manufacturing system assembly shop: a case study," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 9(6), pages 1302-1314, December.
    15. 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.
    16. Chevalier, Philippe & Lamas, Alejandro & Lu, Liang & Mlinar, Tanja, 2015. "Revenue management for operations with urgent orders," European Journal of Operational Research, Elsevier, vol. 240(2), pages 476-487.
    17. 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.
    18. Zribi, N. & El Kamel, A. & Borne, P., 2008. "Minimizing the makespan for the MPM job-shop with availability constraints," International Journal of Production Economics, Elsevier, vol. 112(1), pages 151-160, March.
    19. M Haouari & T Ladhari, 2007. "Minimizing maximum lateness in a flow shop subject to release dates," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 62-72, January.
    20. Baker, Kenneth R. & Trietsch, Dan, 2009. "Safe scheduling: Setting due dates in single-machine problems," European Journal of Operational Research, Elsevier, vol. 196(1), pages 69-77, July.

    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:pal:jorsoc:v:57:y:2006:i:1:d:10.1057_palgrave.jors.2601966. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.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.