IDEAS home Printed from https://ideas.repec.org/a/bpj/jossai/v3y2015i6p525-537n4.html
   My bibliography  Save this article

Uniform Parallel Machine Scheduling Problem with Controllable Delivery Times

Author

Listed:
  • Li Kai

    (School of Management, Hefei University of Technology, Hefei230009, China)

  • Li Hui

    (School of Management, Hefei University of Technology, Hefei230009, China)

  • Cheng Bayi

    (School of Management, Hefei University of Technology, Hefei230009, China)

  • Luo Qing

    (Nanling Branch, China Mobile Group Anhui Co., Ltd., Nanling242400, China)

Abstract

This paper considers the uniform parallel machine scheduling problem with controllable delivery times, which assumes that the delivery times of jobs are linear decreasing functions of the consumed resource. It aims to minimize the maximum completion time under the constraint that the total resource consumption does not exceed a given limit. For this NP-hard problem, we propose a resource allocation algorithm, named RAA, according to the feasible solution of the uniform parallel machine scheduling problem with fixed delivery times. It proves that RAA algorithm can obtain the optimal resource allocation scheme for any given scheduling scheme in O(n log n)time. Some algorithms based on heuristic algorithm LDT, heuristic algorithm LPDT and simulated annealing are proposed to solve the uniform parallel machine scheduling problem with controllable delivery times. The accuracy and efficiency of the proposed algorithms are tested based on those data with problem sizes varying from 40 to 200 jobs and 2 to 8 machines. The computational results indicate that the SA approach is promising and capable of solving large-scale problems in a reasonable time.

Suggested Citation

  • Li Kai & Li Hui & Cheng Bayi & Luo Qing, 2015. "Uniform Parallel Machine Scheduling Problem with Controllable Delivery Times," Journal of Systems Science and Information, De Gruyter, vol. 3(6), pages 525-537, December.
    • Handle: RePEc:bpj:jossai:v:3:y:2015:i:6:p:525-537:n:4
    DOI: 10.1515/JSSI-2015-0525
    as

    Download full text from publisher

    File URL: https://doi.org/10.1515/JSSI-2015-0525
    Download Restriction: no
    File URL: https://libkey.io/10.1515/JSSI-2015-0525?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. Kai Li & Shan-Lin Yang & Ming-Lun Ren, 2011. "Single‐machine scheduling problem with resource dependent release dates to minimise total resource‐consumption," International Journal of Systems Science, Taylor & Francis Journals, vol. 42(10), pages 1811-1820.
    2. Janiak, Adam, 1991. "Single machine scheduling problem with a common deadline and resource dependent release dates," European Journal of Operational Research, Elsevier, vol. 53(3), pages 317-325, August.
    3. Nodari Vakhania, 2004. "Single-Machine Scheduling with Release Times and Tails," Annals of Operations Research, Springer, vol. 129(1), pages 253-271, July.
    4. Lancia, Giuseppe, 2000. "Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 120(2), pages 277-288, January.
    5. M. Drozdowski & W. Kubiak, 1999. "Scheduling parallel tasks withsequential heads and tails," Annals of Operations Research, Springer, vol. 90(0), pages 221-246, January.
    6. Mohamed Haouari & Anis Gharbi, 2004. "Lower Bounds for Scheduling on Identical Parallel Machines with Heads and Tails," Annals of Operations Research, Springer, vol. 129(1), pages 187-204, July.
    7. Carlier, Jacques, 1987. "Scheduling jobs with release dates and tails on identical machines to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 29(3), pages 298-306, June.
    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. Morgunov, V.I. (Моргунов, В.И.), 2016. "The Liquidity Management of the Banking Sector and the Short-Term Money Market Interest Rates [Управление Ликвидностью Банковского Сектора И Краткосрочной Процентной Ставкой Денежного Рынка]," Working Papers 21311, Russian Presidential Academy of National Economy and Public Administration.

    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. Mohamed Haouari & Lotfi Hidri & Anis Gharbi, 2006. "Optimal Scheduling of a Two-stage Hybrid Flow Shop," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(1), pages 107-124, August.
    2. Peihai Liu & Xiwen Lu, 2015. "Online scheduling on two parallel machines with release dates and delivery times," Journal of Combinatorial Optimization, Springer, vol. 30(2), pages 347-359, August.
    3. Cheng, T. C. Edwin & Janiak, Adam & Kovalyov, Mikhail Y., 2001. "Single machine batch scheduling with resource dependent setup and processing times," European Journal of Operational Research, Elsevier, vol. 135(1), pages 177-183, November.
    4. Carlier, J. & Pinson, E. & Sahli, A. & Jouglet, A., 2020. "An O(n2) algorithm for time-bound adjustments for the cumulative scheduling problem," European Journal of Operational Research, Elsevier, vol. 286(2), pages 468-476.
    5. Mukherjee, Saral & Chatterjee, A.K., 2006. "The average shadow price for MILPs with integral resource availability and its relationship to the marginal unit shadow price," European Journal of Operational Research, Elsevier, vol. 169(1), pages 53-64, February.
    6. Chung‐Lun Li & Edward C. Sewell & T. C. E. Cheng, 1995. "Scheduling to minimize release‐time resource consumption and tardiness penalties," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(6), pages 949-966, September.
    7. Zribi, N. & El Kamel, A. & Borne, P., 2008. "Minimizing the makespan for the MPM job-shop with availability constraints," International Journal of Production Economics, Elsevier, vol. 112(1), pages 151-160, March.
    8. M Haouari & T Ladhari, 2007. "Minimizing maximum lateness in a flow shop subject to release dates," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(1), pages 62-72, January.
    9. Dvir Shabtay & Moshe Kaspi, 2006. "Minimizing the makespan in open‐shop scheduling problems with a convex resource consumption function," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(3), pages 204-216, April.
    10. Tony T. Tran & Arthur Araujo & J. Christopher Beck, 2016. "Decomposition Methods for the Parallel Machine Scheduling Problem with Setups," INFORMS Journal on Computing, INFORMS, vol. 28(1), pages 83-95, February.
    11. Jacques Carlier & Claire Hanen, 2024. "Measuring the slack between lower bounds for scheduling on parallel machines," Annals of Operations Research, Springer, vol. 338(1), pages 347-377, July.
    12. Chatterjee A K & Mukherjee, Saral, 2006. "Unified Concept of Bottleneck," IIMA Working Papers WP2006-05-01, Indian Institute of Management Ahmedabad, Research and Publication Department.
    13. Federico Alonso-Pecina & José Alberto Hernández & José Maria Sigarreta & Nodari Vakhania, 2020. "Fast Approximation for Scheduling One Machine," Mathematics, MDPI, vol. 8(9), pages 1-18, September.
    14. Li, Yantong & Côté, Jean-François & Coelho, Leandro C. & Zhang, Chuang & Zhang, Shuai, 2023. "Order assignment and scheduling under processing and distribution time uncertainty," European Journal of Operational Research, Elsevier, vol. 305(1), pages 148-163.
    15. Lu Liu & Jian-Jun Wang & Xiao-Yuan Wang, 2016. "Single machine due-window assignment scheduling with resource-dependent processing times to minimise total resource consumption cost," International Journal of Production Research, Taylor & Francis Journals, vol. 54(4), pages 1186-1195, February.
    16. Zhi Pei & Mingzhong Wan & Ziteng Wang, 2020. "A new approximation algorithm for unrelated parallel machine scheduling with release dates," Annals of Operations Research, Springer, vol. 285(1), pages 397-425, February.
    17. Viswanath Nagarajan & Joel Wolf & Andrey Balmin & Kirsten Hildrum, 2019. "Malleable scheduling for flows of jobs and applications to MapReduce," Journal of Scheduling, Springer, vol. 22(4), pages 393-411, August.
    18. Berkoune, Djamel & Mesghouni, Khaled, 2008. "Resolution approach for multi-objective problems with uncertain demands," European Journal of Operational Research, Elsevier, vol. 187(2), pages 403-414, June.
    19. V C Ivănescu & J W M Bertrand & J C Fransoo & J P C Kleijnen, 2006. "Bootstrapping to solve the limited data problem in production control: an application in batch process industries," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(1), pages 2-9, January.
    20. Jianfu Chen & Kai Li & Chengbin Chu & Abderrahim Sahli, 2024. "A simplified swarm optimization algorithm to minimize makespan on non-identical parallel machines with unequal job release times under non-renewable resource constraints," Operational Research, Springer, vol. 24(2), pages 1-27, June.

    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:bpj:jossai:v:3:y:2015:i:6:p:525-537:n:4. 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: Peter Golla (email available below). General contact details of provider: https://www.degruyter.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.