Abstract
Investigations on Genetic Algorithm Performances in a Parallel Machines Scheduling Environment
Highlights
Since the consideration of consumable resources becomes one of the strategic competitive tools to ensure companies performance and the stability of their production systems
Heuristics based on the processing time, it is observed that Longest Processing Time First (LPT) which is known as the most suitable sequencing rule for this problem behaves better than Shortest Processing Time First (SPT) for all cases
It is observed that Longest Processing-time-to-resources-consumption Ratios First (L-PT/RC) and SPT heuristics lead respectively to the best and the worst values for the studied performances indicators it can be noted that LPT outperform SPT for all cases
Summary
Since the consideration of consumable resources becomes one of the strategic competitive tools to ensure companies performance and the stability of their production systems. This study considers a parallel machines scheduling problem with non-renewable resources
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
