Probabilistic tabu search for makespan minimization discrete-continuous scheduling

MaRDI QIDQ3070884zbMATH OpenFDO

Authors Joanna Józefowska, Grzegorz Waligóra, Jan Węglarz

Publication date 28 January 2011

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
• Tabu list management methods for a discrete-continuous scheduling problem
• On a methodology for discrete-continuous scheduling
• Resource level minimization in the discrete-continuous scheduling

Cited in

(5)

• Local search metaheuristics for discrete-continuous scheduling problems
• Tabu list management methods for a discrete-continuous scheduling problem
• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
• scientific article; zbMATH DE number 1985661 (Why is no real title available?)
• Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation

This page was built for publication: Probabilistic tabu search for makespan minimization discrete-continuous scheduling

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