IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v24y1996i6p649-659.html
   My bibliography  Save this article

Sequencing heuristics for dependent setups in a continuous process industry

Author

Listed:
  • Liao, C. J.
  • Yu, W. C.

Abstract

In this paper we address the scheduling of Biaxially Oriented Polypropylene (BOPP) film production, which belongs to the plastics industry and is a continuous process. Scheduling problems in BOPP film production involve processing different thickness settings of films on a common facility. Customer orders of the same thickness setting are usually grouped together as a production batch and a setup time is incurred whenever the batch is switched. However, there is usually more than one batch for the same thickness setting because of the due date constraints of the orders. Therefore, there is a need to develop a batching and sequencing scheme that minimizes the total setup time, or equivalently the makespan, under the due date constraint. In this paper heuristics are developed to generate a near-optimal solution for the problem. The heuristics are evaluated by an optimal solution procedure and are tested by using the actual data from a plant making the BOPP film. Comparison of the heuristics with the results of the current system has demonstrated a significant reduction in total setup time.

Suggested Citation

  • Liao, C. J. & Yu, W. C., 1996. "Sequencing heuristics for dependent setups in a continuous process industry," Omega, Elsevier, vol. 24(6), pages 649-659, December.
  • Handle: RePEc:eee:jomega:v:24:y:1996:i:6:p:649-659
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305-0483(96)00033-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Leong, GK & Oliff, MD, 1990. "A sequencing heuristic for dependent setups in a batch process industry," Omega, Elsevier, vol. 18(3), pages 283-297.
    2. Clyde L. Monma & Chris N. Potts, 1989. "On the Complexity of Scheduling with Batch Setup Times," Operations Research, INFORMS, vol. 37(5), pages 798-804, October.
    3. J. William Gavett, 1965. "Three Heuristic Rules for Sequencing Jobs to a Single Production Facility," Management Science, INFORMS, vol. 11(8), pages 166-176, June.
    4. R. D. Haynes & C. A. Komar & Jack Byrd, Jr., 1973. "The Effectiveness of Three Heuristic Rules for Job Sequencing in a Single Production Facility," Management Science, INFORMS, vol. 19(5), pages 575-580, January.
    5. C. R. Glassey, 1968. "Minimum Change-Over Scheduling of Several Products on One Machine," Operations Research, INFORMS, vol. 16(2), pages 342-352, April.
    6. Selen, W. J. & Heuts, R. M. J., 1990. "Operational production planning in a chemical manufacturing environment," European Journal of Operational Research, Elsevier, vol. 45(1), pages 38-46, March.
    7. Ergin Uskup & Spencer B. Smith, 1975. "A Branch-and-Bound Algorithm for Two-Stage Production-Sequencing Problems," Operations Research, INFORMS, vol. 23(1), pages 118-136, February.
    8. Al-Haboubi, Mohamad H. & Selim, Shokri Z., 1993. "A sequencing problem in the weaving industry," European Journal of Operational Research, Elsevier, vol. 66(1), pages 65-71, April.
    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. 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.
    2. Mujawar, Sachin & Huang, Simin & Nagi, Rakesh, 2012. "Scheduling to minimize stringer utilization for continuous annealing operations," Omega, Elsevier, vol. 40(4), pages 437-444.
    3. J. E. Beasley & M. Krishnamoorthy & Y. M. Sharaiha & D. Abramson, 2000. "Scheduling Aircraft Landings—The Static Case," Transportation Science, INFORMS, vol. 34(2), pages 180-197, May.

    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 & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    2. Ashayeri, J. & van Esch, W.H.L. & Heuts, R.M.J., 1992. "Amendment of Heuts-Selen's lotsizing and sequencing heuristic for single stage process manufacturing systems," Other publications TiSEM 0cf065b7-4836-4cdd-9317-0, Tilburg University, School of Economics and Management.
    3. Ashayeri, J. & van Esch, W.H.L. & Heuts, R.M.J., 1992. "Amendment of Heuts-Selen's lotsizing and sequencing heuristic for single stage process manufacturing systems," Research Memorandum FEW 579, Tilburg University, School of Economics and Management.
    4. Nauss, Robert M., 2008. "Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock," European Journal of Operational Research, Elsevier, vol. 187(3), pages 1268-1281, June.
    5. Gravel, Marc & Price, Wilson L. & Gagne, Caroline, 2002. "Scheduling continuous casting of aluminum using a multiple objective ant colony optimization metaheuristic," European Journal of Operational Research, Elsevier, vol. 143(1), pages 218-229, November.
    6. Altekin, F. Tevhide & Bukchin, Yossi, 2022. "A multi-objective optimization approach for exploring the cost and makespan trade-off in additive manufacturing," European Journal of Operational Research, Elsevier, vol. 301(1), pages 235-253.
    7. Shi-Sheng Li & Ren-Xia Chen & Qi Feng, 2016. "Scheduling two job families on a single machine with two competitive agents," Journal of Combinatorial Optimization, Springer, vol. 32(3), pages 784-799, October.
    8. Gupta, Jatinder N. D. & Ho, Johnny C., 1996. "Scheduling with two job classes and setup times to minimize the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 42(3), pages 205-216, April.
    9. Jordan, Carsten & Drexl, Andreas, 1993. "A comparison of logic and mixed-integer programming solvers for batch sequencing with sequence-dependent setups," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 322, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Kate, H.A. ten & Wijngaard, J. & Zijm, W.H.M., 1995. "Minimizing weighted total earliness, total tardiness and setup costs," Research Report 95A37, University of Groningen, Research Institute SOM (Systems, Organisations and Management).
    11. Chakhlevitch, Konstantin & Glass, Celia A. & Kellerer, Hans, 2011. "Batch machine production with perishability time windows and limited batch size," European Journal of Operational Research, Elsevier, vol. 210(1), pages 39-47, April.
    12. Dunstall, Simon & Wirth, Andrew, 2005. "A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines," European Journal of Operational Research, Elsevier, vol. 167(2), pages 283-296, December.
    13. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    14. Hinder, Oliver & Mason, Andrew J., 2017. "A novel integer programing formulation for scheduling with family setup times on a single machine to minimize maximum lateness," European Journal of Operational Research, Elsevier, vol. 262(2), pages 411-423.
    15. 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.
    16. Kramer, Arthur & Iori, Manuel & Lacomme, Philippe, 2021. "Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization," European Journal of Operational Research, Elsevier, vol. 289(3), pages 825-840.
    17. Schaller, Jeffrey E. & Gupta, Jatinder N. D. & Vakharia, Asoo J., 2000. "Scheduling a flowline manufacturing cell with sequence dependent family setup times," European Journal of Operational Research, Elsevier, vol. 125(2), pages 324-339, September.
    18. 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.
    19. Schaller, Jeffrey, 2007. "Scheduling on a single machine with family setups to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 105(2), pages 329-344, February.
    20. Carlo Meloni & David Naso & Biagio Turchiano, 2006. "Setup coordination between two stages of a production system: A multi-objective evolutionary approach," Annals of Operations Research, Springer, vol. 147(1), pages 175-198, October.

    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:jomega:v:24:y:1996:i:6:p:649-659. 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/wps/find/journaldescription.cws_home/375/description#description .

    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.