Login / Signup
A heuristic for minimizing the makespan in no-idle permutation flow shops.
Pawel Jan Kalczynski
Jerzy Kamburowski
Published in:
Comput. Ind. Eng. (2005)
Keyphrases
</>
greedy heuristic
optimal solution
real world
search algorithm
simulated annealing
dynamic programming
combinatorial optimization
squeaky wheel
heuristic solution
tree search
heuristic methods
job shop scheduling problem
tabu search
response time
scheduling problem
case study
decision trees
information systems