Advanced search
Publication Cover
Journal of the Operational Research Society Volume 54, 2003 - Issue 6
Submit an article Journal homepage
32
Views
5
CrossRef citations to date
0
Altmetric
Theoretical Paper

A priority list based heuristic for the job shop problem

P M E ShutlerNanyang Technological UniversitySingaporeCorrespondence[email protected]
Pages 571-584 | Received 01 Oct 2000, Accepted 01 Aug 2002, Published online: 21 Dec 2017

References

  • HauptRA survey of priority rule-based schedulingOR Spekt19891131610.1007/BF01721162
  • PanwalkarSSIskanderWA survey of scheduling rulesOpns Res197725456110.1287/opre.25.1.45
  • Golenko-GinzburgDSimsJAUsing permutation spaces in job-shop schedulingAsia Pacific J Opl Res19929183193
  • AndersonEJGlassCAPottsCNMachine schedulingLocal Search in Combinatorial Optimization1997361414
  • VaessensRJMAartsEHLLenstraJKJob shop scheduling by local searchINFORMS J Comput1996830231710.1287/ijoc.8.3.302
  • van LaarhovenPJMAartsEHLLenstraJKJob shop scheduling by simulated annealingOpns Res19924011312510.1287/opre.40.1.113
  • NowickiESmutnickiCA fast taboo search algorithm for the job shop problemMngt Sci19964279781310.1287/mnsc.42.6.797
  • FrenchSSequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop1982
  • FisherHThompsonGLProbabilistic learning combinations of local job-shop scheduling rulesIndustrial Scheduling1963225251
  • Lawrence S (1984). Resource constrained scheduling: an experimental investigation of heuristic scheduling techniques (Supplement). Graduate School of Industrial Administration. Carnegie Mellon University, Pittsburgh.
  • TaillardEDParallel taboo search techniques for the job shop scheduling problemORSA J Comput1994610811710.1287/ijoc.6.2.108
  • BellmanREOn a routing problemQ Appl Math195816879010.1090/qam/102435
  • TaillardEBenchmarks for basic scheduling problemsEur J Opl Res19936427828510.1016/0377-2217(93)90182-M
  • Dongarra JJ (1993). Performance of various computers using standard linear equations software. Report CS-89-85. Computer Science Department, University of Tennessee, Knoxville.
  • AartsEHLvan LaarhovenPJMLenstraJKUlderNLJA computational study of local search algorithms for job shop schedulingORSA J Comput1994611812510.1287/ijoc.6.2.118
  • AartsEHLvan LaarhovenPJMStatistical cooling: a general approach to combinatorial optimization problemsPhilips J Res198540193226
  • Nowicki E and Smutnicki C (2001). New Ideas in TS for Job Shop Scheduling. Preprint 50/2001 Institute of Engineering Cybernetics, Technical University of Wroclaw, Wroclaw, Poland.
  • JainASRangaswamyBMeeranSNew and ‘stronger’ job-shop neighbourhoods: a focus on the method of Nowicki and SmutnickiJ Heuristics2000645718010.1023/A:1009617209268
  • Taillard E (2002). http://www.eivd.ch/ina/collaborateurs/etd/default.htm

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Related research

People also read lists articles that other readers of this article have read.

Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.

Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.