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 (Q4905621): Difference between revisions

Revision as of 04:36, 6 July 2024

scientific article; zbMATH DE number 6137254

Language	Label	Description	Also known as
English	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	scientific article; zbMATH DE number 6137254

Statements

instance of

scholarly article

0 references

title

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 (English)

0 references

author

Reinaldo Morabito

0 references

Eli Angela Vitor Toso

0 references

Alistair Richard Clark

0 references

published in

Pesquisa Operacional

0 references

publication date

19 February 2013

0 references

full work available at URL

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

0 references

zbMATH Keywords

lot sizing

0 references

scheduling

0 references

production sequencing

0 references

animal nutrition industry

0 references

ATSP

0 references

GLSP

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems

0 references

Q4872059

0 references

The job shop scheduling problem: Conventional and new solution techniques

0 references

A new memetic algorithm for the asymmetric traveling salesman problem

0 references

Exact solution of large-scale, asymmetric traveling salesman problems

0 references

Q4801179

0 references

Rolling-horizon lot-sizing when set-up times are sequence-dependent

0 references

Proportional lot sizing and scheduling: Some extensions

0 references

Lot sizing and scheduling -- survey and extensions

0 references

The discrete lot-sizing and scheduling problem with sequence-dependent setup costs

0 references

The general lotsizing and scheduling problem

0 references

A heuristic method for lot-sizing in multi-stage systems

0 references

On patching algorithms for random asymmetric travelling salesman problems

0 references

When Is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem?

0 references

Scheduling manufacturing systems with work-in-process inventory control: multiple-part-type systems

0 references

Construction heuristics for the asymmetric TSP.

0 references

Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

0 references

Q3995531

0 references

Capacitated lot-sizing with sequence dependent setup costs

0 references

A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem

0 references

The traveling salesman problem: An overview of exact and approximate algorithms

0 references

A Cutting Planes Algorithm for the m-Salesmen Problem

0 references

Q5187226

0 references

Multi-Item Single-Level Capacitated Dynamic Lot-Sizing Heuristics: A General Review

0 references

Simultaneous lotsizing and scheduling by combining local search with dual reoptimization

0 references

Simultaneous lotsizing and scheduling on parallel machines

0 references

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems

0 references

Teaching Integer Programming Formulations Using the Traveling Salesman Problem

0 references

Q3525910

0 references

Production Planning by Mixed Integer Programming

0 references

Scheduling with batching: A review

0 references

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

0 references

Um modelo de otimização para o problema integrado de dimensionamento de lotes e programação da produção em fábricas de refrigerantes

0 references

A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines

0 references

Q3998259

0 references

Q4254875

0 references

A note on the complexity of the asymmetric traveling salesman problem

0 references

Identifiers

zbMATH Open document ID

1257.90026

0 references

DOI

10.1590/S0101-74382008000300003

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4905621

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