IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v193y2009i2p437-450.html
   My bibliography  Save this article

An algorithm for the maximum revenue jobshop problem

Author

Listed:
  • Penn, Michal
  • Raviv, Tal

Abstract

In this paper, we state and study the problem of selecting a product mix and a dispatching rule for a jobshop system to maximize its revenue rate over an infinite planning horizon. We solve the problem of obtaining maximum revenue by selecting a product mix and determine a schedule. The designed algorithm appropriately rounds an optimal solution to a fluid relaxation in which we replace discrete jobs with the flow of a continuous fluid. The algorithm solves the fluid relaxation optimally and then aims to keep the discrete schedule close to the continuous one obtained by the fluid solution. The schedule obtained is cyclic, with bounded WIP and asymptotically optimal. A secondary aim is to further reduce the WIP and the buffers' sizes by shortening the cycle length. This is achieved at the cost of a slight compromise on the revenue. We report on satisfactory computational results on some benchmark instances.

Suggested Citation

  • Penn, Michal & Raviv, Tal, 2009. "An algorithm for the maximum revenue jobshop problem," European Journal of Operational Research, Elsevier, vol. 193(2), pages 437-450, March.
  • Handle: RePEc:eee:ejores:v:193:y:2009:i:2:p:437-450
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)01138-1
    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. Kamoun, H. & Sriskandarajah, C., 1993. "The complexity of scheduling jobs in repetitive manufacturing systems," European Journal of Operational Research, Elsevier, vol. 70(3), pages 350-364, November.
    2. Joseph Adams & Egon Balas & Daniel Zawack, 1988. "The Shifting Bottleneck Procedure for Job Shop Scheduling," Management Science, INFORMS, vol. 34(3), pages 391-401, March.
    Full references (including those not matched with items on IDEAS)

    More about this item

    Keywords

    Production Scheduling;

    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:eee:ejores:v:193:y:2009:i:2:p:437-450. 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: (Dana Niculescu). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.