Local search performance guarantees for restricted related parallel machine scheduling

We consider the problem of minimizing the makespan on restricted related parallel machines. In restricted machine scheduling each job is only allowed to be scheduled on a subset of machines. We study the worst-case behavior of local search algorithms. In particular, we analyze the quality of local optima with respect to the jump, swap, push and lexicographical jump neighborhood.

MoreLess

Year of publication:	2009
Authors:	Diego, Recalde ; Cyriel, Rutten ; Petra, Schuurman ; Tjark, Vredeveld
Institutions:	Graduate School of Business and Economics (GSBE), School of Business and Economics
Subject:	operations research and management science

More details

Extent:	application/pdf
Series:	Research Memorandum.
Type of publication:	Book / Working Paper
Notes:	The text is part of a series Research Memoranda Number 061
Source:	RePEc - Research Papers in Economics

Persistent link: https://ebvufind01.dmz1.zbw.eu/10011146980