Local search metaheuristics for discrete-continuous scheduling problems

DOI10.1016/S0377-2217(97)00345-7zbMath0943.90034MaRDI QIDQ1296094

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

Publication date: 13 September 1999

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

zbMATH Keywords

simulated annealingtabu searchgenetic algorithmheuristic searchdiscrete-continuous scheduling

Mathematics Subject Classification ID

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

Related Items

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 ⋮ A survey of dynamic scheduling in manufacturing systems ⋮ Resource level minimization in the discrete-continuous scheduling ⋮ Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs ⋮ On a methodology for discrete-continuous scheduling ⋮ Tight bounds for the identical parallel machine scheduling problem ⋮ A heuristic approach to allocating the continuous resource in discrete--continuous scheduling problems to minimize the makespan ⋮ Tabu list management methods for a discrete-continuous scheduling problem ⋮ Structure vs. Efficiency of the Cross-Entropy Based Population Learning Algorithm for Discrete-Continuous Scheduling with Continuous Resource Discretisation

Uses Software

• CFSQP
• Genocop

Cites Work

• On a methodology for discrete-continuous scheduling
• Tabu Search—Part I
• Tabu Search—Part II
• Unnamed Item
• Unnamed Item
• Unnamed Item