Queyranne Maurice

Maurice Queyranne

Information about the author Maurice Queyranne will soon be added to the site.
Found 22 papers in total
Appointment Scheduling with Discrete Random Durations
Appointment Scheduling with Discrete Random Durations
2011
We consider the problem of determining an optimal appointment schedule for a given...
Toward robust revenue management: Competitive analysis of online booking
Toward robust revenue management: Competitive analysis of online booking
2009
In this paper, we consider the revenue management problem from the perspective of...
Dynamic Multipriority Patient Scheduling for a Diagnostic Resource
Dynamic Multipriority Patient Scheduling for a Diagnostic Resource
2008
We present a method to dynamically schedule patients with different priorities to a...
Clique partitioning of interval graphs with submodular costs on the cliques
Clique partitioning of interval graphs with submodular costs on the cliques
2007
Given a graph G = (V,E) and a ‘cost function’ f : 2 V → ℝ...
On the asymptotic optimality of a simple on-line algorithm for the stochastic single-machine weighted completion time problem and its extensions
On the asymptotic optimality of a simple on-line algorithm for the stochastic single-machine weighted completion time problem and its extensions
2006
We consider the stochastic single-machine problem, when the objective is to minimize...
Decompositions, network flows, and a precedence constrained single-machine scheduling problem
Decompositions, network flows, and a precedence constrained single-machine scheduling problem
2003
We present an in-depth theoretical, algorithmic, and computational study of a linear...
On a asymptotic optimality of algorithms for the flow shop problem with release dates
On a asymptotic optimality of algorithms for the flow shop problem with release dates
2005
We consider the nonpermutation flow shop problem with release dates, with the...
Symmetric inequalities and their composition for asymmetric travelling salesman polytopes
Symmetric inequalities and their composition for asymmetric travelling salesman polytopes
1995
The Asymmetric Travelling Salesman (ATS) polytope ATSP(V) is the convex hull of...
Approximation algorithms for shop scheduling problems with minsum objective
Approximation algorithms for shop scheduling problems with minsum objective
2002
We consider a general class of multiprocessor shop scheduling problems, preemptive or...
Production and inventory model using net present value
Production and inventory model using net present value
2002
Using the net present value is the standard methodology in theoretical analysis, and...
Disconnecting sets in single and two-terminal-pair networks
Disconnecting sets in single and two-terminal-pair networks
1996
We consider mixed networks, which may include both directed and undirected edges. For...
A feedback strategy for periodic network flows
A feedback strategy for periodic network flows
1996
We consider a dynamic network flow model for the control problem of a...
Minimizing symmetric submodular functions
Minimizing symmetric submodular functions
1998
We describe a purely combinatorial algorithm which, given a submodular set function f...
On the two-level uncapacitated facility location problem
On the two-level uncapacitated facility location problem
1996
We study the two-level uncapacitated facility location (TUFL) problem. Given two types...
An exact algorithm for maximum entropy sampling
An exact algorithm for maximum entropy sampling
1995
We study the experimental design problem of selecting a most informative subset,...
On the two-level uncapacitated facility location problem
On the two-level uncapacitated facility location problem
1996
The authors study the two-level uncapacitated facility location (TUFL) problem. Given...
Hamiltonian path and symmetric travelling salesman polytopes
Hamiltonian path and symmetric travelling salesman polytopes
1993
The authors introduce a projective approach for studying symmetric travelling salesman...
Structure of a simple scheduling polyhedron
Structure of a simple scheduling polyhedron
1993
In a one-machine nonpreemptive scheduling problem, the feasible schedules may be...
Lot sizing policies for finite production rate assembly systems
Lot sizing policies for finite production rate assembly systems
1992
An assembly production system with n facilities has a constant external demand...
A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs
A planning horizon algorithm for deterministic inventory management with piecewise linear concave costs
1991
The authors consider a single-product, discrete-time production/inventory-control...
Single-machine scheduling polyhedra with precedence constraints
Single-machine scheduling polyhedra with precedence constraints
1991
The authors consider nonpreemptive single-machine scheduling subject to precedence...
Cut-threshold graphs
Cut-threshold graphs
1991
The authors study the structure of the networks in which connectedness and...
Papers per page: