Two exponential neighborhoods for single machine scheduling

T. Brueggemann, Johann L. Hurink

Research output: Book/ReportReportProfessional

23 Downloads (Pure)

Abstract

We study the problem of minimizing total completion time on a single machine with the presence of release dates. We present two different approaches leading to exponential 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.
Original languageUndefined
Place of PublicationEnschede
PublisherUniversity of Twente, Department of Applied Mathematics
Number of pages24
ISBN (Print)0169-2690
Publication statusPublished - 2005

Publication series

NameMemorandum Afdeling TW
PublisherDepartment of Applied Mathematics, University of Twente
No.1776
ISSN (Print)0169-2690

Keywords

  • MSC-68M20
  • MSC-90B35
  • IR-65960
  • METIS-225434
  • EWI-3596

Cite this

Brueggemann, T., & Hurink, J. L. (2005). Two exponential neighborhoods for single machine scheduling. (Memorandum Afdeling TW; No. 1776). Enschede: University of Twente, Department of Applied Mathematics.