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

Minimizing the number of tardy jobs for m parallel machines

Author

Listed:
  • Ho, Johnny C.
  • Chang, Yih-Long

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:84:y:1995:i:2:p:343-355
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/0377-2217(93)E0280-B
    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. Stephen C. Graves, 1981. "A Review of Production Scheduling," Operations Research, INFORMS, vol. 29(4), pages 646-675, August.
    2. Cheng, T. C. E. & Sin, C. C. S., 1990. "A state-of-the-art review of parallel-machine scheduling research," European Journal of Operational Research, Elsevier, vol. 47(3), pages 271-292, August.
    3. Kenneth R. Baker & Gary D. Scudder, 1990. "Sequencing with Earliness and Tardiness Penalties: A Review," Operations Research, INFORMS, vol. 38(1), pages 22-36, February.
    4. E. L. Lawler & C. U. Martel, 1989. "Preemptive Scheduling of Two Uniform Machines to Minimize the Number of Late Jobs," Operations Research, INFORMS, vol. 37(2), pages 314-318, April.
    5. J. Michael Moore, 1968. "An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs," Management Science, INFORMS, vol. 15(1), pages 102-109, September.
    6. 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.
    7. James G. Root, 1965. "Scheduling with Deadlines and Loss Functions on k Parallel Machines," Management Science, INFORMS, vol. 11(3), pages 460-475, January.
    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. Wang, Xiuli & Cheng, T.C.E., 2015. "A heuristic for scheduling jobs on two identical parallel machines with a machine availability constraint," International Journal of Production Economics, Elsevier, vol. 161(C), pages 74-82.
    2. W L Pearn & S H Chung & M H Yang & Y H Chen, 2004. "Algorithms for the wafer probing scheduling problem with sequence-dependent set-up time and due date restrictions," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(11), pages 1194-1207, November.
    3. Lin, B. M. T. & Jeng, A. A. K., 2004. "Parallel-machine batch scheduling to minimize the maximum lateness and the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 91(2), pages 121-134, September.
    4. Fang Lu & John J. Hasenbein & David P. Morton, 2016. "Modeling and Optimization of a Spatial Detection System," INFORMS Journal on Computing, INFORMS, vol. 28(3), pages 512-526, August.
    5. Gupta, Jatinder N. D. & Ho, Johnny C., 1996. "Scheduling with two job classes and setup times to minimize the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 42(3), pages 205-216, April.
    6. Gupta, J.N.D. & Ruiz-Torres, Alex J., 2005. "Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs," European Journal of Operational Research, Elsevier, vol. 167(3), pages 679-695, December.
    7. Ruiz-Torres, Alex J. & Ho, Johnny C. & Lopez, Francisco J., 2006. "Generating Pareto schedules with outsource and internal parallel resources," International Journal of Production Economics, Elsevier, vol. 103(2), pages 810-825, October.
    8. Pereira Lopes, Manuel J. & de Carvalho, J.M. Valerio, 2007. "A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1508-1527, February.
    9. Ruiz-Torres, Alex J. & Lopez, Francisco J. & Ho, Johnny C., 2007. "Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 179(2), pages 302-315, June.
    10. Chang, Zhiqi & Ding, Jian-Ya & Song, Shiji, 2019. "Distributionally robust scheduling on parallel machines under moment uncertainty," European Journal of Operational Research, Elsevier, vol. 272(3), pages 832-846.
    11. J N D Gupta & A J Ruiz-torres & S Webster, 2003. "Minimizing maximum tardiness and number of tardy jobs on parallel machines subject to minimum flow-time," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(12), pages 1263-1274, December.
    12. A J Ruiz-Torres & F J López & P J Wojciechowski & J C Ho, 2010. "Parallel machine scheduling problems considering regular measures of performance and machine cost," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(5), pages 849-857, May.
    13. A. Agnetis & S. Smriglio, 2000. "Optimal assignment of high multiplicity flight plans to dispatchers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(5), pages 359-376, August.
    14. Briskorn, Dirk & Waldherr, Stefan, 2022. "Anarchy in the UJ: Coordination mechanisms for minimizing the number of late jobs," European Journal of Operational Research, Elsevier, vol. 301(3), pages 815-827.
    15. Bornstein, Claudio Thomas & Alcoforado, Luciane Ferreira & Maculan, Nelson, 2005. "A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 649-656, September.
    16. M'Hallah, Rym & Bulfin, R. L., 2005. "Minimizing the weighted number of tardy jobs on parallel processors," European Journal of Operational Research, Elsevier, vol. 160(2), pages 471-484, January.

    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. Bornstein, Claudio Thomas & Alcoforado, Luciane Ferreira & Maculan, Nelson, 2005. "A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem," European Journal of Operational Research, Elsevier, vol. 165(3), pages 649-656, September.
    2. 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.
    3. Hui-Chih Hung & Bertrand M. T. Lin & Marc E. Posner & Jun-Min Wei, 2019. "Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs," Journal of Scheduling, Springer, vol. 22(4), pages 413-431, August.
    4. 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.
    5. Gupta, Jatinder N. D. & Ho, Johnny C., 1996. "Scheduling with two job classes and setup times to minimize the number of tardy jobs," International Journal of Production Economics, Elsevier, vol. 42(3), pages 205-216, April.
    6. 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.
    7. Victor Portougal & David J. Robb, 2000. "Production Scheduling Theory: Just Where Is It Applicable?," Interfaces, INFORMS, vol. 30(6), pages 64-76, December.
    8. 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.
    9. 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.
    10. Lagodimos, A. G. & Leopoulos, V., 2000. "Greedy heuristic algorithms for manpower shift planning," International Journal of Production Economics, Elsevier, vol. 68(1), pages 95-106, October.
    11. 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.
    12. Biskup, Dirk & Herrmann, Jan, 2008. "Single-machine scheduling against due dates with past-sequence-dependent setup times," European Journal of Operational Research, Elsevier, vol. 191(2), pages 587-592, December.
    13. 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.
    14. Lagodimos, A. G. & Mihiotis, A. N. & Kosmidis, V. C., 2004. "Scheduling a multi-stage fabrication shop for efficient subsequent assembly operations," International Journal of Production Economics, Elsevier, vol. 90(3), pages 345-359, August.
    15. Timkovsky, Vadim G., 2003. "Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity," European Journal of Operational Research, Elsevier, vol. 149(2), pages 355-376, September.
    16. Nagar, Amit & Haddock, Jorge & Heragu, Sunderesh, 1995. "Multiple and bicriteria scheduling: A literature survey," European Journal of Operational Research, Elsevier, vol. 81(1), pages 88-104, February.
    17. Detienne, Boris, 2014. "A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints," European Journal of Operational Research, Elsevier, vol. 235(3), pages 540-552.
    18. 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.
    19. 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.
    20. Schmidt, Gunter, 2000. "Scheduling with limited machine availability," European Journal of Operational Research, Elsevier, vol. 121(1), pages 1-15, February.

    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:eee:ejores:v:84:y:1995:i:2:p:343-355. 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.