A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups
From MaRDI portal
Publication:4896444
DOI10.1287/IJOC.7.2.160zbMATH Open0859.90085OpenAlexW2136743849MaRDI QIDQ4896444FDOQ4896444
Authors: Carsten Jordan, Andreas Drexl 
Publication date: 25 March 1997
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.7.2.160
Recommendations
- New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups
- A sequential linear programming approach to solve mixed integer programming problems
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups
- Modeling lotsizing and scheduling problems with sequence dependent setups
- MIP-based heuristics for lotsizing in capacitated pure flow shop with sequence-dependent setups
- A constraint programming approach for a batch processing problem with non-identical job sizes
- An integer programming application to solve sequencer mix problems in printed circuit board production
- Flow shop batching and scheduling with sequence-dependent setup times
- Hybrid optimization methods for time-dependent sequencing problems
Cited In (4)
This page was built for publication: A Comparison of Constraint and Mixed-Integer Programming Solvers for Batch Sequencing with Sequence-Dependent Setups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4896444)
