Hybrid methods for lot sizing on parallel machines (Q342050)

From MaRDI portal

Revision as of 00:08, 9 December 2024 by Import241208021249 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Hybrid methods for lot sizing on parallel machines	scientific article

Statements

scholarly article

0 references

Hybrid methods for lot sizing on parallel machines (English)

0 references

Diego Jacinto Fiorotto

0 references

Silvio Alexandre de Araujo

0 references

0 references

Computers \& Operations Research

0 references

publication date

17 November 2016

0 references

zbMATH Keywords

lot sizing

0 references

parallel machines

0 references

reformulation

0 references

hybrid methods

0 references

Dantzig-Wolfe decomposition

0 references

Lagrangian relaxation

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2015.04.015

0 references

Period Decompositions for the Capacitated Lot Sizing Problem with Setup Times

0 references

Branch-and-Price: Column Generation for Solving Huge Integer Programs

0 references

Dual-Optimal Inequalities for Stabilized Column Generation

0 references

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

0 references

Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods

0 references

0 references

Economic Lot Scheduling for Multiple Products on Parallel Identical Processors

0 references

Set partitioning and column generation heuristics for capacitated dynamic lotsizing

0 references

A Dual Ascent and Column Generation Heuristic for the Discrete Lotsizing and Scheduling Problem with Setup Times

0 references

Decomposition Principle for Linear Programs

0 references

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

0 references

Dynamic Production Scheduling for a Process Industry

0 references

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

0 references

Reformulation and a Lagrangian heuristic for lot sizing problem on parallel machines

0 references

New developments in the primal-dual column generation technique

0 references

Efficient Solution of the Single-item, Capacitated Lot-sizing Problem with Start-up and Reservation Costs

0 references

Solving the CLSP by a Tabu Search Heuristic

0 references

Combining Column Generation and Lagrangian Relaxation

0 references

Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints

0 references

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

0 references

Lotsizing and Scheduling on Parallel Machines with Sequence-Dependent Setup Costs

0 references

An Efficient Algorithm for Multi-Item Scheduling

0 references

Capacitated lot sizing and scheduling with parallel machines and shared buffers: A case study in a packaging company

0 references

Simultaneous lotsizing and scheduling on parallel machines

0 references

A decomposition approach for the general lotsizing and scheduling problem for parallel production lines

0 references

Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions

0 references

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

0 references

Some Extensions of the Discrete Lotsizing and Scheduling Problem

0 references

Statistical search methods for lotsizing problems

0 references

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

0 references

A heuristic for the dynamic multi-level capacitated lotsizing problem with linked lotsizes for general product structures

0 references

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

0 references

Dynamic Version of the Economic Lot Size Model

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1016/J.COR.2015.04.015

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:342050

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q342050&oldid=38070381"