Résumé: In this paper, we present -hardness proofs and exhibit linear-time algorithms for proportionate two-machine open shop and job shop problems with respect to the maximum lateness, the makespan with release dates, the total weighted completion times and the number of just-in-time jobs

Langue: Anglais
Thème Informatique

Mots clés:
Complexity
scheduling
Makespan
Proportionate shop
Maximum lateness
Mean finish time
Just-in-time