scientific article; zbMATH DE number 1757968

MaRDI QIDQ4537756zbMATH OpenFDO

Authors T. Vredeveld, P. Schuurman

Publication date 20 June 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2081/20810370

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Performance guarantees of local search for multiprocessor scheduling
• Performance guarantees of local search for minsum scheduling problems
• Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
• Performance guarantee of the jump neighborhood for scheduling jobs on uniformly related machines
• Local search for multiprocessor scheduling: how many moves does it take to a local optimum?

Cited in

(15)

• Local search for multiprocessor scheduling: how many moves does it take to a local optimum?
• Local search algorithms for the multiprocessor flow shop scheduling problem
• Local search for the minimum label spanning tree problem with bounded color classes.
• Performance guarantees of local search for minsum scheduling problems
• Quality of move-optimal schedules for minimizing total weighted completion time
• Structure and complexity of extreme Nash equilibria
• Exponential size neighborhoods for makespan minimization scheduling
• Performance guarantees of local search for multiprocessor scheduling
• Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines
• Optimal coordination mechanisms for unrelated machine scheduling
• Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling
• Performance guarantees of jump neighborhoods on restricted related parallel machines
• Running time of local search algorithms for a scheduling problem on the parallel machines
• Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
• Approximate Strong Equilibrium in Job Scheduling Games

This page was built for publication:

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