A Genetic Algorithm for the Parallel Machine Scheduling Problem with Consumable Resources-Reference-Cited by-同舟云学术

A Genetic Algorithm for the Parallel Machine Scheduling Problem with Consumable Resources

Published:2013-04 Issue:2 Volume:4 Page:17-30
ISSN:1947-8283
Container-title:International Journal of Applied Metaheuristic Computing
language:en
Short-container-title:

Author:

Belkaid Fayçal¹^ORCID,Sari Zaki¹,Souier Mehdi²

Affiliation:

1. Manufacturing Engineering Laboratory of Tlemcen, University of Tlemcen, Tlemcen, Algeria

2. Manufacturing Engineering Laboratory of Tlemcen, University of Tlemcen, Tlemcen, Algeria, & Tlemcen Preparatory School of Economics, Tlemcen, Algeria

Abstract

In this paper, the authors’ interest is focused on the scheduling problem on identical parallel machines with consumable resources in order to minimize the makespan criterion. Each job consumes several components which arrive at different times. The arrival of each component is represented by a curve-shaped staircase. This problem is NP-hard, further, there are not universal methods making it possible to solve all the cases effectively, especially for medium or large instances. A genetic algorithm is proposed to solve this problem due to proven great performance in solving combinatorial optimization problems. To check its effectiveness this algorithm is compared with an exact resolution method which enumerates all possible solutions for small instances and with a heuristic for large instances. Various randomly generated instances, which can represent realistic situations, are tested. The computation results show that this algorithm outperforms heuristic procedure and is tailored for larger scale problems.

Publisher

IGI Global

Subject

Decision Sciences (miscellaneous),Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Computer Science Applications,Modeling and Simulation,Statistics and Probability

Reference34 articles.

1. A survey of scheduling problems with setup times or costs

2. Belkaid, F., Yalaoui, F., & Sari, Z. (2012). A genetic algorithm for parallel machine scheduling with consumable resources to minimize makespan. In Proceedings of the 4th International Conference on Metaheuristics and Nature Inspired Computing, META 2012, Sousse, Tunisia.

3. Solving rcpsp with resources production possibility by tasks. In Proceedings of the MHOSI'2005, Hammamet, Tunisia, Brucker, P., Drexl, A., Mohring, R., Neumann, K., & Pesch, E. (1999). Resource constrained project scheduling: Notations, classification, models and methods.;H.Bouly;European Journal of Operational Research,2005

4. The project scheduling problem with production and consumption of resources: A list-scheduling based algorithm

5. Carrera, S., Portmann, M. C., & Ramdane Cherif, W. (2010). Scheduling supply chain node with fixed components arrivals and two partially flexible deliveries. In Proceedings of the 5th International Conference on Management and Control of Production and Logistics.

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Stochastic customer order scheduling on heterogeneous parallel machines with resource allocation consideration;Computers & Industrial Engineering;2021-10

2. Search for Prioritized Test Cases during Web Application Testing;International Journal of Applied Metaheuristic Computing;2019-04

3. Comparative Analysis of Heuristic Algorithms Used for Solving a Production and Maintenance Planning Problem (PMPP);Applied Sciences;2018-07-05

4. An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints;International Journal of Information Systems and Supply Chain Management;2016-07

5. Heuristics for solving flow shop scheduling problem under resources constraints;IFAC-PapersOnLine;2016