An O(1.41n)-time algorithm for a single machine just-in-time scheduling problem with common due date and symmetric weights

Vincent t'Kindt (1) , Lei Shang (1) , Federico Della Croce (2)

1 LIFAT - Laboratoire d'Informatique Fondamentale et Appliquée de Tours
2 DIGEP - Department of Management and Production Engineering [Politecnico di Torino]

Domaines: Recherche opérationnelle [math.OC]

Vincent t'Kindt, Lei Shang, Federico Della Croce. An O(1.41n)-time algorithm for a single machine just-in-time scheduling problem with common due date and symmetric weights. 16th International Conference on Project Management and Scheduling (PMS’18), Apr 2018, Roma, Italy. ⟨hal-01932657⟩