Finding the Pareto-optima for the total and maximum tardiness single machine problem.
Roberto TadeiAndrea GrossoFederico Della CrocePublished in: Discret. Appl. Math. (2002)
Keyphrases
- single machine
- maximum tardiness
- scheduling problem
- single machine scheduling problem
- release times
- minimizing makespan
- completion times
- earliness tardiness
- bicriteria
- processing times
- flowshop
- release dates
- maximum lateness
- deteriorating jobs
- number of late jobs
- scheduling jobs
- multi objective
- tabu search
- optimization algorithm
- weighted number of tardy jobs
- evolutionary algorithm
- branch and bound algorithm
- precedence constraints
- efficient solutions
- parallel machines
- dynamic programming
- special case
- search algorithm