A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan

DOI10.1002/jos.119zbMath1029.90030OpenAlexW1968426269MaRDI QIDQ1860373

Grzegorz Waligóra, Joanna Józefowska, Marek Mika, Rafal Rózycki, Jan Weglarz

Publication date: 23 February 2003

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jos.119

zbMATH Keywords

parallel machinestabu searchmakespanheuristicresource constraintsmathematical programming problemdiscrete-continuous scheduling

Mathematics Subject Classification ID

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

Related Items (10)

Scheduling shared continuous resources on many-cores ⋮ Evolutionary hybrid approaches for generation scheduling in power systems ⋮ Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function ⋮ Power-aware scheduling of preemptable jobs on identical parallel processors to meet deadlines ⋮ Discrete-continuous project scheduling with discounted cash flows - a tabu search approach ⋮ Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation ⋮ Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan ⋮ Power-aware scheduling of preemptable jobs on identical parallel processors to minimize makespan ⋮ Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results ⋮ Production, maintenance and resource scheduling: a review

Uses Software

• CFSQP

Cites Work

• On a methodology for discrete-continuous scheduling
• Local search metaheuristics for discrete-continuous scheduling problems
• Tabu list management methods for a discrete-continuous scheduling problem
• 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

This page was built for publication: A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan