Improving local search heuristics for some scheduling problems—I

Local search heuristics for two-stage flow shop problems with secondary criterion

Computers and Operations Research

Performance Guarantees of Local Search for Multiprocessor Scheduling

Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization

An approximate König's theorem for edge-coloring weighted bipartite graphs

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing

Performance Guarantees of Local Search for Multiprocessor Scheduling

INFORMS Journal on Computing

Convergence time to Nash equilibrium in load balancing

ACM Transactions on Algorithms (TALG)

Convergence time to Nash equilibria

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming

A survey of approximation results for local search algorithms

Efficient Approximation and Online Algorithms

Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem

Mathematical and Computer Modelling: An International Journal

A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size

Mathematical and Computer Modelling: An International Journal