IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v41y1993i4p641-648.html
   My bibliography  Save this article

BPSS: A Scheduling Support System for the Packaging Industry

Author

Listed:
  • Leonard Adler

    (International Paper, Hawthorne, New York)

  • Nelson Fraiman

    (International Paper, Hawthorne, New York)

  • Edward Kobacker

    (International Paper, Hawthorne, New York)

  • Michael Pinedo

    (Columbia University, New York, New York)

  • Juan Carlos Plotnicoff

    (International Paper, Hawthorne, New York)

  • Tso Pang Wu

    (International Paper, Hawthorne, New York)

Abstract

This paper describes a scheduling support system for plants that produce multiply paper bags. The machine environment in these plants may be described as a flexible flow shop. That is, there are a number of stages in series with a number of machines in parallel at each stage. The jobs have specified shipping dates as well as priorities; their processing times and setup times are known in advance. We developed a five-step algorithm that schedules all the jobs at the various stages. This algorithm has been incorporated in a system, the Bagpak Production Scheduling System (BPSS), which also contains a data base management module and a user interface module. The system has been implemented in two plants, and is used on a regular basis. It has increased considerably the accuracy of the available information regarding the production process. The scheduler, in conjunction with the system, is able to produce better schedules; he now always knows where given performance measures stand. In addition, the available information enables the scheduler to provide better service to customers.

Suggested Citation

  • Leonard Adler & Nelson Fraiman & Edward Kobacker & Michael Pinedo & Juan Carlos Plotnicoff & Tso Pang Wu, 1993. "BPSS: A Scheduling Support System for the Packaging Industry," Operations Research, INFORMS, vol. 41(4), pages 641-648, August.
    • Handle: RePEc:inm:oropre:v:41:y:1993:i:4:p:641-648
    DOI: 10.1287/opre.41.4.641
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.41.4.641
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.41.4.641?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
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Gheisariha, Elmira & Tavana, Madjid & Jolai, Fariborz & Rabiee, Meysam, 2021. "A simulation–optimization model for solving flexible flow shop scheduling problems with rework and transportation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 180(C), pages 152-178.
    2. Tzu-Li Chen & Chen-Yang Cheng & Yi-Han Chou, 2020. "Multi-objective genetic algorithm for energy-efficient hybrid flow shop scheduling with lot streaming," Annals of Operations Research, Springer, vol. 290(1), pages 813-836, July.
    3. Quadt, Daniel & Kuhn, Heinrich, 2007. "A taxonomy of flexible flow line scheduling procedures," European Journal of Operational Research, Elsevier, vol. 178(3), pages 686-698, May.
    4. Ruiz, Ruben & Maroto, Concepcion, 2006. "A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility," European Journal of Operational Research, Elsevier, vol. 169(3), pages 781-800, March.
    5. 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.
    6. Kim, S. C. & Bobrowski, P. M., 1997. "Scheduling jobs with uncertain setup times and sequence dependency," Omega, Elsevier, vol. 25(4), pages 437-447, August.
    7. Miguel A. González & Juan José Palacios & Camino R. Vela & Alejandro Hernández-Arauzo, 2017. "Scatter search for minimizing weighted tardiness in a single machine scheduling with setups," Journal of Heuristics, Springer, vol. 23(2), pages 81-110, June.

    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:oropre:v:41:y:1993:i:4:p:641-648. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.