EEMCS
Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


10316 Two very large-scale neighborhoods for single machine scheduling
 Home Policy Brochure Browse Search User Area Contact Help

Brueggemann, T. and Hurink, J.L. (2007) Two very large-scale neighborhoods for single machine scheduling. OR Spectrum, 29 (3). pp. 513-533. ISSN 0171-6468 *** ISI Impact 2,030 ***

Full text available as:

PDF
 - Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
257 Kb

Official URL: http://dx.doi.org/10.1007/s00291-006-0052-5

Exported to Metis

Abstract

In this paper, the problem of minimizing the total completion time on a single machine with the presence of release dates is studied. We introduce two different approaches leading to very large-scale neighborhoods in which the best improving neighbor can be determined in polynomial time. Furthermore, computational results are presented to get insight in the performance of the developed neighborhoods.

Item Type:Article
Research Group:EWI-DMMP: Discrete Mathematics and Mathematical Programming
Research Program:CTIT-IE&ICT: Industrial Engineering and ICT
Research Project:BRICKS/IS3: Decision Support Systems for Logistic Networks and Supply Chain Optimization
Uncontrolled Keywords:Very large-scale neighborhoods, Local search, Single machine
ID Code:10316
Status:Published
Deposited On:13 July 2007
Refereed:Yes
International:Yes
ISI Impact Factor:2,030
More Information:statisticsmetis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item