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

Sequence-Dependent Scheduling at Baxter International

Author

Listed:
  • Steven Moss

    (Delta State University, PO Box 3275, Cleveland, Mississippi 38733)

  • Cheryl Dale

    (William Carey College, 498 Tuscan Avenue, Hattiesburg, Mississippi 39401)

  • Glenn Brame

    (Baxter International, Highway 61, North Cleveland, Mississippi 38732)

Abstract

We solved Baxter International's IV (intravenous) systems production scheduling as a sequence-dependent scheduling problem. Unlike problems previously studied, Baxter's production line has a large number of components and parts (IV systems) with a nonrepetitive schedule. We compared cluster analysis and mathematical programming as alternative methodologies to solve the scheduling problem. Mathematical programming produces solutions that do better in optimizing setup times. Cluster analysis produces results that managers prefer over mathematical programming because cluster analysis reduces resource requirements relative to mathematical programming. Baxter's implementation of the scheduling model based on cluster analysis on four production lines reduces setup times and saves $165,000 annually.

Suggested Citation

  • Steven Moss & Cheryl Dale & Glenn Brame, 2000. "Sequence-Dependent Scheduling at Baxter International," Interfaces, INFORMS, vol. 30(2), pages 70-80, April.
    • Handle: RePEc:inm:orinte:v:30:y:2000:i:2:p:70-80
    DOI: 10.1287/inte.30.2.70.11674
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.30.2.70.11674
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.30.2.70.11674?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. Ozgur, C. O. & Brown, J. R., 1995. "A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem," Omega, Elsevier, vol. 23(2), pages 205-219, April.
    2. Singh, N., 1993. "Design of cellular manufacturing systems: An invited review," European Journal of Operational Research, Elsevier, vol. 69(3), pages 284-291, September.
    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. B. Madhu Rao & Petros Xanthopoulos & Qipeng Phil Zheng, 2020. "Case Article—DeLand Crayon Company: An Application of the Traveling Salesman Problem to Production Scheduling with Sequence-Dependent Setup Times," INFORMS Transactions on Education, INFORMS, vol. 20(2), pages 93-98, January.
    2. Casey Chung & Milind Dawande & Divakar Rajamani & Chelliah Sriskandarajah, 2011. "A Short-Range Scheduling Model for Blockbuster's Order-Processing Operation," Interfaces, INFORMS, vol. 41(5), pages 466-484, October.
    3. S Karabatı & C Akkan, 2006. "Minimizing sum of completion times on a single machine with sequence-dependent family setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(3), pages 271-280, March.

    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. A. Attila İşlier, 2015. "Cellular Manufacturing Systems: Organization, Trends and Innovative Methods," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 3(2), pages 13-26, December.
    2. Hanen Akrout & Bassem Jarboui & Patrick Siarry & Abdelwaheb Rebaï, 2012. "A GRASP based on DE to solve single machine scheduling problem with SDST," Computational Optimization and Applications, Springer, vol. 51(1), pages 411-435, January.
    3. Cabrera-Rios, Mauricio & Mount-Campbell, Clark A. & Irani, Shahrukh A., 2002. "An approach to the design of a manufacturing cell under economic considerations," International Journal of Production Economics, Elsevier, vol. 78(3), pages 223-237, August.
    4. Chen, Ja-Shen & Heragu, Sunderesh S., 1999. "Stepwise decomposition approaches for large scale cell formation problems," European Journal of Operational Research, Elsevier, vol. 113(1), pages 64-79, February.
    5. Marc Peeters & Zeger Degraeve, 2004. "The Co-Printing Problem: A Packing Problem with a Color Constraint," Operations Research, INFORMS, vol. 52(4), pages 623-638, August.
    6. Rogers, David F. & Kulkarni, Shailesh S., 2005. "Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing," European Journal of Operational Research, Elsevier, vol. 160(2), pages 423-444, January.
    7. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    8. Nsakanda, Aaron Luntala & Diaby, Moustapha & Price, Wilson L., 2006. "Hybrid genetic approach for solving large-scale capacitated cell formation problems with multiple routings," European Journal of Operational Research, Elsevier, vol. 171(3), pages 1051-1070, June.
    9. Ah kioon, Steve & Bulgak, Akif Asil & Bektas, Tolga, 2009. "Integrated cellular manufacturing systems design with production planning and dynamic system reconfiguration," European Journal of Operational Research, Elsevier, vol. 192(2), pages 414-428, January.
    10. Papaioannou, Grammatoula & Wilson, John M., 2010. "The evolution of cell formation problem methodologies based on recent studies (1997-2008): Review and directions for future research," European Journal of Operational Research, Elsevier, vol. 206(3), pages 509-521, November.
    11. Yang, Miin-Shen & Hung, Wen-Liang & Cheng, Fu-Chou, 2006. "Mixed-variable fuzzy clustering approach to part family and machine cell formation for GT applications," International Journal of Production Economics, Elsevier, vol. 103(1), pages 185-198, September.
    12. Heragu, Sunderesh S. & Chen, Ja-Shen, 1998. "Optimal solution of cellular manufacturing system design: Benders' decomposition approach," European Journal of Operational Research, Elsevier, vol. 107(1), pages 175-192, May.
    13. Yang, Miin-Shen & Yang, Jenn-Hwai, 2008. "Machine-part cell formation in group technology using a modified ART1 method," European Journal of Operational Research, Elsevier, vol. 188(1), pages 140-152, July.
    14. Plaquin, Marie-France & Pierreval, Henri, 2000. "Cell formation using evolutionary algorithms with certain constraints," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 267-278, March.
    15. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    16. Yin, Yong & Yasuda, Kazuhiko, 2006. "Similarity coefficient methods applied to the cell formation problem: A taxonomy and review," International Journal of Production Economics, Elsevier, vol. 101(2), pages 329-352, June.
    17. Nair, G. Jayakrishnan & Narendran, T. T., 1997. "On the use of the asymptotic forms of the boolean matrix for designing cellular manufacturing systems -- An improved approach," European Journal of Operational Research, Elsevier, vol. 100(3), pages 429-440, August.
    18. Hegde, GG & Kalathur, S & Tadikamalla, PR & Maurer, J & Abraham, KP, 1998. "Production Scheduling on Parallel Machines: a Case Study," Omega, Elsevier, vol. 26(1), pages 63-73, February.
    19. Xambre, Ana R. & Vilarinho, Pedro M., 2003. "A simulated annealing approach for manufacturing cell formation with multiple identical machines," European Journal of Operational Research, Elsevier, vol. 151(2), pages 434-446, December.
    20. Belarmino Adenso-Díaz & Manuel Laguna, 2006. "Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search," Operations Research, INFORMS, vol. 54(1), pages 99-114, 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:2:p:70-80. 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.