Tabu list management methods for a discrete-continuous scheduling problem

DOI10.1016/S0377-2217(01)00210-7zbMath1030.90035WikidataQ127481974 ScholiaQ127481974MaRDI QIDQ1600837

Joanna Józefowska, Grzegorz Waligóra, Jan Weglarz

Publication date: 16 June 2002

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

zbMATH Keywords

tabu searchmakespandiscrete-continuous schedulingcancellation sequence methodreverse elimination methodtabu navigation method

Mathematics Subject Classification ID

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

Related Items (4)

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

Uses Software

• CFSQP
• Tabu search

Cites Work

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

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