IDEAS home Printed from https://ideas.repec.org/a/eee/proeco/v117y2009i2p256-266.html
   My bibliography  Save this article

Scheduling parallel machines with resource-dependent processing times

Author

Listed:
  • Su, Ling-Huey
  • Lien, Chun-Yuan

Abstract

Scheduling parallel machines with resource-dependent processing time is common in many operations management, especially in breaking processing bottlenecks in the Theory of Constraint and lean production. This study considers the problem of scheduling a set of jobs on parallel machines when the processing time of each job depends on the amount of resource consumed. Such scheduling aims to determine the allocation of resources to jobs and jobs to machines to minimize the makespan. The problem has been proven to be NP-hard even for the fixed job processing times. This study first proposes a heuristic called CL for minimizing makespan in the parallel machines problem [short parallel]Cmax) and then compares it with the LISTFIT heuristic of Gupta and Ruiz-Torres (2001), which is currently regarded as the best heuristic for solving this problem. Experimental results indicate that the CL heuristic outperforms the LISTFIT heuristic in terms of solution quality and computation time. Two distinct procedures, RA1 and RA2, which optimally allocate resources with and without a fixed job sequence, respectively, are applied to evaluate the benefits of resource flexibility. Two heuristics, H1 and H2, are proposed by combining the CL procedure with RA1 and RA2, respectively, to solve the problem of combining P[short parallel]Cmax with resource allocation. Computational experiments show the average solution quality of H2 is 99.65%, ensuring that resources should be distributed to jobs in advance.

