IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v151y2014icp56-66.html
   My bibliography  Save this article

A construction of knowledge rules for reactive planning of job-mix assignment to homogeneous serial batch machines

Author

Listed:
  • Chou, Yon-Chun
  • Lin, Yue-Lan
  • Chun, King-Fai

Abstract

In high-mix, low-volume production, assigning jobs to parallel machines is an important operation management decision. In manufacturing environments with disruptive unplanned events, reactive job-machine assignment is common in practice but has received little research attention. In this paper, knowledge rules for reactive assignment are constructed analytically for Poisson job arrivals and homogeneous serial batch machines. In serial batching operation, jobs that arrive stochastically are batched by type and then sent to machine queues. This paper has three parts. The effect of job mixes under batching is first analyzed. The probability of setup is derived for the first-come-first-serve, time-based batching, and job-based batching policies. It is shown that uneven mixings of job types produce better results than even mixings under all three batching policies for the performance criterion of minimizing the total number of machine setups. In the second part, knowledge rules that specify partial orderings of job mixings are constructed and proven for singe machine. In the last part, the knowledge rules are applied to the case of parallel machines in situations of disruptive events to demonstrate their utility in dynamic revision of assignment plans.

Suggested Citation

  • Chou, Yon-Chun & Lin, Yue-Lan & Chun, King-Fai, 2014. "A construction of knowledge rules for reactive planning of job-mix assignment to homogeneous serial batch machines," International Journal of Production Economics, Elsevier, vol. 151(C), pages 56-66.
    • Handle: RePEc:eee:proeco:v:151:y:2014:i:c:p:56-66
    DOI: 10.1016/j.ijpe.2014.01.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527314000346
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2014.01.020?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. Leung, Joseph Y.-T. & Li, Chung-Lun, 2008. "Scheduling with processing set restrictions: A survey," International Journal of Production Economics, Elsevier, vol. 116(2), pages 251-262, December.
    2. Brian Denton & Diwakar Gupta & Keith Jawahir, 2003. "Managing Increasing Product Variety at Integrated Steel Mills," Interfaces, INFORMS, vol. 33(2), pages 41-53, April.
    3. Das, Kanchan & Chowdhury, Abdul H., 2012. "Designing a reverse logistics network for optimal collection, recovery and quality-based product-mix planning," International Journal of Production Economics, Elsevier, vol. 135(1), pages 209-221.
    4. Li, Chung-Lun & Wang, Xiuli, 2010. "Scheduling parallel machines with inclusive processing set restrictions and job release times," European Journal of Operational Research, Elsevier, vol. 200(3), pages 702-710, February.
    5. Ozmutlu, Seda & Harmonosky, Catherine M., 2005. "A real-time methodology for minimizing mean flowtime in FMSs with routing flexibility: Threshold-based alternate routing," European Journal of Operational Research, Elsevier, vol. 166(2), pages 369-384, October.
    6. Vaagen, Hajnalka & Wallace, Stein W., 2008. "Product variety arising from hedging in the fashion supply chains," International Journal of Production Economics, Elsevier, vol. 114(2), pages 431-455, August.
    7. Langenberg, Kerstin U. & Seifert, Ralf W. & Tancrez, Jean-Sébastien, 2012. "Aligning supply chain portfolios with product portfolios," International Journal of Production Economics, Elsevier, vol. 135(1), pages 500-513.
    8. Zhang, Zhongju & Daigle, John, 2012. "Analysis of job assignment with batch arrivals among heterogeneous servers," European Journal of Operational Research, Elsevier, vol. 217(1), pages 149-161.
    9. Lotfi Tadj & Gautam Choudhury, 2005. "Optimal design and control of queues," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 13(2), pages 359-412, December.
    10. Cheng, T. C. E. & Sin, C. C. S., 1990. "A state-of-the-art review of parallel-machine scheduling research," European Journal of Operational Research, Elsevier, vol. 47(3), pages 271-292, August.
    Full references (including those not matched with items on IDEAS)

    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. Lee, Kangbok & Hwang, Hark-Chin & Lim, Kyungkuk, 2014. "Semi-online scheduling with GoS eligibility constraints," International Journal of Production Economics, Elsevier, vol. 153(C), pages 204-214.
    2. Leung, Joseph Y.-T. & Li, Chung-Lun, 2016. "Scheduling with processing set restrictions: A literature update," International Journal of Production Economics, Elsevier, vol. 175(C), pages 1-11.
    3. Huo, Yumei & Leung, Joseph Y.-T., 2010. "Parallel machine scheduling with nested processing set restrictions," European Journal of Operational Research, Elsevier, vol. 204(2), pages 229-236, July.
    4. Jinwen Ou & Xueling Zhong & Xiangtong Qi, 2016. "Scheduling parallel machines with inclusive processing set restrictions and job rejection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 63(8), pages 667-681, December.
    5. Leung, Joseph Y-T. & Ng, C.T., 2017. "Fast approximation algorithms for uniform machine scheduling with processing set restrictions," European Journal of Operational Research, Elsevier, vol. 260(2), pages 507-513.
    6. Li, Shuguang, 2017. "Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan," European Journal of Operational Research, Elsevier, vol. 260(1), pages 12-20.
    7. Karhi, Shlomo & Shabtay, Dvir, 2014. "Online scheduling of two job types on a set of multipurpose machines," International Journal of Production Economics, Elsevier, vol. 150(C), pages 155-162.
    8. Li, Shuguang, 2017. "Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities," European Journal of Operational Research, Elsevier, vol. 263(3), pages 815-826.
    9. Epstein, Leah & Levin, Asaf, 2011. "Scheduling with processing set restrictions: PTAS results for several variants," International Journal of Production Economics, Elsevier, vol. 133(2), pages 586-595, October.
    10. Yalaoui, F. & Chu, C., 2006. "New exact method to solve the Pm/rj/[summation operator]Cj schedule problem," International Journal of Production Economics, Elsevier, vol. 100(1), pages 168-179, March.
    11. Lin, Hung-Tso & Liao, Ching-Jong, 2003. "A case study in a two-stage hybrid flow shop with setup time and dedicated machines," International Journal of Production Economics, Elsevier, vol. 86(2), pages 133-143, November.
    12. Biber Nurit & Mor Baruch & Schlissel Yitzhak & Shapira Dana, 2023. "Lot scheduling involving completion time problems on identical parallel machines," Operational Research, Springer, vol. 23(1), pages 1-29, March.
    13. Niknejad, A. & Petrovic, D., 2014. "Optimisation of integrated reverse logistics networks with different product recovery routes," European Journal of Operational Research, Elsevier, vol. 238(1), pages 143-154.
    14. Zoltán Varga & Pál Simon, 2014. "Examination Of Scheduling Methods For Production Systems," Advanced Logistic systems, University of Miskolc, Department of Material Handling and Logistics, vol. 8(1), pages 111-120, December.
    15. Milind Dawande & Jayant Kalagnanam & Ho Soo Lee & Chandra Reddy & Stuart Siegel & Mark Trumbo, 2004. "The Slab-Design Problem in the Steel Industry," Interfaces, INFORMS, vol. 34(3), pages 215-225, June.
    16. George L. Vairaktarakis, 2003. "The Value of Resource Flexibility in the Resource-Constrained Job Assignment Problem," Management Science, INFORMS, vol. 49(6), pages 718-732, June.
    17. Anurag Agarwal & Varghese S. Jacob & Hasan Pirkul, 2006. "An Improved Augmented Neural-Network Approach for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 119-128, February.
    18. Hsieh, Pao-Nuan & Chang, Pao-Long, 2009. "An assessment of world-wide research productivity in production and operations management," International Journal of Production Economics, Elsevier, vol. 120(2), pages 540-551, August.
    19. André Rossi & Alexis Aubry & Mireille Jacomino, 2011. "A sensitivity analysis to assess the completion time deviation for multi-purpose machines facing demand uncertainty," Annals of Operations Research, Springer, vol. 191(1), pages 219-249, November.
    20. H. Khorshidian & M. Akbarpour Shirazi & S. M. T. Fatemi Ghomi, 2019. "An intelligent truck scheduling and transportation planning optimization model for product portfolio in a cross-dock," Journal of Intelligent Manufacturing, Springer, vol. 30(1), pages 163-184, January.

    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:eee:proeco:v:151:y:2014:i:c:p:56-66. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/ijpe .

    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.