Lower bounds for single machine subproblems occurring in weighted tardiness oriented shifting bottleneck procedures

Roland Braune, Günther Zäpfel, Michael Affenzeller

Publikation: Beitrag in Buch/Bericht/TagungsbandKonferenzbeitrag

2 Zitate (Scopus)

Abstract

In this paper, we propose lower bounds for single machine scheduling problems which occur during a run of a shifting bottleneck procedure for total weighted tardiness job shops. The specific structure of this kind of problem and its objective function in particular prevent an immediate transfer or an adaption of existing lower bounds from conventional single machine problems with tardiness related objectives. Hence it has been necessary to develop bounding approaches which are to some extent conceptually new. Potential application scenarios range from exact subproblem solution methods or machine prioritization criteria in a shifting bottleneck procedure to branch-and-bound algorithms for job shops with total weighted tardiness objective. In order to provide a significant evaluation of the proposed lower bounds regarding their effectiveness and efficiency, we tested them based on problem instances which actually have been generated in a shifting bottleneck procedure applied to benchmark job shop problems.

OriginalspracheEnglisch
TitelIEEE SSCI 2011 - Symposium Series on Computational Intelligence - CISched 2011
Untertitel2011 IEEE Symposium on Computational Intelligence in Scheduling
Herausgeber (Verlag)IEEE Computational Intelligence Society
Seiten25-32
Seitenumfang8
ISBN (Print)9781612841960
DOIs
PublikationsstatusVeröffentlicht - 2011
VeranstaltungIEEE Symposium on Computational Intelligence in Scheduling - Paris, Frankreich
Dauer: 11 Apr. 201115 Apr. 2011
http://www.ntu.edu.sg/home/epnsugan/index_files/SSCI2013/index.html

Publikationsreihe

NameIEEE SSCI 2011 - Symposium Series on Computational Intelligence - CISched 2011: 2011 IEEE Symposium on Computational Intelligence in Scheduling

Konferenz

KonferenzIEEE Symposium on Computational Intelligence in Scheduling
Land/GebietFrankreich
OrtParis
Zeitraum11.04.201115.04.2011
Internetadresse

Fingerprint

Untersuchen Sie die Forschungsthemen von „Lower bounds for single machine subproblems occurring in weighted tardiness oriented shifting bottleneck procedures“. Zusammen bilden sie einen einzigartigen Fingerprint.

Zitieren