Computing the worst-case due dates violations with budget uncertainty
Résumé
We study the problem of maximizing the violation of due dates when considering either the total violation, or the number of jobs that are tardy. We consider either classical completion times or those involving time warp. The four problems are motivated by the solution of scheduling problems with release and due dates/deadlines and processing time uncertainty, and also routing problems with (soft) time windows and travel time uncertainty. We provide polynomial dynamic programming algorithms for the four problems.
Fichier principal
Computing the worst-case due dates violations with budget uncertainty.pdf (116.61 Ko)
Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)