A multi-level composite heuristic for the multi-depot vehicle fleet mix problem
Article Abstract:
A multi-level composite heuristic is employed on benchmark problems, producing solutions which are on average just 1% above the prefect solution but needing only 5 to 10% of the computing time. The benchmark problems differed in size from 50 to 360 clients, 2 to 9 depots and 5 varying vehicle capacities. The proposed heuristic approach is a good compromise between simple composite heuristics and improved but more time consuming tabu search based methods.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1997
User Contributions:
Comment about this article or add new information about this topic:
Group technology in a hybrid flowshop environment: a case study
Article Abstract:
A case study based Spanish tile industry for solving the problems of products grouping is presented. Classification of families into groups based on their requirements helps the production manager in minimizing the production times for given products, and makes optimal use of the facility.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
A heuristic to schedule flexible job-shop in a glass factory
Article Abstract:
A scheduling system designed and implemented in glass factory is described. It is similar to job-shop scheduling with special operational features. Performance results of the system are analyzed using algorithms.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2005
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: Stronger K-tree relaxations for the vehicle routing problem. A graph-oriented approach for the minimization of the number of late jobs for the parallel machines scheduling problem
- Abstracts: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. A Lagrangean relax-and-cut approach for the two-stage capacitated facility location problem
- Abstracts: A branch-and-bound algorithm for the mini-max spanning forest problem. An improved algorithm to determine lower bounds for fixed spectrum frequency assignment problem
- Abstracts: Network decomposition-based benchmark results for the discrete time-cost tradeoff problem. part 2 An introduction to multi-parameter complexity analysis of discrete problems