Tabu list management methods for a discrete-continuous scheduling problem

DOI10.1016/S0377-2217(01)00210-7MaRDI QIDQ1600837zbMATH OpenWikidataFDO

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

Publication date 16 June 2002

Published in European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

makespantabu searchdiscrete-continuous schedulingcancellation sequence methodreverse elimination methodtabu navigation method

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
• scientific article; zbMATH DE number 1114463
• Probabilistic tabu search for makespan minimization discrete-continuous scheduling
• Tabu search for resource-constrained scheduling
• On a methodology for discrete-continuous scheduling
• Scheduling using tabu search methods with intensification and diversification
• A tabu search approach to machine scheduling
• Discrete-continuous project scheduling with discounted cash flows - a tabu search approach
• Tabu search for a class of single-machine scheduling problems
• Extension of reverse elimination method through a dynamic management of the tabu list

Cites work

• Bandwidth Packing: A Tabu Search Approach
• Future paths for integer programming and links to artificial intelligence
• Local search metaheuristics for discrete-continuous scheduling problems
• On a methodology for discrete-continuous scheduling
• Tabu Search Applied to the Quadratic Assignment Problem
• Tabu Search—Part I
• Tabu Search—Part II

Cited in

(5)

• Probabilistic tabu search for makespan minimization discrete-continuous scheduling
• Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
• Resource level minimization in the discrete-continuous scheduling

Describes a project that uses

Uses Software

• CFSQP
• Tabu search

This page was built for publication: Tabu list management methods for a discrete-continuous scheduling problem

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