A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs.
Chandrasekharan RajendranHans ZieglerPublished in: Eur. J. Oper. Res. (2001)
Keyphrases
- scheduling problem
- total tardiness
- minimizing makespan
- flowshop
- dispatching rule
- production scheduling
- processing times
- strongly np hard
- total weighted tardiness
- single machine
- unrelated parallel machines
- parallel machine scheduling problem
- scheduling jobs
- worst case performance ratio
- asymptotic optimality
- tabu search
- list scheduling
- job shop scheduling problem
- heuristic rules
- job shop
- missing data
- rule sets
- parallel machines
- search algorithm
- simulated annealing
- sequence dependent setup times
- dynamic routing
- permutation flowshop
- setup times
- maximum lateness
- single machine scheduling problem
- association rules
- feasible solution
- certainty factor
- precedence constraints
- dynamic programming
- optimal solution
- classification rules