Fast parallel heuristics for the job shop scheduling problem

@article{Steinhfel2002FastPH,
  title={Fast parallel heuristics for the job shop scheduling problem},
  author={Kathleen Steinh{\"o}fel and Andreas Alexander Albrecht and Chak-Kuen Wong},
  journal={Computers & OR},
  year={2002},
  volume={29},
  pages={151-169}
}
The paper is dealing with parallelized versions of simulated annealing-based heuristics for the classical job shop scheduling problem. The scheduling problem is represented by the disjunctive graph model and the objective is to minimize the length of longest paths. The problem is formulated for l jobs where each job has to process exactly one task on each… CONTINUE READING