Journal: 4OR

Found 137 papers in total
Semi-online hierarchical scheduling for lp-norm load balancing with buffer or rearrangements
2017,
In this paper, we consider the semi‐online hierarchical scheduling for load...
Partially observed optimal stopping problem for discrete-time Markov processes
2017,
This paper is dedicated to the investigation of a new numerical method to approximate...
Strictly feasible solutions and strict complementarity in multiple objective linear optimization
2017,
Recently, Luc defined a dual program for a multiple objective linear program. The dual...
Recent contributions to linear semi-infinite optimization
2017,
This paper reviews the state‐of‐the‐art in the theory of...
Approximating the length of Chinese postman tours
2014,
This article develops simple and easy‐to‐use approximation formulae for...
An ℓ2inf>-neighborhood infeasible interior-point algorithm for linear complementarity problems
2017,
In this paper, we propose an infeasible interior‐point algorithm for linear...
Coordinating a supply chain with green innovation in a dynamic setting
2017,
This paper addresses the channel coordination problem in a green supply chain...
On-off scheduling schemes for power-constrained electric vehicle charging
2017,
In this paper, we study the problem of establishing a dynamic charging schedule of...
Improved lower bounds for the online bin stretching problem
2017,
We use game theory techniques to automatically compute improved lower bounds on the...
Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs
2017,
In this paper, we deal with single machine scheduling problems subject to time...
Light on the infinite group relaxation II: sufficient conditions for extremality, sequences, and algorithms
2016,
This is the second part of a survey on the infinite group problem, an...
Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
2016,
This paper studies a hierarchical optimization problem on an unbounded...
Parallel-machine scheduling with release dates and rejection
2016,
In this paper, we consider the parallel‐machine scheduling problem with release...
A line search trust-region algorithm with nonmonotone adaptive radius for a system of nonlinear equations
2016,
In this paper, a trust‐region procedure is proposed for the solution of...
Model-hierarchical column generation and heuristic for the routing and wavelength assignment problem
2016,
The routing and wavelength assignment (RWA) problem typically occurs in wavelength...
Heuristic and metaheuristic algorithms for the generation of optimal experimental designs
2016,
Experimentation is arguably one of the fundamental pillars that enable the creation of...
A Lagrangian heuristic for capacitated single item lot sizing problems
2015,
This paper presents a new Lagrangian heuristic to solve the general capacitated single...
On the L-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
2015,
Many cutting problems on two- or three-dimensional objects require that the cuts be...
Large-scale Unit Commitment under uncertainty
2015,
The Unit Commitment problem in energy management aims at finding the optimal...
A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules
2014,
The quay crane scheduling problem (QCSP) is at the basis of a major logistic process...
Warehouse location with production, inventory, and distribution decisions: a case study in the lube oil industry
2014,
In this paper, a supply chain management problem from a real case study is modeled and...
Heuristic procedures for a stochastic batch service problem
2014,
This paper considers a multi‐class batch service problem that involves a...
On scheduling with the non-idling constraint
2014,
In this paper, we give an overview of the main results obtained on the complexity of...
A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems
2013,
We improve the well‐known result presented in Bertsimas and Sim (2003)...
Papers per page: