An Effective Metaheuristic Algorithm for Uniform Parallel Machine Scheduling with Resource Consumption Restriction to Minimize The Maximum Lateness

Authors

  • Jianfu Chen School of Management, Hefei University of Technology, Hefei, China | ESIEE Paris & COSYS-GRETTIA, Université Gustave Eiffel, Paris, France
  • Kai Li School of Management, Hefei University of Technology, Hefei, China | Key Laboratory of Process Optimization and Intelligent Decision-making, Ministry of Education, Hefei, China
  • Fulong Xie School of Management, Hefei University of Technology, Hefei, China
  • Chengbin Chu ESIEE Paris & COSYS-GRETTIA, Université Gustave Eiffel, Paris, France

DOI:

https://doi.org/10.23055/ijietap.2024.31.6.10345

Keywords:

Parallel machine scheduling, Maximum lateness, Resource consumption restriction, Simulated annealing algorithm

Abstract

This paper addresses a uniform parallel machine scheduling problem with resource consumption restriction. The objective is to minimize the maximum lateness under the constraint that the total resource consumption cannot exceed the given budget. To solve this NP-hard problem, a mixed integer programming model is first developed to obtain the exact solution for small-sized instances. Afterward, an effective simulated annealing (SA) algorithm with a repairing procedure is designed to generate near-optimal solutions within reasonable CPU time. The performance of the designed algorithm is evaluated by comparing it with two metaheuristic algorithms adapted from the relevant literature that address similar scheduling problems. The experimental and statistical results show that for small-sized instances, the proposed SA can optimally solve 99.13% of these instances, significantly outperforming its competitors. For large-sized instances, it is shown that the proposed SA can provide the best solution for 97.88% of these instances, markedly surpassing its competitors.

Downloads

Published

2024-12-16

How to Cite

Chen, J., Li, K., Xie, F., & Chu, C. (2024). An Effective Metaheuristic Algorithm for Uniform Parallel Machine Scheduling with Resource Consumption Restriction to Minimize The Maximum Lateness. International Journal of Industrial Engineering: Theory, Applications and Practice, 31(6). https://doi.org/10.23055/ijietap.2024.31.6.10345

Issue

Vol. 31 No. 6 (2024)

Section

Production Planning and Control

License

The Author(s) must formally transfer each article's copyright before publication in the INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING. Such transfer enables the Journal to defend itself against plagiarism and other forms of copyright infringement. Your cooperation is appreciated.

You agree that the copyright of your article to be published in the INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE is hereby transferred, throughout the World and for the full term and all extensions and renewals thereof, to INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE.

The Author(s) reserve(s): (a) the trademark rights and patent rights, if any, and (b) the right to use all or part of the information contained in this article in future, non-commercial works of the Author's own, or, if the article is a "work-for-hire" and made within the scope of the Author's employment, the employer may use all or part of the information contained in this article for intra-company use, provided the usual acknowledgments are given regarding copyright notice and reference to the original publication.

The Author(s) warrant(s) that the article is Author's original work and has not been published before. If excerpts from copyrighted works are included, the Author will obtain written permission from the copyright owners and credit the article's sources.

The author also warrants that the article contains no libelous or unlawful statements and does not infringe on the rights of others. If the article was prepared jointly with other Author(s), the Author agrees to inform the co-Author(s) of the terms of the copyright transfer and to sign on their behalf; or in the case of a "work-for-hire," the employer or an authorized representative of the employer.

The journal does not provide the author copy of the final paper when it is published. The author(s) can make(s) a subscription to INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING - THEORY, APPLICATIONS, AND PRACTICE if they want to get the final paper that has already been published.

The journal is registered with the Library of Congress (ISSN # 1943-670X). All rights reserved. No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, or otherwise, without the prior written permission of the journal.

The author reserves patent and trademark rights and the right to use all or part of the information contained in the article in future non-commercial works.