Exact algorithms for the order picking problem
, 2018 International audienceOrder picking is the problem of collecting a set of products in a warehouse in a minimum amount of time. It is currently a major bottleneck in supply-chain because of its cost in time and labor force. This article presents two exact
Catusse, Nicolas +2 more
core +1 more source
Solving the Bottleneck Traveling Salesman Problem Using the Lin-Kernighan-Helsgaun Algorithm [PDF]
, 2014 Helsgaun, Keld, Keld Helsgaun
openaire +2 more sources
Uma abordagem híbrida do problema da programação da produção através dos algoritmos simulated annealing e genético / [PDF]
, 1999 Tese (Doutorado) - Universidade Federal de Santa Catarina, Centro ...
Mazzucco Júnior, José
core
Optimization in the Photolithography Bay: Scheduling and the Traveling Salesman Problem
, 2019 In a semiconductor factory, integrated circuits (or chips) are constructed on top of slabs of silicon, called wafers. The construction of these wafers is complicated and many different processing steps are needed to gradually building the chip layer by ...
Janssen, T.M.L. (author) +1 more
core +1 more source
Tolerance based algorithms for the ATSP
, 2004 In this paper we use arc tolerances, instead of arc costs, to improve Branch-and-Bound type algorithms for the Asymmetric Traveling Salesman Problem (ATSP).
Goldengorin, B +2 more
core +3 more sources
Escalonamento de tarefas job-shop realistas utilizando algoritmos genéticos em MATLAB [PDF]
, 2000 Dissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Engenharia Elétrica.Esta dissertação aborda o desenvolvimento e a implementação de um sistema para escalonamento de tarefas do tipo job-shop.
Beck, Felipe Luís
core
Restricted Dynamic Programming Heuristic for Precedence Constrained Bottleneck Generalized TSP [PDF]
, 2015 We develop a restricted dynamical programming heuristic for a complicated traveling salesman problem: a) cities are grouped into clusters, resp.
Salii, Y.
core
, 2015 The vehicle routing problem with stochastic demands and customers (VRPSDC) requires finding the optimal route for a capacitated vehicle that delivers goods to a set of customers, where each customer has a fixed probability of requiring being visited and ...
Dorigo, Marco +3 more
core +1 more source
A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
The traveling salesman (or salesperson) problem, short TSP, is of strong interest to many researchers from mathematics, economics, and computer science.
Koehler, Jana +2 more
core +1 more source
Minimizing the number of workers in a paced mixed-model assembly line
, 2019 International audienceWe study a problem of minimizing the maximum number of identical workers over all cycles of a paced assembly line comprised of m stations and executing n parts of k types.
Sergey Kovalev +7 more
core +1 more source