Comparing the minimum completion times of two longest-first scheduling-heuristics
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
1864-3108
- Extent
-
Online-Ressource
- Language
-
Deutsch
- Bibliographic citation
-
Jena Research Papers in Business and Economics ; 2010,13
- Classification
-
Management
Mathematik
- Keyword
-
Produktionssteuerung
Durchlaufzeit
Terminplanung
Reihenfolgeplanung
Heuristik
Theorie
- Event
-
Veröffentlichung
- (where)
-
Jena
- (who)
-
Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät
- (when)
-
2010
- Creator
- URN
-
urn:nbn:de:101:1-201207193768
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 15.08.2025, 7:35 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Walter, Rico
- Friedrich-Schiller-Universität Jena, Wirtschaftswissenschaftliche Fakultät
Time of origin
- 2010
Other Objects (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