Efficient utilization of algorithms through heuristic learning
Abstract
References
Recommendations
Efficient heuristic algorithms for the blocking flow shop scheduling problem with total flow time minimization
Two efficient constructive heuristics for the Fm|block|Ci are proposed.We show that the insertion phase of heuristic NEH can worsen the solution.The structure of each constructive method is used in a GRASP combined with VNS.The computational evaluation ...
An efficient deterministic heuristic for two-dimensional rectangular packing
This paper proposes a deterministic heuristic, a best fit algorithm (BFA), for solving the NP-hard two-dimensional rectangular packing problem to maximize the filling rate of a rectangular sheet. There are two stages in this new approach: the ...
Hybrid heuristic algorithms for single machine total weighted tardiness scheduling problems
This paper addresses on solving a well known Non Polynomial (NP) hard type problem, namely the single machine total weighted-tardiness problem. The performances of three hybrid heuristic algorithms to solve the single machine scheduling problems with ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 123Total Downloads
- Downloads (Last 12 months)28
- Downloads (Last 6 weeks)5
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in