{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T13:29:45Z","timestamp":1676035785097},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1989,9,1]],"date-time":"1989-09-01T00:00:00Z","timestamp":620611200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ZOR - Methods and Models of Operations Research"],"published-print":{"date-parts":[[1989,9]]},"DOI":"10.1007\/bf01416077","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T14:52:30Z","timestamp":1112539950000},"page":"297-313","source":"Crossref","is-referenced-by-count":7,"title":["Preemptive scheduling with staircase and piecewise linear resource availability"],"prefix":"10.1007","volume":"33","author":[{"given":"M.","family":"Cochand","sequence":"first","affiliation":[]},{"given":"D.","family":"Werra","sequence":"additional","affiliation":[]},{"given":"R.","family":"Slowinski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Graphes","author":"C Berge","year":"1983","unstructured":"Berge C (1983) Graphes. Gauthier-Villars, Paris"},{"key":"CR2","first-page":"155","volume":"6","author":"J Blazewicz","year":"1976","unstructured":"Blazewicz J, Cellary W, Slowinski R, Weglarz J (1976) Deterministy czne problemy szeregowaia zadan na rownoleglych procesorach, Cz. I. Zbiory Zadanniezaleznych, Podstawy Sterowania 6:155?178","journal-title":"Podstawy Sterowania"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/322092.322101","volume":"25","author":"E-L Lawler","year":"1978","unstructured":"Lawler E-L, Labetoulle J (1978) On preemptive scheduling of unrelated processors by linear programming. J Assoc Comput Mach 25:612?619","journal-title":"J Assoc Comput Mach"},{"key":"CR4","first-page":"711","volume":"31","author":"R Slowinski","year":"1980","unstructured":"Slowinski R (1980) Two approches to problems of resource allocation among project activities ? a comparative study. J Opl Res Soc 31:711?723","journal-title":"J Opl Res Soc"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0020-0190(79)90076-0","volume":"9","author":"R Slowinski","year":"1979","unstructured":"Slowinski R (1979) Cost-minimal preemptive scheduling of independent jobs with release and due dates on open shop under resource constraints. Information Processing Letters 9:233?237","journal-title":"Information Processing Letters"},{"key":"CR6","first-page":"155","volume":"15","author":"R Slowinski","year":"1981","unstructured":"Slowinski R (1981) L'ordonnancement des t\u00e2ches pr\u00e9emptives sur les processeurs ind\u00e9pendants en pr\u00e9sence de ressources suppl\u00e9mentaires. RAIRO Informatique 15:155?166","journal-title":"RAIRO Informatique"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1016\/0377-2217(84)90105-X","volume":"15","author":"R Slowinski","year":"1984","unstructured":"Slowinski R (1984) Preemptive scheduling of independent jobs on parallel machines subject to financial constraints. European J of Operational Research 15:366?373","journal-title":"European J of Operational Research"},{"key":"CR8","first-page":"521","volume-title":"Proc. of the 6th INTERNET Congress, vol 2","author":"J Weglarz","year":"1979","unstructured":"Weglarz J (1979) New models and procedures for resource allocation problems. Proc. of the 6th INTERNET Congress, vol 2. VDI-Verlag GmbH, D\u00fcsseldorf, pp 521?530"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1040","DOI":"10.1287\/mnsc.27.9.1040","volume":"27","author":"J Weglarz","year":"1981","unstructured":"Weglarz J (1981) Project scheduling with continuously-divisible, doubly constrained resources. Management Sci 27:1040?1053","journal-title":"Management Sci"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1137\/0605003","volume":"5","author":"D Werra de","year":"1984","unstructured":"de Werra D (1984) Preemptive scheduling, linear programming and network flows. SIAM J on Algebraic and Discrete Methods 5:11?20","journal-title":"SIAM J on Algebraic and Discrete Methods"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02591932","volume":"30","author":"D Werra de","year":"1984","unstructured":"de Werra D (1984) A decomposition property of polyhedra. Mathematical Programming 30:261?266","journal-title":"Mathematical Programming"}],"container-title":["ZOR Zeitschrift f\ufffdr Operations Research Methods and Models of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01416077.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01416077\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01416077","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T17:12:42Z","timestamp":1556817162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01416077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,9]]},"references-count":11,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1989,9]]}},"alternative-id":["BF01416077"],"URL":"https:\/\/doi.org\/10.1007\/bf01416077","relation":{},"ISSN":["0340-9422","1432-5217"],"issn-type":[{"value":"0340-9422","type":"print"},{"value":"1432-5217","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,9]]}}}