An efficient MILP-based decomposition strategy for solving large-scale scheduling problems in the shipbuilding industry

DOI10.1007/s11081-019-09457-yzbMath1439.90070OpenAlexW2957549188MaRDI QIDQ2302367

Alejandro García del Valle, Carlos Alberto Méndez, Mariana E. Cóccola, Natalia P. Basán

Publication date: 26 February 2020

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-019-09457-y

zbMATH Keywords

MILP modeldecomposition strategymulti-stage scheduling problemshipbuilding process

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (1)

A preface to the special issue on enterprise-wide optimization

Cites Work

• MIP-based decomposition strategies for large-scale scheduling problems in multiproduct multistage batch plants: a benchmark scheduling problem of the pharmaceutical industry
• Solving a large-scale industrial scheduling problem using MILP combined with a heuristic procedure
• A decomposition approach for optimal gas network extension with a finite set of demand scenarios
• An MILP continuous-time framework for short-term scheduling of multipurpose batch processes under different operation strategies
• Spatial scheduling optimization algorithm for block assembly in shipbuilding
• Optimization of the complex-RFM optimization algorithm
• An adaptive-topology ensemble algorithm for engineering optimization problems
• A new algorithm using front prediction and NSGA-II for solving two and three-objective optimization problems
• A batch, derivative-free algorithm for finding multiple local minima
• Scheduling a hybrid assembly-differentiation flowshop to minimize total flow time

This page was built for publication: An efficient MILP-based decomposition strategy for solving large-scale scheduling problems in the shipbuilding industry