IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2022i16p2983-d891816.html
   My bibliography  Save this article

Scheduling with Resource Allocation, Deteriorating Effect and Group Technology to Minimize Total Completion Time

Author

Listed:
  • Jia-Xuan Yan

    (School of Science, Shenyang Aerospace University, Shenyang 110136, China)

  • Na Ren

    (School of Science, Shenyang Aerospace University, Shenyang 110136, China)

  • Hong-Bin Bei

    (School of Science, Shenyang Aerospace University, Shenyang 110136, China)

  • Han Bao

    (School of Science, Shenyang Aerospace University, Shenyang 110136, China)

  • Ji-Bo Wang

    (School of Science, Shenyang Aerospace University, Shenyang 110136, China)

Abstract

This paper studies a single-machine problem with resource allocation ( R A ) and deteriorating effect ( D E ). Under group technology ( G T ) and limited resource availability, our goal is to determine the schedules of groups and jobs within each group such that the total completion time is minimized. For three special cases, polynomial time algorithms are given. For a general case, a heuristic, a tabu search algorithm, and an exact (i.e., branch-and-bound) algorithm are proposed to solve this problem.

Suggested Citation

  • Jia-Xuan Yan & Na Ren & Hong-Bin Bei & Han Bao & Ji-Bo Wang, 2022. "Scheduling with Resource Allocation, Deteriorating Effect and Group Technology to Minimize Total Completion Time," Mathematics, MDPI, vol. 10(16), pages 1-15, August.
    • Handle: RePEc:gam:jmathe:v:10:y:2022:i:16:p:2983-:d:891816
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/16/2983/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/16/2983/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. D Oron, 2014. "Scheduling controllable processing time jobs in a deteriorating environment," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 65(1), pages 49-56, January.
    2. Baoyu Liao & Xingming Wang & Xing Zhu & Shanlin Yang & Panos M. Pardalos, 2020. "Less is more approach for competing groups scheduling with different learning effects," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 33-54, 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. Yi-Chun Wang & Si-Han Wang & Ji-Bo Wang, 2023. "Resource Allocation Scheduling with Position-Dependent Weights and Generalized Earliness–Tardiness Cost," Mathematics, MDPI, vol. 11(1), pages 1-11, January.
    2. Zsolt Tibor Kosztyán & Zoltán Kovács, 2023. "Preface to the Special Issue on “Mathematical Methods and Operation Research in Logistics, Project Planning, and Scheduling”," Mathematics, MDPI, vol. 11(1), pages 1-3, 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. Oron, Daniel, 2016. "Scheduling controllable processing time jobs with position-dependent workloads," International Journal of Production Economics, Elsevier, vol. 173(C), pages 153-160.
    2. Shaojun Lu & Min Kong & Zhiping Zhou & Xinbao Liu & Siwen Liu, 2022. "A hybrid metaheuristic for a semiconductor production scheduling problem with deterioration effect and resource constraints," Operational Research, Springer, vol. 22(5), pages 5405-5440, November.
    3. Yang, Dar-Li & Lai, Chien-Jung & Yang, Suh-Jenq, 2014. "Scheduling problems with multiple due windows assignment and controllable processing times on a single machine," International Journal of Production Economics, Elsevier, vol. 150(C), pages 96-103.
    4. Ming-Hui Li & Dan-Yang Lv & Yuan-Yuan Lu & Ji-Bo Wang, 2024. "Scheduling with Group Technology, Resource Allocation, and Learning Effect Simultaneously," Mathematics, MDPI, vol. 12(7), pages 1-21, March.
    5. Lin-Hui Sun & Kai Cui & Ju-hong Chen & Jun Wang, 2016. "Due date assignment and convex resource allocation scheduling with variable job processing times," International Journal of Production Research, Taylor & Francis Journals, vol. 54(12), pages 3551-3560, June.
    6. Chun-Lai Liu & Jian-Jun Wang, 2016. "Unrelated Parallel-Machine Scheduling with Controllable Processing Times and Impact of Deteriorating Maintenance Activities under Consideration," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(01), pages 1-16, 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:gam:jmathe:v:10:y:2022:i:16:p:2983-:d:891816. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.