caa a22 4500 465774571 CHVBK 20180323111938.0 cr unu---uuuuu 170327e19901201xx s 000 0 eng 10.1007/BF02248586 doi (NATIONALLICENCE)springer-10.1007/BF02248586 Posner Marc The Ohio State University, 43210, Columbus, Ohio, USA aut Reducibility among single machine weighted completion time scheduling problems [Elektronische Daten] [Marc Posner] Various sum of weighted completion time problems are compared. The constraints considered include release date, deadline, and continuous machine processing. Relations between the problems are developed by examining the computational complexity of transforming one problem class into another. These results give indications of the relative computational effort required to solve different problem classes. J.C. Baltzer AG, Scientific Publishing Company, 1990 Weighted completion time nationallicence scheduling nationallicence complexity nationallicence Annals of Operations Research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers 26/1(1990-12-01), 90-101 0254-5330 26:1<90 1990 26 10479 https://doi.org/10.1007/BF02248586 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02248586 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Posner Marc The Ohio State University, 43210, Columbus, Ohio, USA aut NATIONALLICENCE 773 0- Annals of Operations Research Baltzer Science Publishers, Baarn/Kluwer Academic Publishers 26/1(1990-12-01), 90-101 0254-5330 26:1<90 1990 26 10479 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer