Publications associées à Nurse scheduling problem

A ride time-oriented scheduling algorithm for dial-a-ride problems

Nikolaos Geroliminis, Claudia Bongiovanni, Mor Kaspi

This paper offers a new algorithm to efficiently optimize scheduling decisions for dial-a-ride problems (DARPs), including problem variants considering electric and autonomous vehicles (e-ADARPs). The scheduling heuristic, based on linear programming theor ...

Pergamon-Elsevier Science Ltd2024

Convergence of adaptive algorithms for constrained weakly convex optimization

Volkan Cevher, Ahmet Alacaoglu, Yurii Malitskyi

We analyze the adaptive first order algorithm AMSGrad, for solving a constrained stochastic optimization problem with a weakly convex objective. We prove the

\tilde O(t^{-1/2})

rate of convergence for the squared norm of the gradient of Moreau envelope, ...

2021

The electric autonomous dial-a-ride problem

Claudia Bongiovanni

This thesis develops mathematical programming frameworks to operate electric autonomous vehicles in the context of ride-sharing services. The introduced problem is a novel variant of the Dial-a-Ride Problem (DARP), denoted by the electric Autonomous Dial-a ...

EPFL2020

Integration of passenger satisfaction in railway timetable rescheduling for major disruptions

Stefan Yves Gabriel Binder

Unexpected disruptions occur for many reasons in railway networks and cause delays, cancellations, and, eventually, passenger inconvenience. This thesis focuses on the railway timetable rescheduling problem from a macroscopic point of view in case of lar ...

EPFL2018

Hybrid Cyclicity: Combining The Benefits Of Cyclic And Non-Cyclic Timetables

Michel Bierlaire, Shadi Sharif Azadeh, Mohammad Yousef Maknoon, Tomas Robenek

We propose a new type of timetable that would combine both the regularity of the cyclic timetables and the flexibility of the non-cyclic ones. In order to do so, several combinations of the two timetables are considered. The regularity is incorporated in t ...

Pergamon-Elsevier Science Ltd2017

Model and metaheuristics for a scheduling problem integrating procurement, sale and distribution decisions

Rémy Glardon, Nicolas Zufferey

This paper presents an integrated approach for short-term supply chain management (SCM) at a fast moving consumer goods production plant. The problem is to determine the production quantities, to provide a detailed production schedule, to trigger the relev ...

Springer2017

Noise-Resistant Particle Swarm Optimization for the Learning of Robust Obstacle Avoidance Controllers using a Depth Camera

Alcherio Martinoli, Inaki Navarro Oiza, Ezequiel Leonardo Di Mario

The Ranger robot was designed to interact with children in order to motivate them to tidy up their room. Its mechanical configuration, together with the limited field of view of its depth camera, make the learning of obstacle avoidance behaviors a hard pro ...

Ieee2016

A production scheduling problem with uncertain sequence-dependent set-up times and random yield

Paul Xirouchakis, Byung Jun Joo

A scheduling problem in a real production line with uncertain sequence-dependent set-up times and a random yield is considered. The production line can produce multiple product types as production lots, each of which is composed of a number of products of ...

Taylor & Francis Ltd2015

Optimized Packet Scheduling in Multiview Video Navigation Systems

Pascal Frossard, Thomas Maugey, Laura Toni

In multiview video systems, multiple cameras generally acquire the same scene from different perspectives, such that users have the possibility to select their preferred viewpoint. This results in large amounts of highly redundant data, which needs to be p ...

Ieee-Inst Electrical Electronics Engineers Inc2015

Fast algorithm for blind optimization of optical systems. Statistics and methodology

Maria-Alexandra Paun

Adaptive Optics (AO) improves the efficiency of the optical devices in confocal imaging systems by reducing wavefront aberrations. Aberration is caused by imperfections within the system and reduces the optical signal to noise ratio of the resultant images ...

Natl Inst Optoelectronics2012

Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint

Jongho Shin, Byung Jun Joo

This paper focuses on the scheduling problem of minimizing makespan for a given set of jobs in a two-stage hybrid flowshop subject to a product-mix ratio constraint. There are identical parallel machines at the first stage of the hybrid flowshop, while the ...

2009

Ianos: An intelligent application oriented scheduling framework for an HPCN grid

Vincent Keller, Pierre Kuonen

We present the architecture and design of the IANOS scheduling framework. The goal of the new Grid scheduling system is to provide a general job submission framework allowing optimal positioning and scheduling of HPCN applications. The scheduling algorithm ...

Springer, 233 Spring Street, New York, Ny 10013, United States2008

A graph coloring heuristic using partial solutions and a reactive tabu scheme

Nicolas Zufferey

Most of the recent heuristics for the graph coloring problem start from an infeasible k-coloring (adjacent vertices may have the same color) and try to make the solution feasible through a sequence of color exchanges. In contrast, our approach (called FOO- ...

2008

Packet Selection and Scheduling for Multipath Video Streaming

Pascal Frossard, Dan Jurca

This paper addresses the problem of choosing the best streaming policy for distortion optimal multipath video delivery, under delay constraints. The streaming policy consists in a joint selection of the video packets to be transmitted, as well as their sen ...

2007

Decision-aid methodology for the school bus routing and scheduling problem

Michel Bierlaire, Thomas Liebling

We consider the school bus routing and scheduling problem, where transportation demand is known and bus scheduling can be planned in advance. We present a comprehensive methodology designed to support the decision of practitioners. We first propose a model ...

2005