IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v34y1987i6p803-810.html
   My bibliography  Save this article

Scheduling to a common due date on parallel uniform processors

Author

Listed:
  • Hamilton Emmons

Abstract

We consider scheduling a set of jobs on parallel processors, when all jobs have a common due date and earliness and lateness are penalized at different cost rates. For identical processors, the secondary criteria of minimizing makespan and machine occupancy are addressed. The extension to different, uniform processors is also solved.

Suggested Citation

  • 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.
    • Handle: RePEc:wly:navres:v:34:y:1987:i:6:p:803-810
    DOI: 10.1002/1520-6750(198712)34:63.0.CO;2-2
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(198712)34:63.0.CO;2-2
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(198712)34:63.0.CO;2-2?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
    ---><---

    References listed on IDEAS

    as
    1. Uttarayan Bagchi & Robert S. Sullivan & Y. L. Chang, 1986. "Minimizing mean absolute deviation of completion times about a common due date," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(2), pages 227-240, May.
    2. S. S. Panwalkar & M. L. Smith & A. Seidmann, 1982. "Common Due Date Assignment to Minimize Total Penalty for the One Machine Scheduling Problem," Operations Research, INFORMS, vol. 30(2), pages 391-399, April.
    3. Nicholas G. Hall, 1986. "Single‐ and multiple‐processor models for minimizing completion time variance," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 33(1), pages 49-54, February.
    4. John J. Kanet, 1981. "Minimizing the average deviation of job completion times about a common due date," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 28(4), pages 643-651, 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. 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. 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.
    3. Sridharan, V. & Zhou, Z., 1996. "A decision theory based scheduling procedure for single-machine weighted earliness and tardiness problems," European Journal of Operational Research, Elsevier, vol. 94(2), pages 292-301, October.
    4. Chen, Zhi-Long & Lee, Chung-Yee, 2002. "Parallel machine scheduling with a common due window," European Journal of Operational Research, Elsevier, vol. 136(3), pages 512-527, February.
    5. Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1994. "Due‐date assignment and early/tardy scheduling on identical parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(1), pages 17-32, February.
    6. Wlodzimierz Szwarc, 1989. "Single‐machine scheduling to minimize absolute deviation of completion times from a common due date," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(5), pages 663-673, October.
    7. Sabuncuoglu, Ihsan & Lejmi, Tahar, 1999. "Scheduling for non regular performance measure under the due window approach," Omega, Elsevier, vol. 27(5), pages 555-568, October.
    8. Joseph Y.‐T. Leung, 2002. "A dual criteria sequencing problem with earliness and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 49(4), pages 422-431, June.
    9. Hoogeveen, Han, 2005. "Multicriteria scheduling," European Journal of Operational Research, Elsevier, vol. 167(3), pages 592-623, December.
    10. 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.
    11. Adamopoulos, George I. & Pappis, Costas P., 1996. "A fuzzy-linguistic approach to a multi-criteria sequencing problem," European Journal of Operational Research, Elsevier, vol. 92(3), pages 628-636, August.
    12. Ho, Johnny C. & Chang, Yih-Long, 1995. "Minimizing the number of tardy jobs for m parallel machines," European Journal of Operational Research, Elsevier, vol. 84(2), pages 343-355, July.
    13. Adamopoulos, G. I. & Pappis, C. P., 1996. "Scheduling jobs with different, job-dependent earliness and tardiness penalties using the SLK method," European Journal of Operational Research, Elsevier, vol. 88(2), pages 336-344, January.
    14. Enrique Gerstl & Gur Mosheiov, 2014. "Single machine just‐in‐time scheduling problems with two competing agents," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 1-16, February.
    15. 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.
    16. Mosheiov, Gur & Sarig, Assaf, 2009. "Due-date assignment on uniform machines," European Journal of Operational Research, Elsevier, vol. 193(1), pages 49-58, February.
    17. 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.
    18. 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.
    19. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.
    20. Yalaoui, Farouk & Chu, Chengbin, 2002. "Parallel machine scheduling to minimize total tardiness," International Journal of Production Economics, Elsevier, vol. 76(3), pages 265-279, April.
    21. Srirangacharyulu, B. & Srinivasan, G., 2013. "An exact algorithm to minimize mean squared deviation of job completion times about a common due date," European Journal of Operational Research, Elsevier, vol. 231(3), pages 547-556.
    22. Chen, Zhi-Long & Powell, Warren B., 1999. "A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem," European Journal of Operational Research, Elsevier, vol. 116(1), pages 220-232, July.
    23. Li, Kunpeng & Sivakumar, Appa Iyer & Ganesan, Viswanath Kumar, 2008. "Complexities and algorithms for synchronized scheduling of parallel machine assembly and air transportation in consumer electronics supply chain," European Journal of Operational Research, Elsevier, vol. 187(2), pages 442-455, June.
    24. X. Cai & S. Zhou, 1997. "Scheduling stochastic jobs with asymmetric earliness and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(6), pages 531-557, September.
    25. 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.

    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. Wlodzimierz Szwarc, 1989. "Single‐machine scheduling to minimize absolute deviation of completion times from a common due date," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(5), pages 663-673, October.
    2. Kerem Bülbül & Safia Kedad-Sidhoum & Halil Şen, 2019. "Single-machine common due date total earliness/tardiness scheduling with machine unavailability," Journal of Scheduling, Springer, vol. 22(5), pages 543-565, October.
    3. Gur Mosheiov, 2000. "Minimizing mean absolute deviation of job completion times from the mean completion time," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(8), pages 657-668, December.
    4. 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.
    5. Uttarayan Bagchi & Yih‐Long Chang & Robert S. Sullivan, 1987. "Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(5), pages 739-751, October.
    6. Andreas C. Nearchou & Sotiris L. Omirou, 2024. "Self-Adaptive Biased Differential Evolution for Scheduling Against Common Due Dates," SN Operations Research Forum, Springer, vol. 5(2), pages 1-29, June.
    7. Michael X. Weng & Jose A. Ventura, 1994. "Scheduling about a large common due date with tolerance to minimize mean absolute deviation of completion times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(6), pages 843-851, October.
    8. T. C. E. Cheng & H. G. Kahlbacher, 1991. "A proof for the longest‐job‐first policy in one‐machine scheduling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(5), pages 715-720, October.
    9. Umar M. Al‐Turki & John Mittenthal & M. Raghavachari, 1996. "The single‐machine absolute‐deviation early‐tardy problem with random completion times," Naval Research Logistics (NRL), John Wiley & Sons, vol. 43(4), pages 573-587, June.
    10. S.S. Panwalkar & Christos Koulamas, 2015. "On equivalence between the proportionate flow shop and single‐machine scheduling problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(7), pages 595-603, October.
    11. Yeong‐Dae Kim & Candace Arai Yano, 1994. "Minimizing mean tardiness and earliness in single‐machine scheduling problems with unequal due dates," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(7), pages 913-933, December.
    12. Prabuddha De & Jay B. Ghosh & Charles E. Wells, 1994. "Due‐date assignment and early/tardy scheduling on identical parallel machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(1), pages 17-32, February.
    13. J. Steve Davis & John J. Kanet, 1993. "Single‐machine scheduling with early and tardy completion costs," Naval Research Logistics (NRL), John Wiley & Sons, vol. 40(1), pages 85-101, February.
    14. Enrique Gerstl & Gur Mosheiov, 2014. "Single machine just‐in‐time scheduling problems with two competing agents," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(1), pages 1-16, February.
    15. Koulamas, Christos & Kyparisis, George J., 2023. "Two-stage no-wait proportionate flow shop scheduling with minimal service time variation and optional job rejection," European Journal of Operational Research, Elsevier, vol. 305(2), pages 608-616.
    16. Oğuzhan Ahmet Arik, 2023. "A heuristic for single machine common due date assignment problem with different earliness/tardiness weights," OPSEARCH, Springer;Operational Research Society of India, vol. 60(3), pages 1561-1574, September.
    17. Chung‐Lun Li & T. C. E. Cheng, 1994. "The parallel machine min‐max weighted absolute lateness scheduling problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(1), pages 33-46, February.
    18. S.S. Panwalkar & Christos Koulamas, 2015. "Proportionate flow shop: New complexity results and models with due date assignment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 62(2), pages 98-106, March.
    19. 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.
    20. Philip Kaminsky & Onur Kaya, 2008. "Scheduling and due‐date quotation in a make‐to‐order supply chain," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(5), pages 444-458, August.

    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:wly:navres:v:34:y:1987:i:6:p:803-810. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.