Local search metaheuristics for discrete-continuous scheduling problems
From MaRDI portal
Publication:1296094
DOI10.1016/S0377-2217(97)00345-7zbMATH Open0943.90034MaRDI QIDQ1296094FDOQ1296094
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)
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
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35)
Cites Work
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
- Recent Advances in Constraints
- 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
- 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
Uses Software
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)