Local search metaheuristics for discrete-continuous scheduling problems

DOI10.1016/S0377-2217(97)00345-7MaRDI QIDQ1296094zbMATH OpenFDO

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

Publication date 13 September 1999

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

zbMATH Keywords

simulated annealinggenetic algorithmheuristic searchtabu searchdiscrete-continuous scheduling

Mathematics Subject Classification ID

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
• Probabilistic tabu search for makespan minimization discrete-continuous scheduling
• scientific article; zbMATH DE number 1281666
• Tabu list management methods for a discrete-continuous scheduling problem
• A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan

Cites work

• scientific article; zbMATH DE number 4048925 (Why is no real title available?)
• scientific article; zbMATH DE number 3805259 (Why is no real title available?)
• scientific article; zbMATH DE number 867338 (Why is no real title available?)
• On a methodology for discrete-continuous scheduling
• Tabu Search—Part I
• Tabu Search—Part II

Cited in

(15)

• Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
• Tabu list management methods for a discrete-continuous scheduling problem
• On a methodology for discrete-continuous scheduling
• Tight bounds for the identical parallel machine scheduling problem
• Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function
• Improving local search heuristics for some scheduling problems. II
• Approximating the discrete resource sharing scheduling problem
• Improving local search heuristics for some scheduling problems. I
• 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
• Recent Advances in Constraints
• Discrete Time-Cost Tradeoff with a Novel Hybrid Meta-Heuristic
• Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation
• A survey of dynamic scheduling in manufacturing systems
• Structure vs. efficiency of the cross-entropy based population learning algorithm for discrete-continuous scheduling with continuous resource discretisation

Describes a project that uses

Uses Software

• Genocop
• CFSQP

This page was built for publication: Local search metaheuristics for discrete-continuous scheduling problems

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