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

Automatic Design of Energy-Efficient Dispatching Rules for Multi-Objective Dynamic Flexible Job Shop Scheduling Based on Dual Feature Weight Sets

Author

Listed:
  • Binzi Xu

    (School of Electrical Engineering, Anhui Polytechnic University, Wuhu 241000, China)

  • Kai Xu

    (School of Electrical Engineering, Anhui Polytechnic University, Wuhu 241000, China)

  • Baolin Fei

    (School of Electrical Engineering, Anhui Polytechnic University, Wuhu 241000, China)

  • Dengchao Huang

    (School of Electrical Engineering, Anhui Polytechnic University, Wuhu 241000, China)

  • Liang Tao

    (School of Electrical Engineering, Anhui Polytechnic University, Wuhu 241000, China)

  • Yan Wang

    (School of IoT and Engineering, Jiangnan University, Wuxi 214122, China)

Abstract

Considering the requirements of the actual production scheduling process, the utilization of the genetic programming hyper-heuristic (GPHH) approach to automatically design dispatching rules (DRs) has recently emerged as a popular optimization approach. However, the decision objects and decision environments for routing and sequencing decisions are different in the dynamic flexible job shop scheduling problem (DFJSSP), leading to different required feature information. Traditional algorithms that allow these two types of scheduling decisions to share one common feature set are not conducive to the further optimization of the evolved DRs, but instead introduce redundant and unnecessary search attempts for algorithm optimization. To address this, some related studies have focused on customizing the feature sets for both routing and sequencing decisions through feature selection when solving single-objective problems. While being effective in reducing the search space, the selected feature sets also diminish the diversity of the obtained DRs, ultimately impacting the optimization performance. Consequently, this paper proposes an improved GPHH with dual feature weight sets for the multi-objective energy-efficient DFJSSP, which includes two novel feature weight measures and one novel hybrid population adjustment strategy. Instead of selecting suitable features, the proposed algorithm assigns appropriate weights to the features based on their multi-objective contribution, which could provide directional guidance to the GPHH while ensuring the search space. Experimental results demonstrate that, compared to existing studies, the proposed algorithm can significantly enhance the optimization performance and interpretability of energy-efficient DRs.

