MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry
DOI10.1016/j.ejor.2010.06.002zbMath1205.90126OpenAlexW2074356866MaRDI QIDQ992661
Luis Puigjaner, Georgios M. Kopanos, Carlos Alberto Méndez
Publication date: 9 September 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.06.002
schedulingmixed integer programminglarge scale optimizationdecomposition strategypharmaceutical industry
Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35) Case-oriented studies in operations research (90B90)
Related Items (10)
Uses Software
Cites Work
- Unnamed Item
- Modeling realistic hybrid flexible flowshop scheduling problems
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing
- Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure
- Insertion techniques for the heuristic solution of the job shop problem
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
- Handbook of production scheduling.
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Using Lagrangean Techniques to Solve Hierarchical Production Planning Problems
- Alternative graph formulation for solving complex factory-scheduling problems
- LP-based heuristics for scheduling chemical batch processes
This page was built for publication: MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry