IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v11y2019i19p5381-d271870.html
   My bibliography  Save this article

An Enhanced MOPSO Algorithm for Energy-Efficient Single-Machine Production Scheduling

Author

Listed:
  • Yueyue Liu

    (School of Economics & Management, Xiamen University of Technology, Xiamen 361024, China)

  • Xiaoya Liao

    (School of Economics & Management, Xiamen University of Technology, Xiamen 361024, China)

  • Rui Zhang

    (School of Economics & Management, Xiamen University of Technology, Xiamen 361024, China)

Abstract

In recent years, the concerns on energy efficiency in manufacturing systems have been growing rapidly due to the pursuit of sustainable development. Production scheduling plays a vital role in saving energy and promoting profitability for the manufacturing industry. In this paper, we are concerned with a just-in-time (JIT) single machine scheduling problem which considers the deterioration effect and the energy consumption of job processing operations. The aim is to determine an optimal sequence for processing jobs under the objective of minimizing the total earliness/tardiness cost and the total energy consumption. Since the problem is NP -hard, an improved multi-objective particle swarm optimization algorithm enhanced by a local search strategy (MOPSO-LS) is proposed. We draw on the idea of k -opt neighborhoods and modify the neighborhood operations adaptively for the production scheduling problem. We consider two types of k -opt operations and implement the one without overlap in our local search. Three different values of k have been tested. We compare the performance of MOPSO-LS and MOPSO (excluding the local search function completely). Besides, we also compare MOPSO-LS with the well-known multi-objective optimization algorithm NSGA-II. The experimental results have verified the effectiveness of the proposed algorithm. The work of this paper will shed some light on the fast-growing research related to sustainable production scheduling.

Suggested Citation

  • Yueyue Liu & Xiaoya Liao & Rui Zhang, 2019. "An Enhanced MOPSO Algorithm for Energy-Efficient Single-Machine Production Scheduling," Sustainability, MDPI, vol. 11(19), pages 1-16, September.
    • Handle: RePEc:gam:jsusta:v:11:y:2019:i:19:p:5381-:d:271870
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/11/19/5381/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/11/19/5381/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. J-B Wang & Z-Q Xia, 2006. "Flow shop scheduling problems with deteriorating jobs under dominating machines," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(2), pages 220-226, February.
    2. Wang, Ji-Bo & Xia, Zun-Quan, 2006. "Flow shop scheduling with deteriorating jobs under dominating machines," Omega, Elsevier, vol. 34(4), pages 327-336, August.
    3. Aghelinejad, MohammadMohsen & Ouazene, Yassine & Yalaoui, Alice, 2019. "Complexity analysis of energy-efficient single machine scheduling problems," Operations Research Perspectives, Elsevier, vol. 6(C).
    4. Wang, Haibo & Alidaee, Bahram, 2019. "Effective heuristic for large-scale unrelated parallel machines scheduling problems," Omega, Elsevier, vol. 83(C), pages 261-274.
    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. Ovidiu Ivanov & Samiran Chattopadhyay & Soumya Banerjee & Bogdan-Constantin Neagu & Gheorghe Grigoras & Mihai Gavrilas, 2020. "A Novel Algorithm with Multiple Consumer Demand Response Priorities in Residential Unbalanced LV Electricity Distribution Networks," Mathematics, MDPI, vol. 8(8), pages 1-24, July.
    2. Dar-Li Yang & Wen-Hung Kuo, 2019. "Minimizing Makespan in A Two-Machine Flowshop Problem with Processing Time Linearly Dependent on Job Waiting Time," Sustainability, MDPI, vol. 11(24), pages 1-18, 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. C-C He & C-C Wu & W-C Lee, 2009. "Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1759-1766, December.
    2. Wang, Ling & Sun, Lin-Yan & Sun, Lin-Hui & Wang, Ji-Bo, 2010. "On three-machine flow shop scheduling with deteriorating jobs," International Journal of Production Economics, Elsevier, vol. 125(1), pages 185-189, May.
    3. Wang, John & Yan, Ruiliang & Hollister, Kimberly & Zhu, Dan, 2008. "A historic review of management science research in China," Omega, Elsevier, vol. 36(6), pages 919-932, December.
    4. 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.
    5. 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.
    6. Sawik, Tadeusz, 2010. "An integer programming approach to scheduling in a contaminated area," Omega, Elsevier, vol. 38(3-4), pages 179-191, June.
    7. Ma, Ran & Tao, Jiping & Yuan, Jinjiang, 2016. "Online scheduling with linear deteriorating jobs to minimize the total weighted completion time," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 570-583.
    8. Cheng, Mingbao & Tadikamalla, Pandu R. & Shang, Jennifer & Zhang, Shaqing, 2014. "Bicriteria hierarchical optimization of two-machine flow shop scheduling problem with time-dependent deteriorating jobs," European Journal of Operational Research, Elsevier, vol. 234(3), pages 650-657.
    9. Allahverdi, Ali, 2016. "A survey of scheduling problems with no-wait in process," European Journal of Operational Research, Elsevier, vol. 255(3), pages 665-686.
    10. Sun, Linhui & Sun, Linyan & Cui, Kai & Wang, Ji-Bo, 2010. "A note on flow shop scheduling problems with deteriorating jobs on no-idle dominant machines," European Journal of Operational Research, Elsevier, vol. 200(1), pages 309-311, January.
    11. Cheng, Yushao & Sun, Shijie, 2009. "Scheduling linear deteriorating jobs with rejection on a single machine," European Journal of Operational Research, Elsevier, vol. 194(1), pages 18-27, April.
    12. Abbas Hamze & Yassine Ouazene & Nazir Chebbo & Imane Maatouk, 2019. "Multisources of Energy Contracting Strategy with an Ecofriendly Factor and Demand Uncertainties," Energies, MDPI, vol. 12(20), pages 1-24, October.
    13. Hajo Terbrack & Thorsten Claus & Frank Herrmann, 2021. "Energy-Oriented Production Planning in Industry: A Systematic Literature Review and Classification Scheme," Sustainability, MDPI, vol. 13(23), pages 1-32, December.
    14. 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.
    15. Catanzaro, Daniele & Pesenti, Raffaele & Ronco, Roberto, 2023. "Job scheduling under Time-of-Use energy tariffs for sustainable manufacturing: a survey," European Journal of Operational Research, Elsevier, vol. 308(3), pages 1091-1109.
    16. Michal Penn & Tal Raviv, 2021. "Complexity and algorithms for min cost and max profit scheduling under time-of-use electricity tariffs," Journal of Scheduling, Springer, vol. 24(1), pages 83-102, February.
    17. Bahram Alidaee & Haibo Wang & R. Bryan Kethley & Frank Landram, 2019. "A unified view of parallel machine scheduling with interdependent processing rates," Journal of Scheduling, Springer, vol. 22(5), pages 499-515, October.
    18. Chen, Jianfu & Chu, Chengbin & Sahli, Abderrahim & Li, Kai, 2024. "A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs," European Journal of Operational Research, Elsevier, vol. 316(3), pages 856-872.
    19. Zhang, Zhe & Gong, Xue & Song, Xiaoling & Yin, Yong & Lev, Benjamin & Chen, Jie, 2022. "A column generation-based exact solution method for seru scheduling problems," Omega, Elsevier, vol. 108(C).
    20. Wang, Haibo & Alidaee, Bahram, 2019. "The multi-floor cross-dock door assignment problem: Rising challenges for the new trend in logistics industry," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 132(C), pages 30-47.

    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:jsusta:v:11:y:2019:i:19:p:5381-:d:271870. 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.