The multiple-agent scheduling problems have received increasing attention recently. However, most of the research focuses on studying the computational complexity of the intractable cases or examining problems with a single criterion. Often a decision maker has to decide the schedule based on multiple criteria. In this paper, we consider a single machine problem where the objective is to minimi...

The considered problem is the scheduling of a set of N jobs on M identical parallel machines in order to minimize the total tardiness without any preemption or splitting. Each job has its own processing time, release date and due date. All the machines are considered identical (with same speed) and available during all the scheduling period. This problem is NP-hard. An exact resolution, an Ant ...

We investigate the problem of time-of-arrival (TOA) based localization under possible non-line-of-sight (NLOS) propagation conditions. To robustify squared-range-based location estimator, we follow maximum correntropy criterion, essentially Welsch $M$-estimator with a redescending influence function which behaves like $\ell_0$-minimization towards grossly biased measurements, to derive formulat...