A random neighborhood swapping algorithm for job shop scheduling problems

MaRDI QIDQ3071503zbMATHFDO

Authors Jianshuang Cui, Tieke Li

Publication date 5 February 2011

zbMATH Keywords

job shop scheduling problemcritical path algorithmrandom neighborhood swapping

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems
• A tabu search algorithm with a new neighborhood structure for the job shop scheduling problem
• Job Shop Scheduling by Local Search
• A variable neighbourhood search algorithm for the flexible job-shop scheduling problem
• New and ``stronger job-shop neighbourhoods: A focus on the method of Nowicki and Smutnicki (1996)

Cited in

(2)

• A neighbourhood property for the job shop scheduling problem with application to hybrid particle swarm optimization
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: A random neighborhood swapping algorithm for job shop scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3071503)