Analysis of Scheduling Policies in Metaheuristics for Evolutionary Biology
Abstract
References
Index Terms
- Analysis of Scheduling Policies in Metaheuristics for Evolutionary Biology
Recommendations
Enriched metaheuristics for the resource constrained unrelated parallel machine scheduling problem
Highlights- The problem of unrelated parallel machines with an additional resource is considered.
AbstractA Scatter Search algorithm together with an enriched Scatter Search and an enriched Iterated Greedy for the unrelated parallel machine problem with one additional resource are proposed in this paper. The optimisation objective is to ...
Metaheuristics for the single machine weighted quadratic tardiness scheduling problem
This paper considers the single machine scheduling problem with weighted quadratic tardiness costs. Three metaheuristics are presented, namely iterated local search, variable greedy and steady-state genetic algorithm procedures. These address a gap in ...
Metaheuristics for minimizing the makespan of the dynamic shop scheduling problem
For the shop scheduling problems such as flow-shop, job-shop, open-shop, mixed-shop, and group-shop, most research focuses on optimizing the makespan under static conditions and does not take into consideration dynamic disturbances such as machine ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
- Research
- Refereed limited
Conference
Acceptance Rates
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 38Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)1
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in