A tabu search heuristic for the multiprocessor scheduling problem with sequence dependent setup times
✍ Scribed by Paulo M. França; Michel Gendreau; Gilbert Laporte; Felipe M. Müller
- Publisher
- Elsevier Science
- Year
- 1996
- Tongue
- English
- Weight
- 961 KB
- Volume
- 43
- Category
- Article
- ISSN
- 0925-5273
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The vehicle routing problem with back-hauls involves the design of a set of minimum cost routes, originating and terminating at a central depot, for a set of vehicles to service a set of customers with known quantities to be either delivered or collected. This paper describes two route-construction
## Abstract This article addresses the well‐known Capacitated Vehicle Routing Problem (CVRP), in the special case where the demand of a customer consists of a certain number of two‐dimensional weighted items. The problem calls for the minimization of the cost of transportation needed for the delive
In the article, "A Tabu Search Heuristic for the Vehicle Routing Problem with Two-Dimensional Loading Constraints" by M. Gendreau et al., which appeared in the January issue of Networks (Networks 51 (2008), 4-18), the last author's name was misspelled. Silvano Martello's name was inadvertently spell