Publication Details
Title: Scheduling with Limited Machine Availability
Author: G. Schmidt
Group: ICSI Technical Reports
Date: October 1998
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1998/tr-98-036.pdf
Overview:
This paper reviews results related to deterministic scheduling problems where machines are not continuously available for processing. There might be incomplete information about the points of time machines change availability. The complexity of single and multi machine problems is analyzed considering criteria on completion times and due dates. The review mainly covers intractability results, polynomial optimization and approximation algorithms. In some places also results from enumerative algorithms and heuristics are surveyed. Keywords: scheduling theory, availability constraints, algorithms
Bibliographic Information:
ICSI Technical Report TR-98-036
Bibliographic Reference:
G. Schmidt. Scheduling with Limited Machine Availability. ICSI Technical Report TR-98-036, October 1998
Author: G. Schmidt
Group: ICSI Technical Reports
Date: October 1998
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1998/tr-98-036.pdf
Overview:
This paper reviews results related to deterministic scheduling problems where machines are not continuously available for processing. There might be incomplete information about the points of time machines change availability. The complexity of single and multi machine problems is analyzed considering criteria on completion times and due dates. The review mainly covers intractability results, polynomial optimization and approximation algorithms. In some places also results from enumerative algorithms and heuristics are surveyed. Keywords: scheduling theory, availability constraints, algorithms
Bibliographic Information:
ICSI Technical Report TR-98-036
Bibliographic Reference:
G. Schmidt. Scheduling with Limited Machine Availability. ICSI Technical Report TR-98-036, October 1998