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

@article{Belkaid2013AGA,
  title={A Genetic Algorithm for the Parallel Machine Scheduling Problem with Consumable Resources},
  author={Fayçal Belkaid and Zaki Sari and Mehdi Souier},
  journal={Int. J. Appl. Metaheuristic Comput.},
  year={2013},
  volume={4},
  pages={17-30}
}
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… 
Efficient Approach for Parallel Machine Scheduling Problem
TLDR
The simulation results show that the proposed metaheuristic approach based genetic algorithm gives the same results as the exact method for small instances and performs the best compared to heuristics for medium and large instances.
Investigations on Performance Evaluation of Scheduling Heuristics and Metaheuristics in a Parallel Machine Environment
TLDR
The results of a simulation study of parallel machines environment when each job is characterized by different non-renewable resources requirements show that the hybrid genetic algorithm is able to find an optimal solution for small-sized problems within a reasonable computation time; also it outperforms genetic algorithm and heuristics methods for large-sized Problems.
An Efficient Approach for the Reentrant Parallel Machines Scheduling Problem under Consumable Resources Constraints
TLDR
The simulation results demonstrate that the presented algorithm is able to find an optimal solution for small-sized problems and can effectively find a near optimal solution to minimize the makespan of the considered problem.
A Non-Permutation Flow Shop Manufacturing Cell Scheduling Problem with Part's Sequence Dependent Family Setup Times
TLDR
A new mathematical model for a dynamic flow shop manufacturing cell scheduling problem (DFMCSP) with agreeable job release date for each part family is presented and meta-heuristic methods such as Genetic Algorithms and Tabu Search are proposed.
Impacts of Scheduling Decisions Based On PSO Algorithm and Dispatching Rules on FMS Performances
TLDR
The simulation results evaluated in terms of the productivity and the utilisation of the system show that the proposed PSO algorithm performs the best when it is combined with LWR as part launching rule and SPT as machine sequencing rule.
Parallel Scatter Search Algorithms for Exam Timetabling
TLDR
Empirical results show that the proposed parallel scatter search algorithms yield good speed-up and improve solution quality because they explore larger parts of the search space within reasonable time, in contrast with the sequential algorithm.
The Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
TLDR
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem, and utilizes a simulation approach to determine feasible solutions, under the current constraints.
Search for Prioritized Test Cases during Web Application Testing
TLDR
Experiments were performed on three web applications, one of which had never been tested before, and the design of the algorithm itself was new.
...
1
2
...

References

SHOWING 1-10 OF 39 REFERENCES
Comparing meta-heuristic approaches for parallel machine scheduling problems
TLDR
This paper compares the performance of two meta-heuristic methods proposed to solve the identical parallel machine scheduling problem with sequence dependent setup times by combining a population-based method with local search procedures.
Minimizing flow-time variance in a single-machine system using genetic algorithms
TLDR
The proposed spreadsheet-based genetic algorithm approach is found to perform better than the previous GA, simulated annealing (SA) and Tabu search (TS) approaches for variance minimization in that it produces an optimal solution for all the test problems.
Minimizing total tardiness for the machine scheduling and worker assignment problems in identical parallel machines using genetic algorithms
TLDR
The paper demonstrates an adaptation of the proprietary GA software to the problem of minimizing total tardiness for the worker assignment scheduling problem for identical parallel machine models and shows that the spreadsheet GA implementation makes it very easy to adapt the problem for any set of objective measures without changing the actual model.
Minimizing flow time for the worker assignment problem in identical parallel machine models using GA
TLDR
A spreadsheet-based domain independent general purpose genetic algorithm, an add-in to the spreadsheet software, is used to solve the problem of minimizing total flow time for the worker assignment scheduling problem for identical parallel machine models.
An effective genetic algorithm for the flexible job-shop scheduling problem
...
1
2
3
4
...