{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T12:01:00Z","timestamp":1780056060339,"version":"3.54.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,3,13]],"date-time":"2012-03-13T00:00:00Z","timestamp":1331596800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10479-012-1107-4","type":"journal-article","created":{"date-parts":[[2012,3,12]],"date-time":"2012-03-12T09:58:35Z","timestamp":1331546315000},"page":"221-234","source":"Crossref","is-referenced-by-count":22,"title":["Scheduling job families on non-identical parallel machines with time constraints"],"prefix":"10.1007","volume":"213","author":[{"given":"Ali","family":"Obeid","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"St\u00e9phane","family":"Dauz\u00e8re-P\u00e9r\u00e8s","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Claude","family":"Yugma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,3,13]]},"reference":[{"issue":"6","key":"1107_CR1","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s10951-010-0203-z","volume":"14","author":"B. Detienne","year":"2011","unstructured":"Detienne, B., Dauz\u00e8re-P\u00e9r\u00e8s, S., & Yugma, C. (2011). Scheduling jobs on parallel machines to minimize a regular step total cost function. Journal of Scheduling, 14(6), 523\u2013538.","journal-title":"Journal of Scheduling"},{"key":"1107_CR2","doi-asserted-by":"crossref","first-page":"764","DOI":"10.1287\/opre.44.5.764","volume":"44","author":"W. Kubiak","year":"1996","unstructured":"Kubiak, W., Lou, S. X. C., & Wang, Y. (1996). Mean flow time minimization in reentrant job shops with a hub. Operations Research, 44, 764\u2013776.","journal-title":"Operations Research"},{"key":"1107_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01158930","volume":"13","author":"P. R. Kumar","year":"1996","unstructured":"Kumar, P. R. (1996). Re-entrant lines. Queuing Networks, 13, 87\u2013110.","journal-title":"Queuing Networks"},{"key":"1107_CR4","first-page":"242","volume-title":"4th IEEE conference on automation science and engineering","author":"L. Li","year":"2008","unstructured":"Li, L., & Qiao, F. (2008). The impact of the qual-run requirements of APC on the scheduling performance in semiconductor manufacturing. In 4th IEEE conference on automation science and engineering (pp. 242\u2013246)."},{"issue":"6","key":"1107_CR5","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/s10951-010-0222-9","volume":"14","author":"L. Moench","year":"2011","unstructured":"Moench, L., Fowler, J. W., Dauz\u00e8re-P\u00e9r\u00e8s, S., Mason, S. J., & Rose, O. (2011). A\u00a0survey of problems, solution techniques, and future challenges in scheduling semiconductor manufacturing operations. Journal of Scheduling, 14(6), 583\u2013599.","journal-title":"Journal of Scheduling"},{"key":"1107_CR6","first-page":"D9","volume-title":"IEEE international symposium on semiconductor manufacturing (ISSM 1997)","author":"J. Musacchio","year":"1997","unstructured":"Musacchio, J., Rangan, S., Spanos, C., & Poolla, K. (1997). On the utility of run to run control in semiconductor manufacturing. In IEEE international symposium on semiconductor manufacturing (ISSM 1997) (pp. D9\u2013D12)."},{"key":"1107_CR7","unstructured":"Yiwei, C., Kutanoglu, E., Hasenbein, J., & Qin, J. (2010). Single-machine scheduling with advanced process control constraints. Journal of Scheduling, 1\u201315."},{"key":"1107_CR8","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0167-6377(96)00054-5","volume":"2","author":"S. T. Webster","year":"1997","unstructured":"Webster, S. T. (1997). The complexity of scheduling job families about a common due date. Operations Research Letters, 2, 65\u201374.","journal-title":"Operations Research Letters"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1107-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1107-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1107-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:09:34Z","timestamp":1559153374000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1107-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,13]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["1107"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1107-4","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,13]]}}}