Article ID: | iaor1999151 |
Country: | Netherlands |
Volume: | 90 |
Issue: | 2 |
Start Page Number: | 214 |
End Page Number: | 226 |
Publication Date: | Apr 1996 |
Journal: | European Journal of Operational Research |
Authors: | Brucker Peter, Krmer Andreas |
Keywords: | job shop, flowshop |
Resource-constrained scheduling problems with a fixed number of task types are considered in which, in addition, either the processing times are bounded or the number of processors is fixed. For problems with makespan, (weighted) mean flow time, weighted number of tardy tasks, and sum of tardiness as objective functions polynomial time algorithms are presented. These algorithms generalize results derived by Blażewicz