IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v61y2010i5d10.1057_jors.2009.38.html
   My bibliography  Save this article

Parallel machine scheduling problems considering regular measures of performance and machine cost

Author

Listed:
  • A J Ruiz-Torres

    (Universidad de Puerto Rico—Rio Piedras)

  • F J López

    (School of Business, Macon State College)

  • P J Wojciechowski

    (University of Texas at El Paso)

  • J C Ho

    (D. Abbott Turner College of Business Columbus State University)

Abstract

This research considers a broad range of scheduling problems in the parallel machines environment. Schedules are evaluated according to two independent components of the objective function: (1) machine cost consisting of a fixed cost and a variable cost; and (2) a regular measure of performance. This study is only one of a few that take the selection of machines among those available as a decision variable. For machine cost with concave functions, we derive the general characteristics of optimal solutions with respect to decisions on the number of machines to use and the way to load the machines. Our analysis is not restricted to the machine cost criterion, but may be extended to other measures with concave functions. Furthermore, we provide a Pareto efficient perspective in understanding the tradeoff between machine cost and any regular measure of performance.

Suggested Citation

  • 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.
    • Handle: RePEc:pal:jorsoc:v:61:y:2010:i:5:d:10.1057_jors.2009.38
    DOI: 10.1057/jors.2009.38
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/jors.2009.38
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/jors.2009.38?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.

    References listed on IDEAS

    as
    1. Azizoglu, Meral & Kirca, Omer, 1998. "Tardiness minimization on parallel machines," International Journal of Production Economics, Elsevier, vol. 55(2), pages 163-168, July.
    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. György Dósa & Yong He, 2006. "Scheduling with machine cost and rejection," Journal of Combinatorial Optimization, Springer, vol. 12(4), pages 337-350, December.
    4. 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.
    5. C-J Liao & C-M Chen & C-H Lin, 2007. "Minimizing makespan for two parallel machines with job limit on each availability interval," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(7), pages 938-947, July.
    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. 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.
    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. Feifeng Zheng & Yuhong Chen & Ming Liu & Yinfeng Xu, 2022. "Competitive analysis of online machine rental and online parallel machine scheduling problems with workload fence," Journal of Combinatorial Optimization, Springer, vol. 44(2), pages 1060-1076, September.

    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. & 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.
    2. 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.
    3. 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.
    4. S-O Shim & Y-D Kim, 2007. "Minimizing total tardiness in an unrelated parallel-machine scheduling problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(3), pages 346-354, March.
    5. 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.
    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. 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.
    8. 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.
    9. Liqi Zhang & Lingfa Lu & Shisheng Li, 2016. "New results on two-machine flow-shop scheduling with rejection," Journal of Combinatorial Optimization, Springer, vol. 31(4), pages 1493-1504, May.
    10. Yinfeng Xu & Rongteng Zhi & Feifeng Zheng & Ming Liu, 2022. "Competitive algorithm for scheduling of sharing machines with rental discount," Journal of Combinatorial Optimization, Springer, vol. 44(1), pages 414-434, August.
    11. 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.
    12. Lee, Cheng-Hsiung & Liao, Ching-Jong & Chung, Tsui-Ping, 2014. "Scheduling with multi-attribute setup times on two identical parallel machines," International Journal of Production Economics, Elsevier, vol. 153(C), pages 130-138.
    13. Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
    14. Daniel Schubert & André Scholz & Gerhard Wäscher, 2017. "Integrated Order Picking and Vehicle Routing with Due Dates," FEMM Working Papers 170007, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    15. 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.
    16. Daniel Schubert & André Scholz & Gerhard Wäscher, 2018. "Integrated order picking and vehicle routing with due dates," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1109-1139, October.
    17. 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.
    18. 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.
    19. Islam Akaria & Leah Epstein, 2020. "An optimal online algorithm for scheduling with general machine cost functions," Journal of Scheduling, Springer, vol. 23(2), pages 155-162, April.
    20. Lu, Lingfa & Ng, C.T. & Zhang, Liqi, 2011. "Optimal algorithms for single-machine scheduling with rejection to minimize the makespan," International Journal of Production Economics, Elsevier, vol. 130(2), pages 153-158, April.

    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:pal:jorsoc:v:61:y:2010:i:5:d:10.1057_jors.2009.38. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.