Skip to Main content Skip to Navigation
Conference papers

A hybrid genetic algorithm for parallel machine scheduling problem with consumable resources

Abstract : This paper deals with the scheduling problem on identical parallel machines when each job depends on the amount of consumed resource and is characterized by different resource requirements. A typical workshop configuration is chosen for detailed study and analysis under several assumptions. This problem is known as NP-hard. To solve it, an integer linear programming based position variables and a genetic algorithm are proposed. A local search procedure is proposed to provide improved solutions. Since small instances of the problem can be solved optimally, the genetic algorithm (with and without local search) were compared to an exact resolution method which enumerates all possible solutions determined from a mathematical model. However, for medium or large instances, the proposed approaches effectiveness is checked on the basis of a heuristic. The analysis of results reveals that the hybrid genetic algorithm performs the best for different structure.
Document type :
Conference papers
Complete list of metadata
Contributor : Daniel Gavrysiak Connect in order to contact the contributor
Submitted on : Wednesday, February 12, 2020 - 4:49:44 PM
Last modification on : Friday, August 27, 2021 - 3:14:07 PM





Fayçal Belkaid, Zaki Sari, Farouk Yalaoui. A hybrid genetic algorithm for parallel machine scheduling problem with consumable resources. 2013 International Conference on Control, Decision and Information Technologies (CoDIT), May 2013, Hammamet, France. pp.143-148, ⟨10.1109/CoDIT.2013.6689534⟩. ⟨hal-02476469⟩



Record views