An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling
From MaRDI portal
Publication:342571
DOI10.1016/j.cor.2016.07.008zbMath1349.90290OpenAlexW2462669918MaRDI QIDQ342571
Jürgen Rietz, Cláudio Alves, Nuno Braga, José M. Valério de Carvalho
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2016.07.008
Integer programming (90C10) Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Deterministic network models in operations research (90B10)
Related Items (1)
Cites Work
- Unnamed Item
- Cutting and packing optimization. Problems modeling and solution methods.
- A zero-inventory production and distribution problem with a fixed customer sequence
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
- Exact solution of bin-packing problems using column generation and branch-and-bound
- A new LP-based lower bound for the cumulative scheduling problem
- A cutting plane approach for integrated planning and scheduling
- Machine scheduling with job delivery coordination
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- Integer Programming and Constraint Programming in Solving a Multimachine Assignment Scheduling Problem with Deadlines and Release Dates
- The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan
- Machine scheduling with an availability constraint and job delivery coordination
- Challenges in Enterprise Wide Optimization for the Process Industries
This page was built for publication: An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling
