References
- ShutlerPMEA priority list based heuristic for the job shop problemJ Opl Res Soc20035457158410.1057/palgrave.jors.2601481
- van LaarhovenPJMAartsEHLLenstraJKJob shop scheduling by simulated annealingOpns Res19924011312510.1287/opre.40.1.113
- NowickiESmutnickiCA fast taboo search algorithm for the job shop problemMgmt Sci19964279781310.1287/mnsc.42.6.797
- Golenko-GinzburgDSimsJAUsing permutation spaces in job-shop schedulingAsia Pacific J Opl Res19929183193
- BellmanREOn a routing problemQuart Appl Math195816879010.1090/qam/102435
- TaillardEDParallel taboo search techniques for the job shop scheduling problemORSA J Comput1994610811710.1287/ijoc.6.2.108
- Lawrence S (1984). Resource constrained scheduling: an experimental investigation of heuristic scheduling techniques (Supplement), Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh.
- VaessensRJMAartsEHLLenstraJKJob shop scheduling by local searchINFORMS J Comput1996830231710.1287/ijoc.8.3.302
- TaillardEBenchmarks for basic scheduling problemsEur J Opl Res19936427828510.1016/0377-2217(93)90182-M
- Taillard E (2002). http://www.eivd.ch/ina/collaborateurs/etd/default.htm.