IDEAS home Printed from https://ideas.repec.org/p/vlg/vlgwps/2006-41.html
   My bibliography  Save this paper

A finite capacity production scheduling procedure for a belgian steel company

Author

Listed:
  • Debels, D.
  • Vanhoucke, M.

    () (Vlerick Leuven Gent Management School)

Abstract

We present a finite capacity production scheduling algorithm for an integrated steel company located in Belgium. This multiple-objective optimization model takes various case-specific constraints into account and consists of two steps. A machine assignment step determines the routing of an individual order through the network while a scheduling step makes a detailed timetable for each operation for all orders. The procedure has been tested on randomly generated data instances that reflect the characteristics of the steel company. We report promising computational results and illustrate the flexibility of the optimization model with respect to the various input parameters.

Suggested Citation

  • Debels, D. & Vanhoucke, M., 2006. "A finite capacity production scheduling procedure for a belgian steel company," Vlerick Leuven Gent Management School Working Paper Series 2006-41, Vlerick Leuven Gent Management School.
  • Handle: RePEc:vlg:vlgwps:2006-41
    as

    Download full text from publisher

    File URL: http://www.vlerick.be/en/2413-VLK/version/default/part/AttachmentData/data/vlgms-wp-2006-41.pdf
    Download Restriction: no

    Other versions of this item:

    References listed on IDEAS

    as
    1. Peter J. Billington & John O. McClain & L. Joseph Thomas, 1983. "Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction," Management Science, INFORMS, vol. 29(10), pages 1126-1141, October.
    2. Rom, Walter O. & Tukel, Oya Icmeli & Muscatello, Joseph R., 2002. "MRP in a job shop environment using a resource constrained project scheduling model," Omega, Elsevier, vol. 30(4), pages 275-286, August.
    3. Segerstedt, Anders, 1996. "A capacity-constrained multi-level inventory and production control problem," International Journal of Production Economics, Elsevier, vol. 45(1-3), pages 449-461, August.
    4. Gabriel R. Bitran & Arnoldo C. Hax, 1981. "Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables," Management Science, INFORMS, vol. 27(4), pages 431-441, April.
    5. Peter J. Kolesar, 1967. "A Branch and Bound Algorithm for the Knapsack Problem," Management Science, INFORMS, vol. 13(9), pages 723-735, May.
    6. Tang, Lixin & Liu, Jiyin & Rong, Aiying & Yang, Zihou, 2001. "A review of planning and scheduling systems and methods for integrated steel production," European Journal of Operational Research, Elsevier, vol. 133(1), pages 1-20, August.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    Master production scheduling; manufacturing planning and control; scheduling/sequencing.;

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:vlg:vlgwps:2006-41. See general information about how to correct material in RePEc.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Isabelle Vandenbroere). General contact details of provider: http://edirc.repec.org/data/vlgmsbe.html .

    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 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.

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.