scientific article; zbMATH DE number 1281666

MaRDI QIDQ4240868zbMATH OpenFDO

Authors Joanna Józefowska, Marek Mika, Rafał Różycki, Grzegorz Waligóra, Jan Węglarz

Publication date 26 May 1999

zbMATH Keywords

metaheuristicsmakespandiscrete-continuous scheduling

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Recommendations

• Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
• On a methodology for discrete-continuous scheduling
• Heuristic procedures for allocating the continuous resource in discrete-continuous scheduling problems
• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
• Discrete-continuous scheduling problems -- mean completion time results

Cited in

(7)

• Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
• scientific article; zbMATH DE number 955199 (Why is no real title available?)
• Neighbourhood properties in some single processor scheduling problem with variable efficiency and additional resources
• Solving the discrete-continuous project scheduling problem via its discretization
• Makespan optimization in a single-machine scheduling problem with dynamic job ready times-complexity and algorithms
• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan
• Structure vs. efficiency of the cross-entropy based population learning algorithm for discrete-continuous scheduling with continuous resource discretisation

This page was built for publication:

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