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

From MaRDI portal
Publication:2901053

DOI10.1287/ijoc.1080.0283zbMath1243.90147OpenAlexW3123954394MaRDI QIDQ2901053

Raf Jans

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1080.0283




Related Items (24)

Parallel Machine Scheduling Under Uncertainty: Models and Exact AlgorithmsA tabu search algorithm for application placement in computer clusteringSymmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designsHybrid methods for lot sizing on parallel machinesMathematical programming-based approaches for multi-facility Glass container production planningIdentical parallel machine scheduling with assurance of maximum waiting time for an emergency jobA branch-and-cut approach for the distributed no-wait flowshop scheduling problemThe consistent production routing problemScheduling multi-staged jobs on parallel identical machines and a central server with sequence-dependent setup times: an application to an automated kitchenVessel Service Planning in SeaportsSymmetry-breaking inequalities for ILP with structured sub-symmetryA Matheuristic for the Multivehicle Inventory Routing ProblemFormulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing ProblemsAnalytics Branching and Selection for the Capacitated Multi-Item Lot Sizing Problem with Nonidentical MachinesExact solution approaches for the discrete lot-sizing and scheduling problem with parallel resourcesReformulation and a Lagrangian heuristic for lot sizing problem on parallel machinesSingle and parallel machine capacitated lotsizing and scheduling: new iterative MIP-based neighborhood search heuristicsClassification and literature review of integrated lot-sizing and cutting stock problemsA matheuristic for parallel machine scheduling with tool replacementsPrice-and-verify: a new algorithm for recursive circle packing using Dantzig-Wolfe decompositionParallel machine scheduling with tool loadingOperations planning test bed under rolling horizons, multiproduct, multiechelon, multiprocess for capacitated production planning modelling with \textit{strokes}Profitable mixed capacitated arc routing and related problemsModels and algorithms for an integrated vessel scheduling and tug assignment problem within a canal harbor




This page was built for publication: Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints