Publication

The robust single machine scheduling problem with uncertain release and processing times

Publications associées (48)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On the various local solutions to a two-input dynamic optimization problem

Dominique Bonvin

Solving a multi-input dynamic optimization of a batch processes is a complex problem involving interactions between input variables and constraints over time. The problem gets more difficult due to the presence of local solutions that have almost the same ...

Elsevier2016

Tracking Interacting Objects Using Intertwined Flows

Pascal Fua, François Fleuret, Engin Türetken, Xinchao Wang

In this paper, we show that tracking different kinds of interacting objects can be formulated as a network-flow Mixed Integer Program. This is made possible by tracking all objects simultaneously using intertwined flow variables and expressing the fact tha ...

Institute of Electrical and Electronics Engineers2016

A local search heuristic for a mixed integer nonlinear integrated airline schedule planning problem

Michel Bierlaire, Matteo Salani, Bilge Atasoy

In this paper we present a local search heuristic method for an integrated airline scheduling, fleeting and pricing model. The integrated model simultaneously optimizes the decisions of schedule design, fleet assignment, seat allocation, pricing and consid ...

2013

Analysis of an itinerary-based airline fleet assignment model with passenger-choice driven recapture and pricing

Michel Bierlaire, Matteo Salani, Bilge Atasoy

There is an increasing interest for the integration of supply-demand interactions in airline schedule planning models. We work with an itinerary-based fleet assignment model where an itinerary choice model is explicitly integrated. The choice model represe ...

2013

Exact and Heuristic Methods to Solve the Berth Allocation Problem in Bulk Ports

Michel Bierlaire, Ilaria Vacca, Nitish Umang

In this paper, we study the dynamic hybrid berth allocation problem in bulk ports with the objective to minimize the total service times of the vessels. We propose two exact methods based on mixed integer progra mming and generalized set partitionin g, and ...

Pergamon-Elsevier Science Ltd2013

The restricted max-min fair allocation problem (also known as the restricted Santa Claus problem) is one of few problems that enjoys the intriguing status of having a better estimation algorithm than approximation algorithm. Indeed, Asadpour et al. [1] pro ...

Springer2012

Approximation Algorithms for Modern Multi-Processor Scheduling Problems

Martin Niemeier

This thesis is devoted to the design and analysis of algorithms for scheduling problems. These problems are ubiquitous in the modern world. Examples include the optimization of local transportation, managing access to concurrent resources like runways at a ...

EPFL2012

Exact and heuristic methods to solve the berth allocation problem in bulk ports

Michel Bierlaire, Ilaria Vacca, Nitish Umang

While significant contributions have been made in the use of operations research methods and techniques to optimize container terminals, relatively less attention has been directed to bulk ports. In this paper, we consider the problem of allocating vessels ...

2012

Container Terminal Management

Ilaria Vacca

This thesis deals with models and methods for large scale optimization problems; in particular, we focus on decision problems arising in the context of seaport container terminals for the efficient management of terminal operations. Large-scale optimizatio ...

EPFL2011

Modeling and Solving the Tactical Berth Allocation Problem

Matteo Salani, Ilaria Vacca

In this paper we integrate at the tactical level two decision problems arising in container terminals: the berth allocation problem, which consists of assigning and scheduling incoming ships to berthing positions, and the quay crane assignment problem, whi ...

2010