Heuristic procedures for allocating the continuous resource in discrete-continuous scheduling problems

MaRDI QIDQ3070887zbMATH OpenFDO

Authors Joanna Józefowska, Grzegorz Waligóra

Publication date 28 January 2011

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Management decision making, including multiple objectives (90B50)

Recommendations

• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
• Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
• Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
• Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
• On a methodology for discrete-continuous scheduling

Cited in

(7)

• Heuristics for scheduling with inventory: Dynamic focus via constraint criticality
• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
• Discrete-continuous project scheduling with discounted cash flows - a tabu search approach
• scientific article; zbMATH DE number 1281666 (Why is no real title available?)
• Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan
• A hybrid exact method for a scheduling problem with a continuous resource and energy constraints
• Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation

This page was built for publication: Heuristic procedures for allocating the continuous resource in discrete-continuous scheduling problems

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