scientific article; zbMATH DE number 934537

MaRDI QIDQ4895236zbMATH OpenFDO

Authors M. G. A. Verhoeven, E. Aarts

Publication date 26 January 1997

zbMATH Keywords

combinatorial optimizationjob shop scheduling problemparallel computationparallel local search algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Parallel numerical computation (65Y05) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• scientific article; zbMATH DE number 1488092
• Fast parallel heuristics for the job shop scheduling problem
• scientific article; zbMATH DE number 2079761

Cited in

(11)

• Local search algorithms for the multiprocessor flow shop scheduling problem
• Locality-aware task scheduling for homogeneous parallel computing systems
• On single-walk parallelization of the job shop problem solving algorithms
• Parallel local search
• Parallel branch-and-bound and parallel PSO algorithms for job shop scheduling problem with blocking
• Parallel cooperative approaches for the labor constrained scheduling problem
• Performance guarantees of local search for multiprocessor scheduling
• Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
• scientific article; zbMATH DE number 2079761 (Why is no real title available?)
• scientific article; zbMATH DE number 1488092 (Why is no real title available?)
• Fast parallel heuristics for the job shop scheduling problem

This page was built for publication:

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