A new heuristic and an exact approach for a production planning problem
From MaRDI portal
Publication:2051214
DOI10.1007/s10100-020-00689-3OpenAlexW3035289691MaRDI QIDQ2051214
Peggy Näser, Ronald Ortner, Tibor Dulai, Armin Fügenschuh, Peter Auer, Agnes Werner-Stark, György Dósa
Publication date: 24 November 2021
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-020-00689-3
Related Items (1)
Cites Work
- Unnamed Item
- Multi-product valid inequalities for the discrete lot-sizing and scheduling problem
- Mixed integer programming models for job shop scheduling: A computational analysis
- Mixed integer linear programming in process scheduling: modeling, algorithms, and applications
- Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
- On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times
- Heuristics for unrelated machine scheduling with precedence constraints
- Tabu search for the job-shop scheduling problem with multi-purpose machines
- Routing and scheduling in a flexible job shop by tabu search
- A genetic algorithm for the flexible job-shop scheduling problem
- Lead time considerations for the multi-level capacitated lot-sizing problem
- Unrelated Parallel Machine Scheduling Problem with Precedence Constraints: Polyhedral Analysis and Branch-and-Cut
- Single-Machine Scheduling with Precedence Constraints
- Production Planning by Mixed Integer Programming
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
This page was built for publication: A new heuristic and an exact approach for a production planning problem
