Pages that link to "Item:Q2433465"

The following pages link to A Lagrangian-based heuristic for the capacitated lot-sizing problem in parallel machines (Q2433465):

Displaying 31 items.

• A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem (Q319274) (← links)
• A GLNPSO for multi-level capacitated lot-sizing and scheduling problem in the poultry industry (Q322535) (← links)
• A genetic algorithm/mathematical programming approach to solve a two-level soft drink production problem (Q337043) (← links)
• Model-based automatic neighborhood design by unsupervised learning (Q337347) (← links)
• A hybrid Lagrangian-simulated annealing-based heuristic for the parallel-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times (Q342038) (← links)
• Hybrid methods for lot sizing on parallel machines (Q342050) (← links)
• Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items (Q342353) (← links)
• Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines (Q490153) (← links)
• Tabu search with path relinking for an integrated production-distribution problem (Q632656) (← links)
• Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
• Research on construction and application for the model of multistage job shop scheduling problem (Q782293) (← links)
• A coupling cutting stock-lot sizing problem in the paper industry (Q940851) (← links)
• Solution approaches for the soft drink integrated production lot sizing and scheduling problem (Q1027560) (← links)
• Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants (Q1040968) (← links)
• GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem (Q1044091) (← links)
• The green capacitated multi-item lot sizing problem with parallel machines (Q1651651) (← links)
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration (Q1652297) (← links)
• Optimization model for a production, inventory, distribution and routing problem in small furniture companies (Q1752350) (← links)
• A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (Q1782152) (← links)
• A Lagrangean-based heuristic for multi-plant, multi-item, multi-period capacitated lot-sizing problems with inter-plant transfers (Q1886858) (← links)
• A Lagrangian heuristic for capacitated single item lot sizing problems (Q2351162) (← links)
• Mathematical programming based heuristics for the 0--1 MIP: a survey (Q2401328) (← links)
• Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company (Q2480208) (← links)
• MIP Formulations for a Rich Real-World Lot-Sizing Problem with Setup Carryover (Q2835669) (← links)
• A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures (Q2907902) (← links)
• Parallel Lagrangean approximation procedure (Q3157791) (← links)
• Capacitated lot-sizing and scheduling with parallel machines, back-orders, and setup carry-over (Q3636786) (← links)
• 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) (← links)
• Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines (Q5131723) (← links)
• A learn‐and‐construct framework for general mixed‐integer programming problems (Q6066679) (← links)
• A heuristic approach for the integrated production-transportation problem with process flexibility (Q6551098) (← links)