Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658)

scientific article; zbMATH DE number 7549384

Language	Label	Description	Also known as
English	Predictive Search for Capacitated Multi-Item Lot Sizing Problems	scientific article; zbMATH DE number 7549384

Statements

instance of

scholarly article

0 references

title

Predictive Search for Capacitated Multi-Item Lot Sizing Problems (English)

0 references

author

Tao Wu

0 references

published in

INFORMS Journal on Computing

0 references

publication date

28 June 2022

0 references

zbMATH Keywords

optimization

0 references

machine learning

0 references

advanced analytics

0 references

logistic regression

0 references

mixed integer programming

0 references

lot sizing

0 references

production planning

0 references

describes a project that uses

bc-prod

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1287/ijoc.2021.1073

0 references

cites work

MIP-based heuristics for multi-item capacitated lot-sizing problem with setup times and shortage costs

0 references

A heuristic approach for big bucket multi-level production planning problems

0 references

Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems

0 references

A hybrid optimization approach for multi-level capacitated lot-sizing problems

0 references

Strong Formulations for Multi-Item Capacitated Lot Sizing

0 references

bc — prod: A Specialized Branch-and-Cut System for Lot-Sizing Problems

0 references

Mathematical Programming Approaches to Capacity-Constrained MRP Systems: Review, Formulation and Problem Reduction

0 references

The Multi-Item Capacitated Lot Size Problem: Error Bounds of Manne's Formulations

0 references

A cutting plane approach to capacitated lot-sizing with start-up costs

0 references

Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times

0 references

A New Dantzig-Wolfe Reformulation and Branch-and-Price Algorithm for the Capacitated Lot-Sizing Problem with Setup Times

0 references

A Lagrangean Relaxation Approach for Very-Large-Scale Capacitated Lot-Sizing

0 references

Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition

0 references

Q5287175

0 references

Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems

0 references

Deterministic Production Planning: Algorithms and Complexity

0 references

A Horizon Decomposition Approach for the Capacitated Lot-Sizing Problem with Setup Times

0 references

A Tabu-Search Heuristic for the Capacitated Lot-Sizing Problem with Set-up Carryover

0 references

A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem

0 references

Solving uncapacitated multilevel lot-sizing problems using a particle swarm optimization with flexible inertial weight

0 references

An efficient dynamic programming algorithm for a special case of the capacitated lot-sizing problem

0 references

Q4521593

0 references

Improved lower bounds for the capacitated lot sizing problem with setup times.

0 references

Q4300101

0 references

Q4139966

0 references

Approximation Algorithms for the Capacitated Multi-Item Lot-Sizing Problem via Flow-Cover Inequalities

0 references

A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case

0 references

A hybrid adaptive large neighborhood search heuristic for lot-sizing with setup times

0 references

Comparing Dantzig–Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot sizing problem

0 references

A MAX-MIN ant system for unconstrained multi-level lot-sizing problems

0 references

Solving Multi-Item Lot-Sizing Problems Using Strong Cutting Planes

0 references

An Algorithm for Single-Item Capacitated Economic Lot Sizing with Piecewise Linear Production Costs and General Holding Costs

0 references

Nested Partitions Method for Global Optimization

0 references

Random effects logistic regression model for default prediction of technology credit guarantee fund

0 references

Single item lot-sizing problems with backlogging on a single machine at a finite production rate

0 references

Reformulations of the shortest route model for dynamic multi-item multi-level capacitated lotsizing

0 references

Multilevel Lot Sizing with Setup Times and Multiple Constrained Resources: Internally Rolling Schedules with Lot-Sizing Windows

0 references

Lagrangean relaxation based heuristics for lot sizing with setup times

0 references

Adaptive partitioned random search to global optimization

0 references

A Lagrangean-Based Heuristic for Dynamic Multilevel Multiitem Constrained Lotsizing with Setup Times

0 references

A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging

0 references

Relaxations for two-level multi-item lot-sizing problems

0 references

Analytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical Machines

0 references

An MIP-based interval heuristic for the capacitated multi-level lot-sizing problem with setup times

0 references

A Lagrangian relaxation-based method and models evaluation for multi-level lot sizing problems with backorders

0 references

A variable neighborhood search with an effective local search for uncapacitated multilevel lot-sizing problems

0 references

Identifiers

zbMATH Open document ID

1492.90016

0 references

DOI

10.1287/ijoc.2021.1073

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5084658