Heterogeneity has been considered in scheduling, but without taking into account the temporal variation of completion times of the sub-tasks for a divisible, independent task. In ...
This paper presents a dynamic programming (DP) algorithm for solving a labor scheduling problem with several realistic days-off scheduling constraints and a cost structure that dep...
In this note we consider the following problem. Suppose a set of sensors is jointly trying to estimate a process. One sensor takes a measurement at every time step and the measure...
Vijay Gupta, Timothy H. Chung, Babak Hassibi, Rich...
Abstract— While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with ...
Jong-Han Kim, Matthew West, Sanjay Lall, Eelco Sch...
The goal of this paper is to propose a tabu search heuristic for the car sequencing problem (CSP) used for the ROADEF 2005 international Challenge. This NP-hard problem was propos...