Results 51 to 60 of about 3,535 (131)

Block scheduling in practice: An optimal decomposition strategy for nonidentical operating rooms

open access: yesDecision Sciences, EarlyView.
Abstract We develop and implement a Master Surgery Schedule for a real‐life hospital, assigning operating room (OR) time to surgical specialties over a multi‐week horizon. Through action research, we identify a critical operational challenge: the issue of split blocks. Split blocks allow two specialties to share an OR on the same day—one in the morning,
Vincent J. J. van Ham   +2 more
wiley   +1 more source

A novel dual‐decomposition method for non‐convex two‐stage stochastic mixed‐integer quadratically constrained quadratic problems

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We propose the novel p‐branch‐and‐bound method for solving two‐stage stochastic programming problems whose deterministic equivalents are represented by non‐convex mixed‐integer quadratically constrained quadratic programming (MIQCQP) models. The precision of the solution generated by the p‐branch‐and‐bound method can be arbitrarily adjusted by
Nikita Belyak, Fabricio Oliveira
wiley   +1 more source

Production routing decisions in a two‐echelon supply chain with multiple delivery modes

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We study an original two‐echelon production routing problem with multiple delivery modes (2E‐PRP‐MDM). In the first echelon, the primary production facility is tasked with satisfying the demands of two distinct entities: a set of warehouses and a set of customers through direct shipments. In the second echelon, warehouses become delivery hubs,
Rachida Benfedel   +2 more
wiley   +1 more source

A genetic algorithm simheuristic for solving the stochastic project portfolio selection problem with portfolio reliability constraints

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract In response to the increasing complexity of modern products, dynamic markets, and intensified competition, project‐based organizations are actively seeking methodologies to efficiently manage their expanding project portfolios. This paper analyzes the project portfolio selection problem in uncertain environments. Despite recent advances in the
Miguel Saiz   +3 more
wiley   +1 more source

A Mixed Integer Programming Approach to the Rechargeable Rover Routing Problem on Mars

open access: yesFoundations of Computing and Decision Sciences
In this paper, we introduce a novel variant of the Vehicle Routing Problem (VRP), the Rechargeable Rover Routing Problem (RRRP), which addresses the routing of energy-constrained autonomous electric rovers for Martian missions.
Burzyński Wojciech, Kaleta Mariusz
doaj   +1 more source

Collaborative platooning and routing for mixed fleets of electric automated vehicles and conventional trucks

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract The application of automated ground vehicles (AGVs) is well‐established in closed environments such as port terminals, while their operation in open areas remains challenging. In this work, we set out to overcome this limitation by introducing platooning as a transfer mode in heterogeneous vehicle networks.
Nadia Pourmohammad‐Zia   +2 more
wiley   +1 more source

A MILP for multi-machine injection moulding sequencing in the scope of C2NET Project

open access: yesInternational Journal of Production Management and Engineering, 2018
The goal of C2NET European H2020 Funded Project is the creation of cloud-enabled tools for supporting the SMEs supply network optimization of manufacturing and logistic assets based on collaborative demand, production and delivery plans.
Beatriz Andrés   +4 more
doaj   +1 more source

Exact solution algorithms for biobjective mixed integer programming problems

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract We consider criterion space algorithms for biobjective mixed integer programs. The algorithms solve scalarization models in order to explore predetermined regions of the objective space called boxes, defined by two nondominated points. When exploring, the algorithm exploits information on its corner points and chooses the scalarization problem
Deniz Emre, Özlem Karsu, Firdevs Ulus
wiley   +1 more source

An Improved Mixed Integer Linear Programming Approach Based on Symmetry Diminishing for Unit Commitment of Hybrid Power System

open access: yesEnergies, 2019
In this paper, the mixed integer linear programming (MILP) for solving unit commitment (UC) problems in a hybrid power system containing thermal, hydro, and wind power have been studied.
Bo Fu   +4 more
doaj   +1 more source

An effective and efficient matheuristic for the electric vehicle routing problem with capacitated recharging stations

open access: yesInternational Transactions in Operational Research, EarlyView.
Abstract In this paper, we address the problem of routing a fleet of electric vehicles (EVs) to serve a set of customers, geographically distributed, within their time windows. We assume that EVs may also be recharged en route, and the amount of energy recharged at a recharging station (RS) is a decision variable itself, that is, partial recharges are ...
Maurizio Bruglieri   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy