IDEAS home Printed from https://ideas.repec.org/a/taf/tjorxx/v69y2018i4p589-602.html
   My bibliography  Save this article

Minmax common due-window assignment and scheduling on a single machine with two competing agents

Author

Listed:
  • Baruch Mor

Abstract

We study the classical method of common due-date assignment and focus on minmax objective functions. In due-date assignment problems, the objective is to find the optimal due-date and job sequence that minimize the total earliness, tardiness and due-date-related costs. We extend the single-agent problem to a setting involving two competing agents and to a setting of multi-agent. In the two-agent setting (herein agents A and B), the scheduler needs to minimize the maximum cost of the agent A, subject to an upper bound on the maximal cost of the agent B. In the general model of multi-agent scheduling, the scheduler needs to minimize the cost among all A-type agents, subject to an agent-dependent upper bound on the maximal cost of the B-type agents. We further generalize the problems to the method of common due-window assignment. For all studied problems, we introduce efficient polynomial time solutions.

Suggested Citation

  • Baruch Mor, 2018. "Minmax common due-window assignment and scheduling on a single machine with two competing agents," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 69(4), pages 589-602, April.
    • Handle: RePEc:taf:tjorxx:v:69:y:2018:i:4:p:589-602
    DOI: 10.1057/s41274-017-0253-0
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1057/s41274-017-0253-0
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/s41274-017-0253-0?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
    ---><---

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

    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:taf:tjorxx:v:69:y:2018:i:4:p:589-602. 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 Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/tjor .

    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.