Similar Search Results

A mathematical formulation and complexity considerations for the blocks relocation problem

Caserta, Marco; Schwarze, Silvia; Voß, Stefan - In: European Journal of Operational Research 219 (2012) 1, pp. 96-104

The blocks relocation problem (BRP) may be defined as follows: given a set of homogeneous blocks stored in a two-dimensional stock, which relocations are necessary to retrieve the blocks from the stock in a predefined order while minimizing the number of those relocations? In this paper, we...

Persistent link: https://www.econbiz.de/10011052786

Flow shop scheduling with heterogeneous workers

Benavides, Alexander J.; Ritt, Marcus; Miralles, Cristóbal - In: European Journal of Operational Research 237 (2014) 2, pp. 713-720

We propose an extension to the flow shop scheduling problem named Heterogeneous Flow Shop Scheduling Problem (Het … corresponding scheduling problem. This problem is motivated by Sheltered Work centers for Disabled, whose main objective is the … the production managers with practical approaches for this combined assignment and scheduling problem. …

Persistent link: https://www.econbiz.de/10011097742

Operations research in the space industry

Fliege, Jörg; Kaparis, Konstantinos; Khosravi, Banafsheh - In: European Journal of Operational Research 217 (2012) 2, pp. 233-240

Operations research techniques have been used in the space industry since its infancy, and various competing methods and codes, with widely varying characteristics, have been used over time. This survey is intended to give an overview of current application cases of different operations research...

Persistent link: https://www.econbiz.de/10011052596

A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints

Detienne, Boris - In: European Journal of Operational Research 235 (2014) 3, pp. 540-552

This study investigates scheduling problems that occur when the weighted number of late jobs that are subject to …

Persistent link: https://www.econbiz.de/10011052690

Parallel machine scheduling with additional resources: Notation, classification, models and solution methods

Edis, Emrah B.; Oguz, Ceyda; Ozkarahan, Irem - In: European Journal of Operational Research 230 (2013) 3, pp. 449-463

Majority of parallel machine scheduling studies consider machine as the only resource. However, in most real … studies on the parallel machine scheduling problems with additional resources. Papers are surveyed in five main categories …

Persistent link: https://www.econbiz.de/10010679128

Facets and valid inequalities for the time-dependent travelling salesman problem

Miranda-Bront, Juan José; Méndez-Díaz, Isabel; … - In: European Journal of Operational Research 236 (2014) 3, pp. 891-902

The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the traditional TSP where the travel cost between two cities depends on the moment of the day the arc is travelled. In this paper, we focus on the case where the travel time between two cities depends not only on the...

Persistent link: https://www.econbiz.de/10011097808

The directed profitable location Rural Postman Problem

Arbib, Claudio; Servilio, Mara; Archetti, Claudia; … - In: European Journal of Operational Research 236 (2014) 3, pp. 811-819

In this paper we introduce an extension of the well known Rural Postman Problem, which combines arc routing with profits and facility location. Profitable arcs must be selected, facilities located at both end-points of the selected arcs, and a tour identified so as to maximize the difference...

Persistent link: https://www.econbiz.de/10011097829

Stronger multi-commodity flow formulations of the Capacitated Vehicle Routing Problem

Letchford, Adam N.; Salazar-González, Juan-José - In: European Journal of Operational Research 244 (2015) 3, pp. 730-738

The Capacitated Vehicle Routing Problem is a much-studied (and strongly NP-hard) combinatorial optimization problem, for which many integer programming formulations have been proposed. We present two new multi-commodity flow (MCF) formulations, and show that they dominate all of the existing...

Persistent link: https://www.econbiz.de/10011264302

Improved integer linear programming formulations for the job Sequencing and tool Switching Problem

Catanzaro, Daniele; Gouveia, Luis; Labbé, Martine - In: European Journal of Operational Research 244 (2015) 3, pp. 766-777

In this article we investigate the job Sequencing and tool Switching Problem (SSP), a NP-hard combinatorial optimization problem arising from computer and manufacturing systems. Starting from the results described in Tang and Denardo (1987), Crama et al. (1994) and Laporte et al. (2004), we...

Persistent link: https://www.econbiz.de/10011264319

A branch-price-and-cut algorithm for multi-mode resource leveling

Coughlan, Eamonn T.; Lübbecke, Marco E.; Schulz, Jens - In: European Journal of Operational Research 245 (2015) 1, pp. 70-80

-constrained project scheduling problem with availability constraints (calendars) and the objective to minimize the resource availability …

Persistent link: https://www.econbiz.de/10011264341