Scheduling High Multiplicity Coupled Tasks

[1] Blazewicz J., Ecker K., Kis T., Potts C., Tanas M., and Whitehead J. Scheduling of coupled tasks with unit processing times. Journal of Scheduling, pages 1–9, 2010.10.1007/s10951-010-0167-zSearch in Google Scholar

[2] Blazewicz J., Ecker K., Pesch E., Schmidt G., and Weglarz J. Handbook of Scheduling. From Theory to Applications. Springer Verlag, 2007.Search in Google Scholar

[3] Blazewicz J., Pawlak G., Tanas M., and Wojciechowicz W. New algorithms for coupled tasks scheduling - A survey. RAIRO - Operations Research - Recherche Opérationnelle, 46:335–353, 2012.10.1051/ro/2012020Search in Google Scholar

[4] Brauner N., Crama Y., Grigoriev A., and van de Klundert J. A framework for the complexity of high-multiplicity scheduling problems. Journal of combinatorial optimization, 9(3):313–323, 2005.10.1007/s10878-005-1414-7Search in Google Scholar

[5] Clifford J. and Posner M. Parallel machine scheduling with high multiplicity. Mathematical programming, 89(3):359–383, 2001.10.1007/PL00011403Search in Google Scholar

[6] Graham R., Lawler E., Lenstra J., and Kan A. R. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5:287–326, 1979.10.1016/S0167-5060(08)70356-XSearch in Google Scholar

[7] Heinselman P., Preignitz D., anf T.M. Smith K. M., and Adams R. Rapid sampling of severe storms by the national weather radar testbed phased array radar. Weather Forecasting, 23:808–824, 2008.10.1175/2008WAF2007071.1Search in Google Scholar

[8] Hochbaum D. and Shamir R. Strongly polynomial algorithms for the high multiplicity scheduling problem. Operations Research, pages 648–653, 1991.10.1287/opre.39.4.648Search in Google Scholar

[9] Orman A. and Potts C. On the complexity of coupled-task scheduling. Discrete Applied Mathematics, 72(1-2):141–154, 1997.10.1016/S0166-218X(96)00041-8Search in Google Scholar

[10] Shapiro R. Scheduling coupled tasks. Naval Research Logistics Quarterly, 27(3):489–498, 1980.10.1002/nav.3800270312Search in Google Scholar