A greedy heuristic for shift minimization personnel task scheduling problem.
Mehran HojatiPublished in: Comput. Oper. Res. (2018)
Keyphrases
- greedy heuristic
- scheduling problem
- np hard
- single machine
- greedy algorithm
- optimal solution
- objective function
- flowshop
- lower bound
- tabu search
- minimum weight
- knapsack problem
- permutation flowshop
- integer programming
- approximation algorithms
- processing times
- linear programming
- special case
- worst case analysis
- data processing
- parallel machines
- information systems
- branch and bound algorithm
- minimizing makespan
- worst case
- minimum cost
- precedence constraints
- setup times
- set cover
- total tardiness
- optimization problems
- end users
- job shop scheduling problem
- preventive maintenance
- regularization term
- earliness tardiness
- release dates
- sequence dependent setup times
- paradigm shift
- maximum lateness
- computational complexity
- unrelated parallel machines