Combinação de abordagens GLSP e ATSP para o problema de dimensionamento e sequenciamento de lotes de produção de suplementos para nutrição animal

DOI10.1590/S0101-74382008000300003zbMath1257.90026MaRDI QIDQ4905621

Reinaldo Morabito, Alistair Richard Clark, Eli Angela Vitor Toso

Publication date: 19 February 2013

Published in: Pesquisa Operacional (Search for Journal in Brave)

Full work available at URL: http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382008000300003&lng=en&nrm=isoce&tlng=pt

zbMATH Keywords

scheduling; ATSP; lot sizing; animal nutrition industry; GLSP; production sequencing

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

90B30: Production models

90C27: Combinatorial optimization

Cites Work

• The traveling salesman problem: An overview of exact and approximate algorithms
• The job shop scheduling problem: Conventional and new solution techniques
• Solving the discrete lotsizing and scheduling problem with sequence dependent set-up costs and set-up times using the travelling salesman problem with time windows
• Lot sizing and scheduling -- survey and extensions
• The discrete lot-sizing and scheduling problem with sequence-dependent setup costs
• A heuristic method for lot-sizing in multi-stage systems
• A note on the complexity of the asymmetric traveling salesman problem
• The general lotsizing and scheduling problem
• Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
• Simultaneous lotsizing and scheduling on parallel machines
• A new memetic algorithm for the asymmetric traveling salesman problem
• On patching algorithms for random asymmetric travelling salesman problems
• Capacitated lot-sizing with sequence dependent setup costs
• Scheduling with batching: A review
• Simultaneous lotsizing and scheduling by combining local search with dual reoptimization
• A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Um modelo de otimização para o problema integrado de dimensionamento de lotes e programação da produção em fábricas de refrigerantes
• Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review
• A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem
• A Cutting Planes Algorithm for the m-Salesmen Problem
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Exact solution of large-scale, asymmetric traveling salesman problems
• Scheduling manufacturing systems with work-in-process inventory control: multiple-part-type systems
• Teaching Integer Programming Formulations Using the Traveling Salesman Problem
• Rolling-horizon lot-sizing when set-up times are sequence-dependent
• Proportional lot sizing and scheduling: Some extensions
• When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?
• Production Planning by Mixed Integer Programming
• Construction heuristics for the asymmetric TSP.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item