Suggested Citation

  • Su, Ling-Huey & Lien, Chun-Yuan, 2009. "Scheduling parallel machines with resource-dependent processing times," International Journal of Production Economics, Elsevier, vol. 117(2), pages 256-266, February.
    • Handle: RePEc:eee:proeco:v:117:y:2009:i:2:p:256-266
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925-5273(08)00361-7
    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. Chen, Y. L., 1994. "Scheduling jobs to minimize total cost," European Journal of Operational Research, Elsevier, vol. 74(1), pages 111-119, April.
    2. Kang, Liying & Ng, C.T., 2007. "A note on a fully polynomial-time approximation scheme for parallel-machine scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 109(1-2), pages 180-184, September.
    3. Al-Fawzan, M. A. & Haouari, Mohamed, 2005. "A bi-objective model for robust resource-constrained project scheduling," International Journal of Production Economics, Elsevier, vol. 96(2), pages 175-187, May.
    4. 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.
    5. A A K Jeng & B M T Lin, 2007. "A note on parallel-machine scheduling with deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(6), pages 824-826, June.
    6. Quadt, Daniel & Kuhn, Heinrich, 2007. "Batch scheduling of jobs with identical process times on flexible flow lines," International Journal of Production Economics, Elsevier, vol. 105(2), pages 385-401, February.
    7. Robert McNaughton, 1959. "Scheduling with Deadlines and Loss Functions," Management Science, INFORMS, vol. 6(1), pages 1-12, October.
    8. Lan, Chun-Hsiung, 2007. "The design of multiple production lines under deadline constraint," International Journal of Production Economics, Elsevier, vol. 106(1), pages 191-203, March.
    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. 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.
    2. Zhang, C. & Liu, X. & Jiang, YP. & Fan, B. & Song, X., 2016. "A two-stage resource allocation model for lifeline systems quick response with vulnerability analysis," European Journal of Operational Research, Elsevier, vol. 250(3), pages 855-864.
    3. 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.
    4. Joanna Józefowska & Mariusz Nowak & Rafał Różycki & Grzegorz Waligóra, 2022. "Survey on Optimization Models for Energy-Efficient Computing Systems," Energies, MDPI, vol. 15(22), pages 1-20, November.
    5. Lagodimos, A.G. & Mihiotis, A.N., 2010. "Efficient overtime planning in packing shops with lines of identical manning," International Journal of Production Economics, Elsevier, vol. 124(2), pages 453-462, April.
    6. Hui Zhu & Min Li & Zhangjin Zhou & Yun You, 2016. "Due-window assignment and scheduling with general position-dependent processing times involving a deteriorating and compressible maintenance activity," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3475-3490, June.
    7. Norelhouda Sekkal & Fayçal Belkaid, 2020. "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. 40(3), pages 660-696, October.
    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. Yedidsion, Liron & Shabtay, Dvir & Korach, Ephraim & Kaspi, Moshe, 2009. "A bicriteria approach to minimize number of tardy jobs and resource consumption in scheduling a single machine," International Journal of Production Economics, Elsevier, vol. 119(2), pages 298-307, June.
    10. Agnetis, Alessandro & Alfieri, Arianna & Nicosia, Gaia, 2009. "Assessing the quality of heuristic solutions to parallel machines min-max scheduling problems," International Journal of Production Economics, Elsevier, vol. 122(2), pages 755-762, December.
    11. S Gawiejnowicz & W-C Lee & C-L Lin & C-C Wu, 2011. "Single-machine scheduling of proportionally deteriorating jobs by two agents," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(11), pages 1983-1991, November.
    12. Vinod, V. & Sridharan, R., 2011. "Simulation modeling and analysis of due-date assignment methods and scheduling decision rules in a dynamic job shop production system," International Journal of Production Economics, Elsevier, vol. 129(1), pages 127-146, January.
    13. Shabtay, Dvir & Bensoussan, Yaron & Kaspi, Moshe, 2012. "A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system," International Journal of Production Economics, Elsevier, vol. 136(1), pages 67-74.

    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. Mosheiov, Gur, 2012. "A note: Multi-machine scheduling with general position-based deterioration to minimize total load," International Journal of Production Economics, Elsevier, vol. 135(1), pages 523-525.
    2. J-B Wang & J-J Wang & P Ji, 2011. "Scheduling jobs with chain precedence constraints and deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1765-1770, September.
    3. Li, Yongqiang & Li, Gang & Sun, Linyan & Xu, Zhiyong, 2009. "Single machine scheduling of deteriorating jobs to minimize total absolute differences in completion times," International Journal of Production Economics, Elsevier, vol. 118(2), pages 424-429, April.
    4. Shioura, Akiyoshi & Shakhlevich, Natalia V. & Strusevich, Vitaly A., 2018. "Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: A review of solution approaches," European Journal of Operational Research, Elsevier, vol. 266(3), pages 795-818.
    5. Ming Liu & Feifeng Zheng & Chengbin Chu & Jiantong Zhang, 2012. "An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration," Journal of Combinatorial Optimization, Springer, vol. 23(4), pages 483-492, May.
    6. Stanisław Gawiejnowicz, 2020. "A review of four decades of time-dependent scheduling: main results, new topics, and open problems," Journal of Scheduling, Springer, vol. 23(1), pages 3-47, February.
    7. Epstein, Leah & Levin, Asaf, 2011. "Scheduling with processing set restrictions: PTAS results for several variants," International Journal of Production Economics, Elsevier, vol. 133(2), pages 586-595, October.
    8. 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.
    9. Wu, Chin-Chia & Lee, Wen-Chiung, 2008. "Single-machine group-scheduling problems with deteriorating setup times and job-processing times," International Journal of Production Economics, Elsevier, vol. 115(1), pages 128-133, September.
    10. Liu Guiqing & Li Kai & Cheng Bayi, 2015. "Preemptive Scheduling with Controllable Processing Times on Parallel Machines," Journal of Systems Science and Information, De Gruyter, vol. 3(1), pages 68-76, February.
    11. Hoogeveen, J. A. & Lenstra, J. K. & Veltman, B., 1996. "Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard," European Journal of Operational Research, Elsevier, vol. 89(1), pages 172-175, February.
    12. Yung-Chia Chang & Kuei-Hu Chang & Ching-Ping Zheng, 2022. "Application of a Non-Dominated Sorting Genetic Algorithm to Solve a Bi-Objective Scheduling Problem Regarding Printed Circuit Boards," Mathematics, MDPI, vol. 10(13), pages 1-21, July.
    13. Morteza Davari & Erik Demeulemeester, 2019. "The proactive and reactive resource-constrained project scheduling problem," Journal of Scheduling, Springer, vol. 22(2), pages 211-237, April.
    14. Scholl, Armin & Becker, Christian, 2006. "State-of-the-art exact and heuristic solution procedures for simple assembly line balancing," European Journal of Operational Research, Elsevier, vol. 168(3), pages 666-693, February.
    15. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    16. Hongbo Li & Zhe Xu & Wenchao Wei, 2018. "Bi-Objective Scheduling Optimization for Discrete Time/Cost Trade-Off in Projects," Sustainability, MDPI, vol. 10(8), pages 1-15, August.
    17. Lin, B.M.T. & Liu, S.T., 2008. "Maximizing the reward in the relocation problem with generalized due dates," International Journal of Production Economics, Elsevier, vol. 115(1), pages 55-63, September.
    18. Tien-Fu Liang & Tien-Shou Huang & Ming-Feng Yang, 2012. "Application of fuzzy mathematical programming to imprecise project management decisions," Quality & Quantity: International Journal of Methodology, Springer, vol. 46(5), pages 1451-1470, August.
    19. Leah Epstein, 2023. "Parallel solutions for preemptive makespan scheduling on two identical machines," Journal of Scheduling, Springer, vol. 26(1), pages 61-76, February.
    20. Djellab, Housni & Djellab, Khaled, 2002. "Preemptive Hybrid Flowshop Scheduling problem of interval orders," European Journal of Operational Research, Elsevier, vol. 137(1), pages 37-49, February.

    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:proeco:v:117:y:2009:i:2:p:256-266. 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/ijpe .

    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.