Pages that link to "Item:Q954934"
From MaRDI portal
The following pages link to Tabu search for discrete-continuous scheduling problems with heuristic continuous resource allocation (Q954934):
Displaying 10 items.
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem (Q336380) (← links)
- Scheduling semiconductor multihead testers using metaheuristic techniques embedded with lot-specific and configuration-specific information (Q473662) (← links)
- Heuristic approaches to discrete-continuous project scheduling problems to minimize the makespan (Q535306) (← links)
- Simulated annealing for financing cost distribution based project payment scheduling from a joint perspective (Q744648) (← links)
- Discrete-continuous project scheduling with discounted cash inflows and various payment models -- a review of recent results (Q744660) (← links)
- Resource level minimization in the discrete-continuous scheduling (Q1043331) (← links)
- Total completion time minimization for machine scheduling problem under time windows constraints with jobs' linear processing rate function (Q1652513) (← links)
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
- Metaheuristics for multi-mode capital-constrained project payment scheduling (Q2253378) (← links)
- Comparative Analysis of Some Metaheuristics for Discrete-Continuous Project Scheduling with Activities of Identical Processing Rates (Q3188762) (← links)
