scientific article; zbMATH DE number 925015
From MaRDI portal
Publication:4891488
zbMath0852.68118MaRDI QIDQ4891488
Publication date: 11 September 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computing methodologies and applications (68U99) Parallel algorithms in computer science (68W10)
Related Items (13)
Job-shop local-search move evaluation without direct consideration of the criterion's value ⋮ A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective ⋮ A multi objective optimization approach for flexible job shop scheduling problem under random machine breakdown by evolutionary algorithms ⋮ Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach ⋮ A repairing technique for the local search of the job-shop problem. ⋮ An experimental analysis of local minima to improve neighbourhood search. ⋮ Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times ⋮ Deconstructing Nowicki and Smutnicki's \(i\)-TSAB tabu search algorithm for the job-shop scheduling problem ⋮ Supercomputer Scheduling with Combined Evolutionary Techniques ⋮ A genetic algorithm for the two-stage supply chain distribution problem associated with a fixed charge ⋮ Some new results on simulated annealing applied to the job shop scheduling problem ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ The job shop scheduling problem: Conventional and new solution techniques
This page was built for publication:
