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

Due-date assignment on uniform machines

Author

Listed:
  • Mosheiov, Gur
  • Sarig, Assaf

Abstract

The classical weighted minsum scheduling and due-date assignment problem (with earliness, tardiness and due-date costs) was shown to be polynomially solvable on a single machine, more than two decades ago. Later, it was shown to have a polynomial time solution in the case of identical processing time jobs and parallel identical machines. We extend the latter setting to parallel uniform machines. We show that the two-machine case is solved in constant time. Furthermore, the problem remains polynomially solvable for a given (fixed) number of machines.

Suggested Citation

  • Mosheiov, Gur & Sarig, Assaf, 2009. "Due-date assignment on uniform machines," European Journal of Operational Research, Elsevier, vol. 193(1), pages 49-58, February.
    • Handle: RePEc:eee:ejores:v:193:y:2009:i:1:p:49-58
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)01067-3
    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. Gordon, Valery & Proth, Jean-Marie & Chu, Chengbin, 2002. "A survey of the state-of-the-art of common due date assignment and scheduling research," European Journal of Operational Research, Elsevier, vol. 139(1), pages 1-25, May.
    2. Hamilton Emmons, 1987. "Scheduling to a common due date on parallel uniform processors," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(6), pages 803-810, December.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Baruch Mor & Gur Mosheiov, 2017. "A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance," Journal of Combinatorial Optimization, Springer, vol. 33(4), pages 1454-1468, May.
    2. Mosheiov, Gur & Sarig, Assaf, 2010. "Scheduling identical jobs and due-window on uniform machines," European Journal of Operational Research, Elsevier, vol. 201(3), pages 712-719, March.
    3. Huynh Tuong, Nguyen & Soukhal, Ameur, 2010. "Due dates assignment and JIT scheduling with equal-size jobs," European Journal of Operational Research, Elsevier, vol. 205(2), pages 280-289, September.
    4. Gerstl, Enrique & Mosheiov, Gur, 2013. "Due-window assignment with identical jobs on parallel uniform machines," European Journal of Operational Research, Elsevier, vol. 229(1), pages 41-47.
    5. Saeed Yaghoubi, 2015. "Due-date assignment for multi-server multi-stage assembly systems," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(7), pages 1246-1256, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Plateau, M.-C. & Rios-Solis, Y.A., 2010. "Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations," European Journal of Operational Research, Elsevier, vol. 201(3), pages 729-736, March.
    2. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    3. Lei Pan & Xinyu Sun & Ji-Bo Wang & Li-Han Zhang & Dan-Yang Lv, 2023. "Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs," Journal of Combinatorial Optimization, Springer, vol. 45(4), pages 1-16, May.
    4. Fowler, John W. & Mönch, Lars, 2022. "A survey of scheduling with parallel batch (p-batch) processing," European Journal of Operational Research, Elsevier, vol. 298(1), pages 1-24.
    5. Slotnick, Susan A., 2011. "Order acceptance and scheduling: A taxonomy and review," European Journal of Operational Research, Elsevier, vol. 212(1), pages 1-11, July.
    6. Huynh Tuong, Nguyen & Soukhal, Ameur & Billaut, Jean-Charles, 2010. "A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines," European Journal of Operational Research, Elsevier, vol. 202(3), pages 646-653, May.
    7. Chuang Wang & Pingyu Jiang, 2019. "Deep neural networks based order completion time prediction by using real-time job shop RFID data," Journal of Intelligent Manufacturing, Springer, vol. 30(3), pages 1303-1318, March.
    8. Altendorfer, Klaus & Minner, Stefan, 2015. "Influence of order acceptance policies on optimal capacity investment with stochastic customer required lead times," European Journal of Operational Research, Elsevier, vol. 243(2), pages 555-565.
    9. Lemos, R.F. & Ronconi, D.P., 2015. "Heuristics for the stochastic single-machine problem with E/T costs," International Journal of Production Economics, Elsevier, vol. 168(C), pages 131-142.
    10. Shi Chen & Hau Lee, 2017. "Incentive Alignment and Coordination of Project Supply Chains," Management Science, INFORMS, vol. 63(4), pages 1011-1025, April.
    11. Adamopoulos, George I. & Pappis, Costas P., 1998. "Scheduling under a common due-data on parallel unrelated machines," European Journal of Operational Research, Elsevier, vol. 105(3), pages 494-501, March.
    12. Leyvand, Yaron & Shabtay, Dvir & Steiner, George, 2010. "A unified approach for scheduling with convex resource consumption functions using positional penalties," European Journal of Operational Research, Elsevier, vol. 206(2), pages 301-312, October.
    13. Mosheiov, Gur & Shadmon, Michal, 2001. "Minmax earliness-tardiness costs with unit processing time jobs," European Journal of Operational Research, Elsevier, vol. 130(3), pages 638-652, May.
    14. Sourd, Francis, 2005. "Punctuality and idleness in just-in-time scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 739-751, December.
    15. Bernard Dickman & Yonah Wilamowsky & Sheldon Epstein, 2001. "Multiple common due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 48(4), pages 293-298, June.
    16. Feng Li & Zhi-Long Chen & Zhi-Long Chen, 2017. "Integrated Production, Inventory and Delivery Problems: Complexity and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 29(2), pages 232-250, May.
    17. Lin, Shih-Wei & Chou, Shuo-Yan & Ying, Kuo-Ching, 2007. "A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date," European Journal of Operational Research, Elsevier, vol. 177(2), pages 1294-1301, March.
    18. T C E Cheng & L Y Kang & C T Ng, 2007. "Due-date assignment and parallel-machine scheduling with deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(8), pages 1103-1108, August.
    19. G Mosheiov, 2003. "Due-date assignment with asymmetric earliness–tardiness cost," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(11), pages 1222-1224, November.
    20. Shabtay, Dvir & Mosheiov, Gur & Oron, Daniel, 2022. "Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work," European Journal of Operational Research, Elsevier, vol. 303(1), pages 66-77.

    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:1:p:49-58. 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.

    If CitEc recognized a bibliographic 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.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.