An integer programming model for hierarchical workforce scheduling problem.
Serap Ulusam SeçkinerHadi GökçenMustafa KurtPublished in: Eur. J. Oper. Res. (2007)
Keyphrases
- scheduling problem
- single machine
- np hard
- tabu search
- flowshop
- permutation flowshop
- minimizing makespan
- information technology
- human resources
- earliness tardiness
- processing times
- information systems
- release dates
- precedence constraints
- hierarchical structure
- total tardiness
- unrelated parallel machines
- list scheduling
- maximum lateness
- strongly np hard
- capacity constraints
- setup times
- parallel machines
- coarse to fine
- special case
- search algorithm
- multiscale