{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:56:26Z","timestamp":1761486986478},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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":["Computers & Industrial Engineering"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0360-8352(03)00042-1","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"215-229","source":"Crossref","is-referenced-by-count":17,"title":["Scheduling for on-time completion in job shops using feasibility function"],"prefix":"10.1016","volume":"45","author":[{"given":"Attila","family":"Lengyel","sequence":"first","affiliation":[]},{"given":"Itsuo","family":"Hatono","sequence":"additional","affiliation":[]},{"given":"Kanji","family":"Ueda","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0360-8352(03)00042-1_BIB2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/S0921-8890(00)00087-7","article-title":"Dynamic job-shop scheduling using reinforcement learning agents","volume":"33","author":"Aydin","year":"2000","journal-title":"Robotics and Autonomous Systems"},{"key":"10.1016\/S0360-8352(03)00042-1_BIB3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0272-6963(83)90022-0","article-title":"Job shop scheduling with modified due dates","volume":"4","author":"Baker","year":"1983","journal-title":"Journal of Operations Management"},{"key":"10.1016\/S0360-8352(03)00042-1_BIB4","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","article-title":"Sequencing with earliness and tardiness penalties: a review","volume":"38","author":"Baker","year":"1989","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/S0360-8352(03)00042-1_BIB5","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0360-8352(97)00317-3","article-title":"Job shop scheduling for missed due date performance","volume":"34","author":"Cheng","year":"1997","journal-title":"Computers & Industrial Engineering"},{"key":"10.1016\/S0360-8352(03)00042-1_BIB6","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0377-2217(97)00019-2","article-title":"Benchmarks for shop scheduling problems","volume":"109","author":"Demirkol","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0360-8352(03)00042-1_BIB7","unstructured":"Dertouzos, M. L (1974). Control robotics: The procedural control of physical processes. Proceedings of the IFIP Congress (pp. 807\u2013813)."},{"key":"10.1016\/S0360-8352(03)00042-1_BIB8","unstructured":"Hopp, Wallace J., Spearman, Mark L., (1996). Factory physics. Times Mirror Company."},{"key":"10.1016\/S0360-8352(03)00042-1_BIB9","unstructured":"Jackson, J.R., (1955). Scheduling a production line to minimize maximum tardiness. Management Science Research Project Report 43. University of California."},{"key":"10.1016\/S0360-8352(03)00042-1_BIB10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0305-0548(91)90098-C","article-title":"Minimizing weighted number of tardy jobs and weighted earliness tardiness penalties about a common due date","volume":"18","author":"Lee","year":"1991","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0360-8352(03)00042-1_BIB11","unstructured":"Mok, A. K (1983). Fundamental Design Problems of Distributed Systems for the Hard-Real-time Environment. PhD thesis. Massachusetts institute of technology."},{"issue":"4","key":"10.1016\/S0360-8352(03)00042-1_BIB12","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0954-1810(01)00028-0","article-title":"Emergent synthesis","volume":"15","author":"Ueda","year":"2001","journal-title":"Artificial Intelligence in Engineering"},{"key":"10.1016\/S0360-8352(03)00042-1_BIB13","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0360-8352(01)00043-2","article-title":"Computer simulation of due-date setting in multi-machine job shops","volume":"41","author":"Veral","year":"2001","journal-title":"Computers & Industrial Engineering"},{"issue":"2","key":"10.1016\/S0360-8352(03)00042-1_BIB14","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0305-0548(99)00097-0","article-title":"Single-machine scheduling with a common due window","volume":"28","author":"Yeunga","year":"2001","journal-title":"Computers and Operations Research"}],"container-title":["Computers & Industrial Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835203000421?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0360835203000421?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T11:51:11Z","timestamp":1553169071000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0360835203000421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0360835203000421"],"URL":"https:\/\/doi.org\/10.1016\/s0360-8352(03)00042-1","relation":{},"ISSN":["0360-8352"],"issn-type":[{"value":"0360-8352","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}