Featured Image

Why is it important?

This paper presents heuristics based on insertion and reinsertion techniques of operations for the classical job shop scheduling problem with minimizing the makespan. It also inlcudes beam search techniques.

Read the Original

This page is a summary of: Insertion techniques for the heuristic solution of the job shop problem, Discrete Applied Mathematics, March 1995, Elsevier,
DOI: 10.1016/0166-218x(93)e0127-k.
You can read the full text:

Read

Contributors

The following have contributed to this page