Suggested Citation

  • Binzi Xu & Kai Xu & Baolin Fei & Dengchao Huang & Liang Tao & Yan Wang, 2024. "Automatic Design of Energy-Efficient Dispatching Rules for Multi-Objective Dynamic Flexible Job Shop Scheduling Based on Dual Feature Weight Sets," Mathematics, MDPI, vol. 12(10), pages 1-24, May.
  • Handle: RePEc:gam:jmathe:v:12:y:2024:i:10:p:1463-:d:1390837
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/12/10/1463/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/12/10/1463/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fei Luan & Zongyan Cai & Shuqiang Wu & Shi Qiang Liu & Yixin He, 2019. "Optimizing the Low-Carbon Flexible Job Shop Scheduling Problem with Discrete Whale Optimization Algorithm," Mathematics, MDPI, vol. 7(8), pages 1-17, August.
    2. Gmys, Jan & Mezmaz, Mohand & Melab, Nouredine & Tuyttens, Daniel, 2020. "A computationally efficient Branch-and-Bound algorithm for the permutation flow-shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 284(3), pages 814-833.
    3. Hankun Zhang & Borut Buchmeister & Xueyan Li & Robert Ojstersek, 2023. "An Efficient Metaheuristic Algorithm for Job Shop Scheduling in a Dynamic Environment," Mathematics, MDPI, vol. 11(10), pages 1-24, May.
    4. S. S. Panwalkar & Wafik Iskander, 1977. "A Survey of Scheduling Rules," Operations Research, INFORMS, vol. 25(1), pages 45-61, February.
    Full references (including those not matched with items on IDEAS)

    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. Anurag Agarwal & Varghese S. Jacob & Hasan Pirkul, 2006. "An Improved Augmented Neural-Network Approach for Scheduling Problems," INFORMS Journal on Computing, INFORMS, vol. 18(1), pages 119-128, February.
    2. Parlakturk, Ali & Kumar, Sunil, 2004. "Self-Interested Routing in Queueing Networks," Research Papers 1782r, Stanford University, Graduate School of Business.
    3. Zoghby, Jeriad & Wesley Barnes, J. & Hasenbein, John J., 2005. "Modeling the reentrant job shop scheduling problem with setups for metaheuristic searches," European Journal of Operational Research, Elsevier, vol. 167(2), pages 336-348, December.
    4. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    5. Guinet, Alain & Legrand, Marie, 1998. "Reduction of job-shop problems to flow-shop problems with precedence constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 96-110, August.
    6. Monaci, Marta & Agasucci, Valerio & Grani, Giorgio, 2024. "An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents," European Journal of Operational Research, Elsevier, vol. 312(3), pages 910-926.
    7. Chen, Haoxun & Luh, Peter B., 2003. "An alternative framework to Lagrangian relaxation approach for job shop scheduling," European Journal of Operational Research, Elsevier, vol. 149(3), pages 499-512, September.
    8. Land, Martin & Gaalman, Gerard, 1996. "Workload control concepts in job shops A critical assessment," International Journal of Production Economics, Elsevier, vol. 46(1), pages 535-548, December.
    9. Drexl, Andreas & Salewski, Frank, 1996. "Distribution Requirements and Compactness Constraints in School Timetabling. Part II: Methods," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 384, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    10. Böttcher, Jan & Drexl, Andreas & Kolisch, Rainer & Salewski, Frank, 1996. "Project scheduling under partially renewable resource constraints," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 398, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    11. Branke, Juergen & Pickardt, Christoph W., 2011. "Evolutionary search for difficult problem instances to support the design of job shop dispatching rules," European Journal of Operational Research, Elsevier, vol. 212(1), pages 22-32, July.
    12. Libralesso, Luc & Focke, Pablo Andres & Secardin, Aurélien & Jost, Vincent, 2022. "Iterative beam search algorithms for the permutation flowshop," European Journal of Operational Research, Elsevier, vol. 301(1), pages 217-234.
    13. F. Guerriero, 2008. "Hybrid Rollout Approaches for the Job Shop Scheduling Problem," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 419-438, November.
    14. Reményi, Christoph & Staudacher, Stephan, 2014. "Systematic simulation based approach for the identification and implementation of a scheduling rule in the aircraft engine maintenance," International Journal of Production Economics, Elsevier, vol. 147(PA), pages 94-107.
    15. Beemsterboer, Bart & Land, Martin & Teunter, Ruud & Bokhorst, Jos, 2017. "Integrating make-to-order and make-to-stock in job shop control," International Journal of Production Economics, Elsevier, vol. 185(C), pages 1-10.
    16. Dayong Han & Qiuhua Tang & Zikai Zhang & Zixiang Li, 2020. "An Improved Migrating Birds Optimization Algorithm for a Hybrid Flow Shop Scheduling within Steel Plants," Mathematics, MDPI, vol. 8(10), pages 1-28, September.
    17. Seifert, Ralf W. & Morito, Susumu, 2001. "Cooperative dispatching - exploiting the flexibility of an FMS by means of incremental optimization," European Journal of Operational Research, Elsevier, vol. 129(1), pages 116-133, February.
    18. Jan Gmys, 2022. "Exactly Solving Hard Permutation Flowshop Scheduling Problems on Peta-Scale GPU-Accelerated Supercomputers," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2502-2522, September.
    19. Heng Zhang & Utpal Roy, 2019. "A semantics-based dispatching rule selection approach for job shop scheduling," Journal of Intelligent Manufacturing, Springer, vol. 30(7), pages 2759-2779, October.
    20. repec:dgr:rugsom:95a42 is not listed on IDEAS
    21. Tzafestas, Spyros & Triantafyllakis, Alekos, 1993. "Deterministic scheduling in computing and manufacturing systems: a survey of models and algorithms," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(5), pages 397-434.

    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:12:y:2024:i:10:p:1463-:d:1390837. 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.