Parallel cooperative approaches for the labor constrained scheduling problem

MaRDI QIDQ2776558zbMATH OpenFDO

Authors Victor F. Cavalcante, Cristina C. B. Cavalcante, Celso C. Ribeiro, Cid Carvalho de Souza

Publication date 28 February 2002

zbMATH Keywords

scheduling problemtabu search

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Search theory (90B40)

Recommendations

• Scheduling with a constraint based cooperative solver
• Parallel algorithms for solution of problems in scheduling theory
• scientific article; zbMATH DE number 1760037
• An LPT-bound for a parallel multiprocessor scheduling problem
• Parallel branch-and-bound methods for the job-shop scheduling problem
• A parallel approximation scheme for the multiprocessor scheduling problem
• Parallel composition of scheduling solvers
• scientific article; zbMATH DE number 934537

Cited in

(2)

• Scheduling projects with labor constraints
• A cooperative hyper-heuristic search framework

This page was built for publication: Parallel cooperative approaches for the labor constrained scheduling problem

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