Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines.
Klaus HeegerHendrik MolterPublished in: CoRR (2024)
Keyphrases
- number of tardy jobs
- processing times
- parallel machines
- scheduling problem
- flowshop
- single machine
- scheduling jobs
- makespan minimization
- setup times
- earliness tardiness
- sequence dependent setup times
- single machine scheduling problem
- release dates
- precedence constraints
- identical parallel machines
- np hard
- tabu search
- polynomially solvable
- job shop scheduling problem
- single server
- resource consumption
- job shop
- completion times
- supply chain