{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T12:42:42Z","timestamp":1648730562279},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1990,8,1]],"date-time":"1990-08-01T00:00:00Z","timestamp":649468800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8386,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1990,8]]},"DOI":"10.1016\/0166-218x(90)90109-p","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:46:59Z","timestamp":1027655219000},"page":"93-109","source":"Crossref","is-referenced-by-count":0,"title":["On the continuous working problem"],"prefix":"10.1016","volume":"28","author":[{"given":"R.S.","family":"Chang","sequence":"first","affiliation":[]},{"given":"R.C.T.","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90109-P_BIB1","first-page":"399","article-title":"On an assignment problem where each job can only be assigned to a limited number of men","author":"Chang","year":"1987","journal-title":"Proceedings of the National Computer Symposium, Taipei, Taiwan"},{"key":"10.1016\/0166-218X(90)90109-P_BIB2","series-title":"Sequencing and Scheduling: An Introduction to the Mathematics of the Job Shop","author":"French","year":"1982"},{"key":"10.1016\/0166-218X(90)90109-P_BIB3","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1137\/0204035","article-title":"Complexity results for multiprocessor scheduling under resource constraints","volume":"4","author":"Garey","year":"1975","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(90)90109-P_BIB4","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(90)90109-P_BIB5","first-page":"28","article-title":"Correction to a formed basis for the heuristic determination of minimum cost paths","volume":"37","author":"Hart","year":"1980","journal-title":"SIGART Newslett."},{"key":"10.1016\/0166-218X(90)90109-P_BIB6","series-title":"Combinatorial Optimization: Network and Matroids","author":"Lawler","year":"1976"},{"key":"10.1016\/0166-218X(90)90109-P_BIB7","series-title":"Tech. Rept. BW 188\/83","article-title":"Scheduling theory since 1981: an annotated bibliography","author":"Lenstra","year":"1983"},{"key":"10.1016\/0166-218X(90)90109-P_BIB8","series-title":"Principles of Artificial Intelligence","author":"Nilsson","year":"1980"},{"key":"10.1016\/0166-218X(90)90109-P_BIB9","series-title":"Heuristics: Intelligent Search Strategies for Computer Problem Solving","author":"Pearl","year":"1984"},{"key":"10.1016\/0166-218X(90)90109-P_BIB10","series-title":"Machine Scheduling Problems: Classification, Complexity, and Computations","author":"Kan","year":"1976"},{"key":"10.1016\/0166-218X(90)90109-P_BIB11","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/321439.321444","article-title":"Experiments with a multipurpose theorem-proving heuristic program","volume":"15","author":"Slagle","year":"1968","journal-title":"J. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090109P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090109P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:50:47Z","timestamp":1555131047000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090109P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,8]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1990,8]]}},"alternative-id":["0166218X9090109P"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90109-p","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,8]]}}}