An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems

This paper presents a MILP-based decomposition algorithm for solving large-scale scheduling problems with assembly operations in flexible flow shop environments. First, a rigorous mixed-integer linear (MILP) formulation based on the general precedence notion is developed for the problem under study. Then, the MILP model is embedded within a decomposition algorithm in order to accelerate the resolution of large-size industrial problems. The proposed solution approach is tested on several examples derived from a real-world case study arising in a shipbuilding company.Sociedad Argentina de Informática e Investigación Operativ

An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems

This paper presents a MILP-based decomposition algorithm for solving large-scale scheduling problems with assembly operations in flexible flow shop environments. First, a rigorous mixed-integer linear (MILP) formulation based on the general precedence notion is developed for the problem under study. Then, the MILP model is embedded within a decomposition algorithm in order to accelerate the resolution of large-size industrial problems. The proposed solution approach is tested on several examples derived from a real-world case study arising in a shipbuilding company.Sociedad Argentina de Informática e Investigación Operativ

An Efficient MILP-Based Decomposition Strategy for Solving Large-Scale Scheduling Problems

This paper presents a MILP-based decomposition algorithm for solving large-scale scheduling problems with assembly operations in flexible flow shop environments. First, a rigorous mixed-integer linear (MILP) formulation based on the general precedence notion is developed for the problem under study. Then, the MILP model is embedded within a decomposition algorithm in order to accelerate the resolution of large-size industrial problems. The proposed solution approach is tested on several examples derived from a real-world case study arising in a shipbuilding company.Sociedad Argentina de Informática e Investigación Operativ

Aerospace Manufacturing Industry: A Simulation-based Decision Support Framework for the Scheduling of Complex Hoist Lines

This paper presents an advanced simulation model for short-term scheduling of complex hoist lines. This problem, generally found in aerospace and electroplating industries, includes several hard constraints that should be considered: single shared hoist, heterogeneous recipes, eventual recycle flows, and no buffers between workstations. Different heuristic-based strategies are incorporated into the computer model in order to improve the solutions generated over time. The aim is to reduce the number of products that must be discarded while minimizing the makespan. In addition, a graphical user interface was developed for quickly evaluating simulated schedules.Sociedad Argentina de Informática e Investigación Operativa (SADIO