IDEAS home Printed from https://ideas.repec.org/a/ibf/ijmmre/v8y2015i2p19-35.html
   My bibliography  Save this article

Determining Optimal Flow-Time Schedules For The Multiple-Product Batch-Flow Problem

Author

Listed:
  • Paul Schikora
  • Andrew Manikas
  • Michael Godfrey

Abstract

We explore the problem of batch flow production scheduling on a single machine with deterministic demand and arrivals over a finite horizon. The objective of the production system is to minimize total flow-time over the horizon to reduce in-process inventory levels and to enable a company to compete on reduced leadtimes. Prior research has established optimal single job batch quantities. However, with multiple jobs on the shop floor, a job may incur wait time, thus the optimal local batch size for a given job may not result in global minimization of the total flow-time over all jobs. Our algorithm provides optimal results for batching with different products in a capacitated production environment. Numerous recommendations for further research are presented

Suggested Citation

  • Paul Schikora & Andrew Manikas & Michael Godfrey, 2015. "Determining Optimal Flow-Time Schedules For The Multiple-Product Batch-Flow Problem," International Journal of Management and Marketing Research, The Institute for Business and Finance Research, vol. 8(2), pages 19-35.
    • Handle: RePEc:ibf:ijmmre:v:8:y:2015:i:2:p:19-35
    as

    Download full text from publisher

    File URL: http://www.theibfr2.com/RePEc/ibf/ijmmre/ijmmr-v8n2-2015/IJMMR-V8N2-2015-2.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Kalir, Adar A. & Sarin, Subhash C., 2000. "Evaluation of the potential benefits of lot streaming in flow-shop systems," International Journal of Production Economics, Elsevier, vol. 66(2), pages 131-142, June.
    2. Gregory Dobson & Uday S. Karmarkar & Jeffrey L. Rummel, 1987. "Batching to Minimize Flow Times on One Machine," Management Science, INFORMS, vol. 33(6), pages 784-799, June.
    3. C T Daniel Ng & T C E Cheng & M Y Kovalyov, 2003. "Batch scheduling with controllable setup and processing times to minimize total completion time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(5), pages 499-506, May.
    4. Ramasesh, Ranga V. & Fu, Haizhen & Fong, Duncan K. H. & Hayya, Jack C., 2000. "Lot streaming in multistage production systems," International Journal of Production Economics, Elsevier, vol. 66(3), pages 199-211, July.
    5. Logendran, Rasaratnam & deSzoeke, Paula & Barnard, Faith, 2006. "Sequence-dependent group scheduling problems in flexible flow shops," International Journal of Production Economics, Elsevier, vol. 102(1), pages 66-86, July.
    6. Logendran, Rasaratnam & Carson, Sara & Hanson, Erik, 2005. "Group scheduling in flexible flow shops," International Journal of Production Economics, Elsevier, vol. 96(2), pages 143-155, May.
    7. Mosheiov, Gur & Oron, Daniel, 2008. "A single machine batch scheduling problem with bounded batch size," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1069-1079, June.
    8. Philippe Baptiste, 2000. "Batching identical jobs," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 52(3), pages 355-367, December.
    9. Scott Webster & Kenneth R. Baker, 1995. "Scheduling Groups of Jobs on a Single Machine," Operations Research, INFORMS, vol. 43(4), pages 692-703, 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. Allahverdi, Ali & Ng, C.T. & Cheng, T.C.E. & Kovalyov, Mikhail Y., 2008. "A survey of scheduling problems with setup times or costs," European Journal of Operational Research, Elsevier, vol. 187(3), pages 985-1032, June.
    2. Grundel, Soesja & Çiftçi, Barış & Borm, Peter & Hamers, Herbert, 2013. "Family sequencing and cooperation," European Journal of Operational Research, Elsevier, vol. 226(3), pages 414-424.
    3. Amin-Naseri, Mohammad Reza & Beheshti-Nia, Mohammad Ali, 2009. "Hybrid flow shop scheduling with parallel batching," International Journal of Production Economics, Elsevier, vol. 117(1), pages 185-196, January.
    4. Bozorgirad, Mir Abbas & Logendran, Rasaratnam, 2013. "Bi-criteria group scheduling in hybrid flowshops," International Journal of Production Economics, Elsevier, vol. 145(2), pages 599-612.
    5. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    6. Selvarajah, Esaignani & Steiner, George, 2006. "Batch scheduling in a two-level supply chain--a focus on the supplier," European Journal of Operational Research, Elsevier, vol. 173(1), pages 226-240, August.
    7. Jun-Qiang Wang & Guo-Qiang Fan & Zhixin Liu, 2020. "Mixed batch scheduling on identical machines," Journal of Scheduling, Springer, vol. 23(4), pages 487-496, August.
    8. Shabtay, Dvir, 2014. "The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost," European Journal of Operational Research, Elsevier, vol. 233(1), pages 64-74.
    9. Potts, Chris N. & Kovalyov, Mikhail Y., 2000. "Scheduling with batching: A review," European Journal of Operational Research, Elsevier, vol. 120(2), pages 228-249, January.
    10. Liji Shen & Jatinder N. D. Gupta, 2018. "Family scheduling with batch availability in flow shops to minimize makespan," Journal of Scheduling, Springer, vol. 21(2), pages 235-249, April.
    11. Esaignani Selvarajah & George Steiner, 2009. "Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs," Operations Research, INFORMS, vol. 57(2), pages 426-438, April.
    12. Liou, Cheng-Dar & Hsieh, Yi-Chih, 2015. "A hybrid algorithm for the multi-stage flow shop group scheduling with sequence-dependent setup and transportation times," International Journal of Production Economics, Elsevier, vol. 170(PA), pages 258-267.
    13. Luo, Hao & Du, Bing & Huang, George Q. & Chen, Huaping & Li, Xiaolin, 2013. "Hybrid flow shop scheduling considering machine electricity consumption cost," International Journal of Production Economics, Elsevier, vol. 146(2), pages 423-439.
    14. Lin, B. M. T. & Jeng, A. A. K., 2004. "Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 91(2), pages 121-134, September.
    15. Liaee, Mohammad Mehdi & Emmons, Hamilton, 1997. "Scheduling families of jobs with setup times," International Journal of Production Economics, Elsevier, vol. 51(3), pages 165-176, September.
    16. Chung‐Lun Li & Wen‐Qiang Xiao, 2004. "Lot streaming with supplier–manufacturer coordination," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(4), pages 522-542, June.
    17. Feng, Hanxin & Xi, Lifeng & Xiao, Lei & Xia, Tangbin & Pan, Ershun, 2018. "Imperfect preventive maintenance optimization for flexible flowshop manufacturing cells considering sequence-dependent group scheduling," Reliability Engineering and System Safety, Elsevier, vol. 176(C), pages 218-229.
    18. Passchyn, Ward & Coene, Sofie & Briskorn, Dirk & Hurink, Johann L. & Spieksma, Frits C.R. & Vanden Berghe, Greet, 2016. "The lockmaster’s problem," European Journal of Operational Research, Elsevier, vol. 251(2), pages 432-441.
    19. Logendran, Rasaratnam & deSzoeke, Paula & Barnard, Faith, 2006. "Sequence-dependent group scheduling problems in flexible flow shops," International Journal of Production Economics, Elsevier, vol. 102(1), pages 66-86, July.
    20. Ruiz, Rubén & Vázquez-Rodríguez, José Antonio, 2010. "The hybrid flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 205(1), pages 1-18, August.

    More about this item

    Keywords

    Scheduling; Single Machine; Batch; Flow-Time; Lead-Time;
    All these keywords.

    JEL classification:

    • M11 - Business Administration and Business Economics; Marketing; Accounting; Personnel Economics - - Business Administration - - - Production Management

    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:ibf:ijmmre:v:8:y:2015:i:2:p:19-35. 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: Mercedes Jalbert (email available below). General contact details of provider: .

    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.