We describe an approximation algorithm for the problem of finding the minimum makespan in a job shop. The algorithm is based on simulated annealing, a generalization of the well known iterative improvement approach to combinatorial optimization problems. The generalization involves the acceptance of...
Research Assistant
AI chat, annotations, notes & similar papers
No comments yet
Be the first to share your thoughts!