Efficient heuristic optimization in single machine scheduling

Research output: Chapter in Book/Report/Conference proceedingsConference contributionpeer-review

4 Citations (Scopus)

Abstract

In this paper, we present a comparison of heuristic optimization algorithms for single machine schedul- ing problems with and without arbitrary job release times. The main focus of our analysis is the e?- ciency of the examined methods, i.e. how they per- form under strictly limited computation time. Fur- thermore, we study the e®ects of arbitrary release times on problem di?culty and required computa- tion time. Experimental results are presented for benchmark problem instances of reasonable size.

Original languageEnglish
Title of host publicationInternational Mediterranean Modelling Multiconference, IMM
Pages499-504
Number of pages6
Publication statusPublished - 2006
EventInternational Mediterranean Modelling Multiconference, I3M 2006 - Barcelona, Spain
Duration: 4 Oct 20066 Oct 2006

Publication series

NameInternational Mediterranean Modelling Multiconference, I3M

Conference

ConferenceInternational Mediterranean Modelling Multiconference, I3M 2006
CountrySpain
CityBarcelona
Period04.10.200606.10.2006

Keywords

  • Genetic Algorithms
  • Heuristic Optimization
  • Neighborhood Search
  • Production Scheduling
  • Single Machine
  • Tabu Search

Fingerprint Dive into the research topics of 'Efficient heuristic optimization in single machine scheduling'. Together they form a unique fingerprint.

Cite this