• Mathematics
  • Published in IEEM 2009

A Heuristic Combinatorial Neighborhood Algorithm for the Job Shop Scheduling Problem

@inproceedings{Tieke2009AHC,
  title={A Heuristic Combinatorial Neighborhood Algorithm for the Job Shop Scheduling Problem},
  author={Li Tie-ke},
  booktitle={IEEM 2009},
  year={2009}
}
A heuristic combinatorial neighborhood algorithm(HCNA) is presented for the job shop scheduling problem.The algorithm is organized in several related phases.The first phase starts from an arbitrary feasible solution and the makespan is calculated with the greedy makespan algorithm(GMA).Then new solutions are repeatedly generated through the combinatorial neighborhood swapping strategy.When a new solution is generated,the GMA is called to judge if it is feasible.An infeasible solution will be… CONTINUE READING