Pages that link to "Item:Q5961605"
From MaRDI portal
The following pages link to Improving local search heuristics for some scheduling problems. II (Q5961605):
Displaying 20 items.
- Performance guarantees of jump neighborhoods on restricted related parallel machines (Q453054) (← links)
- Comparison of iterative improvement techniques for schedule optimization (Q1278321) (← links)
- Generalized pairwise interchanges and machine scheduling (Q1388824) (← links)
- A comparative study of both standard and adaptive versions of threshold accepting and simulated annealing algorithms in three scheduling problems (Q1388828) (← links)
- Local search for multiprocessor scheduling: how many moves does it take to a local optimum? (Q1413905) (← links)
- Local search for shift design. (Q1417484) (← links)
- A repairing technique for the local search of the job-shop problem. (Q1417509) (← links)
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
- Deterministic job-shop scheduling: Past, present and future (Q1807948) (← links)
- Improving local search heuristics for some scheduling problems. I (Q1917263) (← links)
- Performance guarantees of local search for minsum scheduling problems (Q2118098) (← links)
- Quality of move-optimal schedules for minimizing total weighted completion time (Q2480059) (← links)
- Structure and complexity of extreme Nash equilibria (Q2570130) (← links)
- A local search using solution fragments for the 2-machine bicriteria scheduling problem (Q2643628) (← links)
- Exponential size neighborhoods for makespan minimization scheduling (Q2892138) (← links)
- Bounds for the Convergence Time of Local Search in Scheduling Problems (Q2959840) (← links)
- Tight bounds for the identical parallel machine scheduling problem (Q3429035) (← links)
- An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem (Q5174415) (← links)
- Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines (Q5443371) (← links)
- Local search heuristics for two-stage flow shop problems with secondary criterion (Q5955475) (← links)
