TitleThe Knapsack-Lightening problem and its application to scheduling HRT tasks
Journal titleBulletin of the Polish Academy of Sciences: Technical Sciences
Divisions of PASNauki Techniczne
ReferencesBłażewicz J. (2000), Parallel branch and bound algorithms for the twomachine flow shop problem with limited machine availability, Bull. Pol. Ac.: Tech, 48, 1, 105. ; W. Complak, "Deterministic approach to the notebook memory management in systems strongly conditioned by time", <i>Doctoral Dissertation</i>, Poznań University of Technology, Poznań, 2001, (in Polish). ; Kellerer H. (2004), Knapsack Problems. ; Nawrocki J. (1994), Optimization of region-based storage allocation, Bull. Pol. Ac.: Tech, 42, 4, 605. ; Nawrocki J. (1998), Task classyfying in systems strongly conditioned by time with the use of the metod of cyclic loading, Silesian University of Technology Periodicals: Automatics, 1389, 169. ; Schweitzer P. (1988), The periodic loading problem: formulation and heuristics, INFOR, 26, 1, 40. ; Yu G. (1996), On the max-min 0-1 Knapsack problem with robust optimization applications, Operations Research, 44, 2, 407. ; Zeng D. (2006), Efficient scheduling of periodic information monitoring requests, EJOR, 173, 2, 583.