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

Scheduling uniform parallel machines subject to a secondary resource to minimize the number of tardy jobs

Author

Listed:
  • Ruiz-Torres, Alex J.
  • Lopez, Francisco J.
  • Ho, Johnny C.

Abstract

No abstract is available for this item.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:179:y:2007:i:2:p:302-315
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)00215-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. 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.
    2. 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.
    3. 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.
    4. Jensen, John B., 2000. "The impact of resource flexibility and staffing decisions on cellular and departmental shop performance," European Journal of Operational Research, Elsevier, vol. 127(2), pages 279-296, December.
    5. Richard L. Daniels & Barbara J. Hoopes & Joseph B. Mazzola, 1996. "Scheduling Parallel Manufacturing Cells with Resource Flexibility," Management Science, INFORMS, vol. 42(9), pages 1260-1276, September.
    6. 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.
    7. Koulamas, Christos & Kyparisis, George J., 2004. "Makespan minimization on uniform parallel machines with release times," European Journal of Operational Research, Elsevier, vol. 157(1), pages 262-266, August.
    8. 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.
    9. Liao, Ching-Jong & Lin, Chien-Hung, 2003. "Makespan minimization for two uniform parallel machines," International Journal of Production Economics, Elsevier, vol. 84(2), pages 205-213, May.
    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. Geurtsen, M. & Didden, Jeroen B.H.C. & Adan, J. & Atan, Z. & Adan, I., 2023. "Production, maintenance and resource scheduling: A review," European Journal of Operational Research, Elsevier, vol. 305(2), pages 501-529.
    2. J. Behnamian & S. M. T. Fatemi Ghomi, 2016. "A survey of multi-factory scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(1), pages 231-249, February.
    3. Yepes-Borrero, Juan C. & Perea, Federico & Ruiz, Rubén & Villa, Fulgencia, 2021. "Bi-objective parallel machine scheduling with additional resources during setups," European Journal of Operational Research, Elsevier, vol. 292(2), pages 443-455.
    4. Edis, Emrah B. & Oguz, Ceyda & Ozkarahan, Irem, 2013. "Parallel machine scheduling with additional resources: Notation, classification, models and solution methods," European Journal of Operational Research, Elsevier, vol. 230(3), pages 449-463.
    5. Mohamed Amine Abdeljaoued & Nour El Houda Saadani & Zied Bahroun, 2020. "Heuristic and metaheuristic approaches for parallel machine scheduling under resource constraints," Operational Research, Springer, vol. 20(4), pages 2109-2132, December.

    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. 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.
    2. 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.
    3. 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.
    4. Yalaoui, F. & Chu, C., 2006. "New exact method to solve the Pm/rj/[summation operator]Cj schedule problem," International Journal of Production Economics, Elsevier, vol. 100(1), pages 168-179, March.
    5. 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.
    6. 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.
    7. 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.
    8. Geurtsen, M. & Didden, Jeroen B.H.C. & Adan, J. & Atan, Z. & Adan, I., 2023. "Production, maintenance and resource scheduling: A review," European Journal of Operational Research, Elsevier, vol. 305(2), pages 501-529.
    9. 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.
    10. 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.
    11. Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.
    12. Xu, J. & Xu, X. & Xie, S.Q., 2011. "Recent developments in Dual Resource Constrained (DRC) system research," European Journal of Operational Research, Elsevier, vol. 215(2), pages 309-318, December.
    13. Rubing Chen & Jinjiang Yuan, 2020. "Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices," 4OR, Springer, vol. 18(2), pages 177-196, June.
    14. Janiak, Adam & Krysiak, Tomasz, 2012. "Scheduling jobs with values dependent on their completion times," International Journal of Production Economics, Elsevier, vol. 135(1), pages 231-241.
    15. Norelhouda Sekkal & Fayçal Belkaid, 0. "A multi-objective simulated annealing to solve an identical parallel machine scheduling problem with deterioration effect and resources consumption constraints," Journal of Combinatorial Optimization, Springer, vol. 0, pages 1-37.
    16. 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.
    17. Mor, Baruch & Mosheiov, Gur, 2014. "Batch scheduling with a rate-modifying maintenance activity to minimize total flowtime," International Journal of Production Economics, Elsevier, vol. 153(C), pages 238-242.
    18. Erenay, Fatih Safa & Sabuncuoglu, Ihsan & Toptal, Aysegül & Tiwari, Manoj Kumar, 2010. "New solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs," European Journal of Operational Research, Elsevier, vol. 201(1), pages 89-98, February.
    19. 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.
    20. Baptiste, Philippe & Peridy, Laurent & Pinson, Eric, 2003. "A branch and bound to minimize the number of late jobs on a single machine with release time constraints," European Journal of Operational Research, Elsevier, vol. 144(1), pages 1-11, January.

    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:179:y:2007:i:2:p:302-315. 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.