A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates.
Dvir ShabtayGeorge SteinerPublished in: J. Sched. (2011)
Keyphrases
- processing times
- bicriteria
- single machine
- weighted number of tardy jobs
- scheduling problem
- flowshop
- completion times
- efficient solutions
- setup times
- integer linear programming
- knapsack problem
- single machine scheduling problem
- np hard
- manufacturing cell
- identical machines
- tabu search
- worst case performance ratio
- precedence constraints
- parallel machines
- resource consumption
- search algorithm
- convex hull
- dynamic programming
- particle swarm optimization
- computational complexity