Login / Signup
An effective heuristic for the single-machine scheduling problem with flexible maintenance under human resource constraints.
Meriem Touat
Fatima Benbouzid Si-Tayeb
Belaid Benhamou
Published in:
KES (2018)
Keyphrases
</>
resource constraints
single machine scheduling problem
resource constrained
branch and bound algorithm
lagrangian relaxation
combinatorial optimization
dynamic programming
simulated annealing
job shop scheduling problem
tabu search
single machine
routing problem
resource consumption
lower bound