IDEAS home Printed from https://ideas.repec.org/a/bla/popmgt/v30y2021i11p4273-4287.html
   My bibliography  Save this article

On the Capacity of a Process with Batch Processing and Setup Times

Author

Listed:
  • Zhichao Feng
  • Milind Dawande
  • Ganesh Janakiraman

Abstract

While batch processes are ubiquitous across industries, there is little understanding of the determination of the capacity (i.e., the maximum long‐term output rate) of such processes. In this study, we consider processes with collaboration (activities may require multiple resources simultaneously) and multitasking (the same resource may be needed for multiple activities), and characterize the capacity of an arbitrary deterministic, single‐product process with batch processing and (activity) setup times. Such a process can be viewed as an “intermittent” process in which production occurs in discrete quantities; specifically, in multiples of the batch size. To obtain a corresponding “smooth” process, we use the most natural transformation that eliminates batching and setups, and simply prorates the processing and setup time per flow unit. The main result of our analysis is that capacity remains unaffected in this transformation. Then, using recent developments in the literature on process capacity, the capacity of the transformed process can be obtained by computing the fractional chromatic number of an associated graph—this latter problem can be formulated as a linear program.

Suggested Citation

  • Zhichao Feng & Milind Dawande & Ganesh Janakiraman, 2021. "On the Capacity of a Process with Batch Processing and Setup Times," Production and Operations Management, Production and Operations Management Society, vol. 30(11), pages 4273-4287, November.
  • Handle: RePEc:bla:popmgt:v:30:y:2021:i:11:p:4273-4287
    DOI: 10.1111/poms.13522
    as

    Download full text from publisher

    File URL: https://doi.org/10.1111/poms.13522
    Download Restriction: no

    File URL: https://libkey.io/10.1111/poms.13522?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. Hirofumi Matsuo & Jen S. Shang & Robert S. Sullivan, 1991. "A Crane Scheduling Problem in a Computer-Integrated Manufacturing Environment," Management Science, INFORMS, vol. 37(5), pages 587-606, May.
    2. Tae-Eog Lee & Marc E. Posner, 1997. "Performance Measures and Schedules in Periodic Job Shops," Operations Research, INFORMS, vol. 45(1), pages 72-91, February.
    3. S. Thomas McCormick & Michael L. Pinedo & Scott Shenker & Barry Wolf, 1989. "Sequencing in an Assembly Line with Blocking to Minimize Cycle Time," Operations Research, INFORMS, vol. 37(6), pages 925-935, December.
    4. Itai Gurvich & Jan A. Van Mieghem, 2015. "Collaboration and Multitasking in Networks: Architectures, Bottlenecks, and Capacity," Manufacturing & Service Operations Management, INFORMS, vol. 17(1), pages 16-33, February.
    5. I.N. Kamal Abadi & Nicholas G. Hall & Chelliah Sriskandarajah, 2000. "Minimizing Cycle Time in a Blocking Flowshop," Operations Research, INFORMS, vol. 48(1), pages 177-180, February.
    6. Yang Bo & Milind Dawande & Woonghee Tim Huh & Ganesh Janakiraman & Mahesh Nagarajan, 2019. "Determining Process Capacity: Intractability and Efficient Special Cases," Service Science, INFORMS, vol. 21(1), pages 139-153, January.
    7. Mark L. Spearman, 2014. "Of Physics and Factory Physics," Production and Operations Management, Production and Operations Management Society, vol. 23(11), pages 1875-1885, November.
    8. Yves Crama & Joris van de Klundert, 1997. "Cyclic Scheduling of Identical Parts in a Robotic Cell," Operations Research, INFORMS, vol. 45(6), pages 952-965, December.
    9. Milind Dawande & Chelliah Sriskandarajah & Suresh Sethi, 2002. "On Throughput Maximization in Constant Travel-Time Robotic Cells," Manufacturing & Service Operations Management, INFORMS, vol. 4(4), pages 296-312, 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. Milind Dawande & Zhichao Feng & Ganesh Janakiraman, 2021. "On the Structure of Bottlenecks in Processes," Management Science, INFORMS, vol. 67(6), pages 3853-3870, June.
    2. Kats, Vladimir & Lei, Lei & Levner, Eugene, 2008. "Minimizing the cycle time of multiple-product processing networks with a fixed operation sequence, setups, and time-window constraints," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1196-1211, June.
    3. Imai, Akio & Yamakawa, Yukiko & Huang, Kuancheng, 2014. "The strategic berth template problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 72(C), pages 77-100.
    4. Neil Geismar, H. & Dawande, Milind & Sriskandarajah, Chelliah, 2005. "Approximation algorithms for k-unit cyclic solutions in robotic cells," European Journal of Operational Research, Elsevier, vol. 162(2), pages 291-309, April.
    5. Ronconi, Débora P. & Henriques, Luís R.S., 2009. "Some heuristic algorithms for total tardiness minimization in a flowshop with blocking," Omega, Elsevier, vol. 37(2), pages 272-281, April.
    6. Lin, Shih-Wei & Ying, Kuo-Ching, 2013. "Minimizing makespan in a blocking flowshop using a revised artificial immune system algorithm," Omega, Elsevier, vol. 41(2), pages 383-389.
    7. Drobouchevitch, Inna G. & Sethi, Suresh P. & Sriskandarajah, Chelliah, 2006. "Scheduling dual gripper robotic cell: One-unit cycles," European Journal of Operational Research, Elsevier, vol. 171(2), pages 598-631, June.
    8. Tharanga Rajapakshe & Milind Dawande & Chelliah Sriskandarajah, 2011. "Quantifying the Impact of Layout on Productivity: An Analysis from Robotic-Cell Manufacturing," Operations Research, INFORMS, vol. 59(2), pages 440-454, April.
    9. Grabowski, Jøzef & Pempera, Jaroslaw, 2007. "The permutation flow shop problem with blocking. A tabu search approach," Omega, Elsevier, vol. 35(3), pages 302-311, June.
    10. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    11. Pan, Quan-Ke & Wang, Ling, 2012. "Effective heuristics for the blocking flowshop scheduling problem with makespan minimization," Omega, Elsevier, vol. 40(2), pages 218-229, April.
    12. Liu, Shi Qiang & Kozan, Erhan, 2009. "Scheduling a flow shop with combined buffer conditions," International Journal of Production Economics, Elsevier, vol. 117(2), pages 371-380, February.
    13. Gultekin, Hakan & Akturk, M. Selim & Karasan, Oya Ekin, 2006. "Cyclic scheduling of a 2-machine robotic cell with tooling constraints," European Journal of Operational Research, Elsevier, vol. 174(2), pages 777-796, October.
    14. Carlier, Jacques & Haouari, Mohamed & Kharbeche, Mohamed & Moukrim, Aziz, 2010. "An optimization-based heuristic for the robotic cell problem," European Journal of Operational Research, Elsevier, vol. 202(3), pages 636-645, May.
    15. Caraffa, Vince & Ianes, Stefano & P. Bagchi, Tapan & Sriskandarajah, Chelliah, 2001. "Minimizing makespan in a blocking flowshop using genetic algorithms," International Journal of Production Economics, Elsevier, vol. 70(2), pages 101-115, March.
    16. Yang Bo & Milind Dawande & Woonghee Tim Huh & Ganesh Janakiraman & Mahesh Nagarajan, 2019. "Determining Process Capacity: Intractability and Efficient Special Cases," Service Science, INFORMS, vol. 21(1), pages 139-153, January.
    17. I N Kamal Abadi, 2007. "A new algorithm for minimizing makespan, C max, in blocking flow-shop problem through slowing down the operations," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 134-140, January.
    18. Débora Ronconi, 2005. "A Branch-and-Bound Algorithm to Minimize the Makespan in a Flowshop with Blocking," Annals of Operations Research, Springer, vol. 138(1), pages 53-65, September.
    19. Hall, Nicholas G. & Kamoun, Hichem & Sriskandarajah, Chelliah, 1998. "Scheduling in robotic cells: Complexity and steady state analysis," European Journal of Operational Research, Elsevier, vol. 109(1), pages 43-65, August.
    20. Smith, Kate & Palaniswami, M. & Krishnamoorthy, M., 1996. "Traditional heuristic versus Hopfield neural network approaches to a car sequencing problem," European Journal of Operational Research, Elsevier, vol. 93(2), pages 300-316, September.

    More about this item

    Statistics

    Access and download statistics

    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:bla:popmgt:v:30:y:2021:i:11:p:4273-4287. 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: Wiley Content Delivery (email available below). General contact details of provider: http://onlinelibrary.wiley.com/journal/10.1111/(ISSN)1937-5956 .

    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.