{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T21:34:06Z","timestamp":1648676046593},"reference-count":21,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0377-2217(01)00207-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:12:54Z","timestamp":1027591974000},"page":"248-264","source":"Crossref","is-referenced-by-count":4,"title":["Linear and quadratic algorithms for scheduling chains and opposite chains"],"prefix":"10.1016","volume":"137","author":[{"given":"Jacek","family":"B\u0142a\u017cewicz","sequence":"first","affiliation":[]},{"given":"Zhen","family":"Liu","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00207-7_BIB1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0020-0190(84)90006-1","article-title":"Scheduling independent 2-processor tasks to minimize schedule length","volume":"18","author":"B\u0142a\u017cewicz","year":"1984","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB2","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1109\/TC.1986.1676781","article-title":"Scheduling multiprocessor tasks to minimize schedule length","volume":"35","author":"B\u0142a\u017cewicz","year":"1986","journal-title":"IEEE Transactions on Computers C"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB3","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0167-8191(94)90110-4","article-title":"Scheduling independent multiprocessor tasks on a uniform k-processor system","volume":"20","author":"B\u0142a\u017cewicz","year":"1994","journal-title":"Parallel Computing"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB4","doi-asserted-by":"crossref","unstructured":"J. B\u0142a\u017cewicz, K. Ecker, E. Pesch, G. Schmidt, J. W\u0229glarz, Scheduling Computer and Manufacturing Processes, 2nd ed., Springer, Berlin, New York, 2001","DOI":"10.1007\/978-3-662-04363-9"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0377-2217(96)00126-9","article-title":"Scheduling multiprocessor tasks with chain constraints","volume":"94","author":"B\u0142a\u017cewicz","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB6","unstructured":"P. Chretienne, E.G. Coffman, J.K. Lenstra, Z. Liu (Eds.), Scheduling Theory and its Applications, Wiley, New York, 1995"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB7","unstructured":"E.G. Coffman Jr. (Ed.), Computer and Job Scheduling Theory, Wiley, New York, 1976"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB8","series-title":"Selected Problems of Scheduling Tasks in Multiprocessor Computer Systems","author":"Drozdowski","year":"1996"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB9","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0402042","article-title":"Complexity of scheduling parallel task systems","volume":"2","author":"Du","year":"1989","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","article-title":"Optimization and approximation in deterministic sequencing and scheduling theory: A survey","volume":"5","author":"Graham","year":"1979","journal-title":"Annals of Discrete Mathematics"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB11","doi-asserted-by":"crossref","unstructured":"J.L. Gustafson, R.E. Benner, M.P. Sears, T.D. Sullivan, A radar simulation for a 1024-processor hypercube, in: Proceedings of Supercomputing 1989, ACM Press, New York, 1989, pp. 96\u2013105","DOI":"10.1145\/76263.76274"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB12","doi-asserted-by":"crossref","first-page":"841","DOI":"10.1287\/opre.9.6.841","article-title":"Parallel sequencing and assembly line problems","volume":"9","author":"Hu","year":"1961","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB13","doi-asserted-by":"crossref","unstructured":"E.L. Lawler, Preemptive scheduling of precedence constrained scheduling, in: Dempster et al. (Eds.), Deterministic and Stochastic Scheduling, Reidel, Dordrecht, 1982, pp. 101\u2013123","DOI":"10.1007\/978-94-009-7801-0_6"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB14","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0166-218X(93)E0151-N","article-title":"Preemptive scheduling with variable profile, Precedence constraints and due dates","volume":"58","author":"Liu","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1287\/opre.29.1.189","article-title":"Concurrent task systems","volume":"29","author":"Lloyd","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB16","series-title":"Inequalities: Theory of Majorization and its Applications","author":"Marshall","year":"1979"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","article-title":"Scheduling with deadlines and loss functions","volume":"12","author":"McNaughton","year":"1959","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB18","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1145\/321574.321586","article-title":"Preemptive scheduling of real-time tasks on multiprocessor systems","volume":"17","author":"Muntz","year":"1970","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB19","series-title":"Machine Scheduling Problems: Classification, Complexity and Computations","author":"Rinnooy Kan","year":"1976"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB20","series-title":"Distributed operating systems","author":"Tanenbaum","year":"1995"},{"key":"10.1016\/S0377-2217(01)00207-7_BIB21","unstructured":"B. Veltman, Multiprocessor scheduling with communication delays, Ph.D. Thesis, CWI-Amsterdam, 1993"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002077?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002077?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T06:21:41Z","timestamp":1556864501000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701002077"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0377221701002077"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00207-7","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}