{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T22:21:06Z","timestamp":1779920466139,"version":"3.53.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,3,6]],"date-time":"2013-03-06T00:00:00Z","timestamp":1362528000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10951-013-0320-6","type":"journal-article","created":{"date-parts":[[2013,3,5]],"date-time":"2013-03-05T14:15:46Z","timestamp":1362492946000},"page":"429-435","source":"Crossref","is-referenced-by-count":16,"title":["An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem"],"prefix":"10.1007","volume":"16","author":[{"given":"Amir","family":"Elalouf","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eugene","family":"Levner","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Huajun","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,3,6]]},"reference":[{"key":"320_CR1","doi-asserted-by":"crossref","unstructured":"Choi, B. C., & Yoon, S. H. (2007). Maximizing the weighted number of just-in-time jobs in flow shop scheduling. Journal of Scheduling, 10, 237\u2013243.","DOI":"10.1007\/s10951-007-0030-z"},{"key":"320_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-24175-8_1","volume":"88","author":"A Elalouf","year":"2011","unstructured":"Elalouf, A., Levner, E., & Cheng, T. C. E. (2011). Efficient routing of mobile agents for agent-based integrated enterprise management: A general acceleration technique. Lecture Notes in Business Information Processing, 88, 1\u201320.","journal-title":"Lecture Notes in Business Information Processing"},{"key":"320_CR3","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0020-0190(02)00205-3","volume":"83","author":"F Ergun","year":"2002","unstructured":"Ergun, F., Sinha, R., & Zhang, L. (2002). An improved FPTAS for restricted shortest path. Information Processing Letters, 83, 287\u2013291.","journal-title":"Information Processing Letters"},{"key":"320_CR4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0166-218X(81)90008-1","volume":"3","author":"GV Gens","year":"1981","unstructured":"Gens, G. V., & Levner, E. V. (1981). Fast approximation algorithm for job sequencing with deadlines. Discrete Applied Mathematics, 3, 313\u2013318.","journal-title":"Discrete Applied Mathematics"},{"key":"320_CR5","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., & Lenstra, J. K. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"1","key":"320_CR6","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R Hassin","year":"1992","unstructured":"Hassin, R. (1992). Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research, 17(1), 36\u201342.","journal-title":"Mathematics of Operations Research"},{"key":"320_CR7","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1016\/0305-0548(95)00078-X","volume":"23","author":"A Lann","year":"1996","unstructured":"Lann, A., & Mosheiov, G. (1996). Single machine scheduling to minimize the number of early and tardy jobs. Computers and Operations Research, 23, 765\u2013781.","journal-title":"Computers and Operations Research"},{"issue":"13","key":"320_CR8","first-page":"1854","volume":"17","author":"E Levner","year":"2011","unstructured":"Levner, E., Elalouf, A., & Cheng, T. C. E. (2011). An improved FPTAS for Mobile Agent Routing with Time Constraints. Journal of Universal Computer Science, 17(13), 1854\u20131862.","journal-title":"Journal of Universal Computer Science"},{"issue":"5","key":"320_CR9","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"DH Lorenz","year":"2001","unstructured":"Lorenz, D. H., & Raz, D. (2001). A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letters, 28(5), 213\u2013219.","journal-title":"Operations Research Letters"},{"issue":"1","key":"320_CR10","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/s10951-010-0204-y","volume":"15","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D., & Bensoussan, Y. (2012). Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems. Journal of Scheduling, 15(1), 39\u201347.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0320-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-013-0320-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-013-0320-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:48Z","timestamp":1559468388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-013-0320-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,6]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["320"],"URL":"https:\/\/doi.org\/10.1007\/s10951-013-0320-6","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,6]]}}}