Charles Explorer logo
🇨🇿

Just in time scheduling on identical parallel machines

Publikace |
2002

Tento text není v aktuálním jazyce dostupný. Zobrazuje se verze "en".Abstrakt

In this short note we study a scheduling problem on parallel machines. The objective is to maximize the number of just in time jobs, where a job is called just in time if it is completed exactly on its due date.