Error Bound of a Heuristic for the Common Due Date Scheduling Problem.
Surya Danusaputro LimanChung-Yee LeePublished in: INFORMS J. Comput. (1993)
Keyphrases
- rademacher complexity
- error bounds
- scheduling problem
- tabu search
- list scheduling
- unrelated parallel machines
- randomly generated test problems
- single machine
- job shop scheduling problem
- theoretical analysis
- np hard
- worst case
- quay crane
- flowshop
- optimal solution
- search algorithm
- strongly np hard
- setup times
- simulated annealing
- processing times
- minimizing makespan
- total weighted tardiness
- metaheuristic
- tardiness cost
- permutation flowshop
- parallel machines
- finite sample
- parzen window
- feasible solution
- precedence constraints
- release dates
- dynamic programming
- bin packing
- learning algorithm