An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling

DOI10.1016/J.COR.2016.07.008zbMATH Open1349.90290OpenAlexW2462669918MaRDI QIDQ342571FDOQ342571

Authors: Jürgen Rietz, Cláudio Alves, Nuno Braga, José 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

Recommendations

• An Integrated Model for Job-Shop Planning and Scheduling
• A cutting plane approach for integrated planning and scheduling
• A Lagrangian heuristic for an integrated lot-sizing and fixed scheduling problem
• Supply chain scheduling with parallel machines
• An integrated approach in production planning and scheduling

zbMATH Keywords

integer linear programmingnetwork flow modelsproduction planning and scheduling

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Mixed integer programming (90C11) Production models (90B30)

Cites Work

• Machine scheduling with job delivery coordination
• The integrated production and transportation scheduling problem for a product with a short lifespan
• Approximation algorithms for NP-hard problems.
• Machine scheduling with an availability constraint and job delivery coordination
• Exact solution of bin-packing problems using column generation and branch-and-bound
• A cutting plane approach for integrated planning and scheduling
• 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
• Cutting and packing optimization. Problems modeling and solution methods.
• A new LP-based lower bound for the cumulative scheduling problem
• Challenges in Enterprise Wide Optimization for the Process Industries
• 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

Cited In (1)

• Arc flow formulations based on dynamic programming: theoretical foundations and applications

This page was built for publication: An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342571)