Comparing the minimum completion times of two longest-first scheduling-heuristics
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1864-3108
- Umfang
-
Online-Ressource
- Sprache
-
Deutsch
- Erschienen in
-
Jena Research Papers in Business and Economics ; 2010,13
- Klassifikation
-
Management
Mathematik
- Schlagwort
-
Produktionssteuerung
Durchlaufzeit
Terminplanung
Reihenfolgeplanung
Heuristik
Theorie
- Ereignis
-
Veröffentlichung
- (wo)
-
Jena
- (wer)
-
Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät
- (wann)
-
2010
- Urheber
- URN
-
urn:nbn:de:101:1-201207193768
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
- 15.08.2025, 07:35 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Walter, Rico
- Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät
Entstanden
- 2010
Ähnliche Objekte (12)
2010,13 : Comparing the minimum completion times of two longest-first scheduling-heuristics
Scheduling coupled tasks with exact delays for minimum total job completion time
Future-proof scheduling heuristics for TTEthernet
Heuristics for resource levelling problems in project scheduling with minimum and maximum time lags
Computing minimum cuts by randomized search heuristics
Computing Minimum Cuts by Randomized Search Heuristics
Parameterized heuristics for project scheduling: Biased random sampling methods
Class-based control schemes for parameterized project scheduling heuristics
New heuristics for the minimum fundamental cut basis problem
Heuristics for scheduling data gathering with limited base station memory
Problem specific heuristics for group scheduling problems in cellular manufacturing
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
2010,13 : Comparing the minimum completion times of two longest-first scheduling-heuristics
Scheduling coupled tasks with exact delays for minimum total job completion time
Future-proof scheduling heuristics for TTEthernet
Heuristics for resource levelling problems in project scheduling with minimum and maximum time lags
Computing minimum cuts by randomized search heuristics
Computing Minimum Cuts by Randomized Search Heuristics
Parameterized heuristics for project scheduling: Biased random sampling methods
Class-based control schemes for parameterized project scheduling heuristics
New heuristics for the minimum fundamental cut basis problem
Heuristics for scheduling data gathering with limited base station memory
Problem specific heuristics for group scheduling problems in cellular manufacturing
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences
2010,13 : Comparing the minimum completion times of two longest-first scheduling-heuristics
Scheduling coupled tasks with exact delays for minimum total job completion time
Future-proof scheduling heuristics for TTEthernet
Heuristics for resource levelling problems in project scheduling with minimum and maximum time lags
Computing minimum cuts by randomized search heuristics
Computing Minimum Cuts by Randomized Search Heuristics
Parameterized heuristics for project scheduling: Biased random sampling methods
Class-based control schemes for parameterized project scheduling heuristics
New heuristics for the minimum fundamental cut basis problem
Heuristics for scheduling data gathering with limited base station memory
Problem specific heuristics for group scheduling problems in cellular manufacturing