Results 11 to 20 of about 683,612 (253)
Logic-based Benders Decomposition for preemptive Flexible Job-Shop Scheduling
International audienceIn this paper, we address the preemptive flexible job-shop scheduling problem (pFJSSP). We propose three exact methods to solve the pFJSSP with makespan minimization objective: a Mixed Integer Linear Programming (MILP) formulation ...
Juvin, Carla +2 more
core +7 more sources
The code for the Loose Benders Decomposition Algorithm and the data of the test instances used in van der Laan and Romeijnders (2020)
Wouda, N. +2 more
core +4 more sources
Non-convex nested Benders decomposition [PDF]
We propose a new decomposition method to solve multistage non-convex mixed-integer (stochastic) nonlinear programming problems (MINLPs). We call this algorithm non-convex nested Benders decomposition (NC-NBD).
Rebennack, Steffen, Füllner, Christian
core +1 more source
This paper attempts to design a three-echelon supply chain network for mine industry considering suppliers, manufacturing centers and distributors with different kinds of vehicles. A multi-objective mixed integer programming model is proposed to minimize
Mahdi Yousefi Nejad Attari +1 more
doaj +1 more source
An efficient Benders decomposition for the p-median problem
International audienceThe p-median problem is a classic discrete location problem with several applications. It aims to open p sites while minimizing the sum of the distances of each client to its nearest open site.
Alès, Zacharie +2 more
core +1 more source
We investigate a fleet scheduling problem arising when a company has to manage its own fleet of electric vehicles. Aim is to assign given usage reservations to these vehicles and to devise a suitable charging plan for all vehicles while minimizing a cost
Johannes Varga +2 more
doaj +1 more source
Warm-start cuts for Generalized Benders Decomposition [PDF]
summary:In this paper, we describe a decomposition algorithm suitable for two-stage convex stochastic programs known as Generalized Benders Decomposition.
Popela, Pavel +4 more
core +1 more source
This paper addresses the unrelated parallel machines scheduling problem with sequence and machine dependent setup times. Its goal is to minimize the makespan. The problem is solved by a combinatorial Benders decomposition.
Francisco Regis Abreu Gomes +1 more
doaj +1 more source
Implementation of Accelerating Benders Decomposition Algorithm for Supply Chain Considering New Product Development and Customer Relationship Management [PDF]
New product development is an essential requirement in any company and every company needs to develop its technology and products to survive in a competitive market.
Esmaeel Rezaei +2 more
doaj +1 more source
Accelerating the Composite Power System Planning by Benders Decomposition [PDF]
This paper presents an application of Benders decomposition to deal with the complexities in the simultaneous Generation Expansion Planning (GEP) and Transmission Expansion Planning (TEP).
Behnam Alizadeh, Shahram Jadid
doaj

