IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v63y2012i9p1284-1293.html
   My bibliography  Save this article

Minmax scheduling problems with common flow-allowance

Author

Listed:
  • B Mor

    (The Hebrew University, Jerusalem, Israel)

  • G Mosheiov

    (The Hebrew University, Jerusalem, Israel)

Abstract

In due-date assignment problems with a common flow-allowance, the due-date of a given job is defined as the sum of its processing time and a job-independent constant. We study flow-allowance on a single machine, with an objective function of a minmax type. The total cost of a given job consists of its earliness/tardiness and its flow-allowance cost components. Thus, we seek the job schedule and flow-allowance value that minimize the largest cost among all the jobs. Three extensions are considered: the case of general position-dependent processing times, the model containing an explicit cost for the due-dates, and the setting of due-windows. Properties of optimal schedules are fully analysed in all cases, and all the problems are shown to have polynomial time solutions.

Suggested Citation

  • B Mor & G Mosheiov, 2012. "Minmax scheduling problems with common flow-allowance," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 63(9), pages 1284-1293, September.
    • Handle: RePEc:pal:jorsoc:v:63:y:2012:i:9:p:1284-1293
    as

    Download full text from publisher

    File URL: http://www.palgrave-journals.com/jors/journal/v63/n9/pdf/jors2011135a.pdf
    File Function: Link to full text PDF
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: http://www.palgrave-journals.com/jors/journal/v63/n9/full/jors2011135a.html
    File Function: Link to full text HTML
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

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


    Cited by:

    1. Junxiang Li & Mingsong Cheng & Bo Yu & Shuting Zhang, 2015. "Group Update Method for Sparse Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 257-277, July.
    2. Mor, Baruch & Mosheiov, Gur, 2016. "Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance," European Journal of Operational Research, Elsevier, vol. 254(2), pages 360-370.
    3. Janiak, Adam & Janiak, Władysław A. & Krysiak, Tomasz & Kwiatkowski, Tomasz, 2015. "A survey on scheduling problems with due windows," European Journal of Operational Research, Elsevier, vol. 242(2), pages 347-357.
    4. Baruch Mor & Gur Mosheiov, 2021. "Minmax due-date assignment on a two-machine flowshop," Annals of Operations Research, Springer, vol. 305(1), pages 191-209, October.
    5. Yue, Qing & Zhou, Shenghai, 2021. "Due-window assignment scheduling problem with stochastic processing times," European Journal of Operational Research, Elsevier, vol. 290(2), pages 453-468.

    More about this item

    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:pal:jorsoc:v:63:y:2012:i:9:p:1284-1293. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.