caa a22 4500 465774555 CHVBK 20180323111938.0 cr unu---uuuuu 170327e19901201xx s 000 0 eng 10.1007/BF02248592 doi (NATIONALLICENCE)springer-10.1007/BF02248592 de Werra D. Départment de Mathématiques, Chaire de Recherche Opérationnelle, Ecole Polytechnique Fédérale de Lausanne, CH-1015, Lausanne, Switzerland aut Almost nonpreemptive schedules [Elektronische Daten] [D. de Werra] Graph-theoretical models are described for solving preemptive and nonpreemptive scheduling problems with renewable resources. Conditions are obtained for nonpreemptive schedules to exist. These results may be applied for reducing the preemptions in the schedules obtained by the two-phase method developed for preemptive scheduling on unrelated processors. J.C. Baltzer AG, Scientific Publishing Company, 1990 Preemptive scheduling nationallicence line-perfect graphs nationallicence interval colorings nationallicence timetabling nationallicence productio systems nationallicence unrelated processors nationallicence chromatic scheduling nationallicence flexible manufacturing systems nationallicence Annals of Operations Research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers 26/1(1990-12-01), 243-256 0254-5330 26:1<243 1990 26 10479 https://doi.org/10.1007/BF02248592 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02248592 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- de Werra D. Départment de Mathématiques, Chaire de Recherche Opérationnelle, Ecole Polytechnique Fédérale de Lausanne, CH-1015, Lausanne, Switzerland aut NATIONALLICENCE 773 0- Annals of Operations Research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers 26/1(1990-12-01), 243-256 0254-5330 26:1<243 1990 26 10479 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer