{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T18:17:25Z","timestamp":1694629045001},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,3,6]],"date-time":"2007-03-06T00:00:00Z","timestamp":1173139200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,3,6]],"date-time":"2007-03-06T00:00:00Z","timestamp":1173139200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.1007\/s10852-007-9057-6","type":"journal-article","created":{"date-parts":[[2007,3,5]],"date-time":"2007-03-05T09:48:31Z","timestamp":1173088111000},"page":"563-576","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Total Completion Time in a Two-machine Flowshop with Deteriorating Tasks"],"prefix":"10.1007","volume":"6","author":[{"given":"G.","family":"Finke","sequence":"first","affiliation":[]},{"given":"A.","family":"Oulamara","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,3,6]]},"reference":[{"key":"9057_CR1","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0305-0548(91)90033-N","volume":"18","author":"B. Alidaee","year":"1991","unstructured":"Alidaee, B.: Single machine scheduling with nonlinear cost functions. Comput. Oper. Res. 18, 317\u2013322 (1991)","journal-title":"Comput. Oper. Res."},{"key":"9057_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0166-218X(96)00102-3","volume":"70","author":"Z.-L. Chen","year":"1996","unstructured":"Chen, Z.-L.: Parallel machine scheduling with time dependent processing times. Discrete Appl. Math. 70, 81\u201393 (1996)","journal-title":"Discrete Appl. Math."},{"key":"9057_CR3","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0166-218X(96)00121-7","volume":"76","author":"G. Finke","year":"1997","unstructured":"Finke, G., Jiang, H.: A variant of the permutation flow shop model with variable processing times. Discrete Appl. Math. 76, 123\u2013140 (1997)","journal-title":"Discrete Appl. Math."},{"key":"9057_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1111\/1475-3995.00363","volume":"9","author":"M.-L. Espinouse","year":"2002","unstructured":"Espinouse, M.-L., Finke, G., Jiang, H.: General flowshop models: job dependent capacities, job overlapping and deterioration. Int. Trans. Oper. Res. 9, 399\u2013414 (2002)","journal-title":"Int. Trans. Oper. Res."},{"key":"9057_CR5","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0360-8352(88)90041-1","volume":"14","author":"J.N.D. Gupta","year":"1988","unstructured":"Gupta, J.N.D., Gupta, S.K.: Single facility scheduling with nonlinear processing times. Comput. Ind. Eng. 14, 387\u2013393 (1988)","journal-title":"Comput. Ind. Eng."},{"key":"9057_CR6","doi-asserted-by":"publisher","first-page":"1089","DOI":"10.1080\/00207548808947920","volume":"26","author":"A. Janiak","year":"1988","unstructured":"Janiak, A.: General flow-shop scheduling with resource constraints. Int. J. Prod. Res. 26, 1089\u20131103 (1988)","journal-title":"Int. J. Prod. Res."},{"key":"9057_CR7","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0020-0190(89)90009-4","volume":"32","author":"A. Janiak","year":"1989","unstructured":"Janiak, A.: Minimization of resource consumption under a given deadline in two-processor flow-shop scheduling problem. Inf. Process. Lett. 32, 101\u2013112 (1989)","journal-title":"Inf. Process. Lett."},{"key":"9057_CR8","doi-asserted-by":"publisher","first-page":"1184","DOI":"10.1057\/palgrave.jors.0470909","volume":"47","author":"G. Mosheiov","year":"1996","unstructured":"Mosheiov, G.: \u2227-shaped policies to schedule deteriorating jobs. J. Oper. Res. Soc. 47, 1184\u20131191 (1996)","journal-title":"J. Oper. Res. Soc."},{"key":"9057_CR9","first-page":"205","volume":"36","author":"G. Mosheiov","year":"1998","unstructured":"Mosheiov, G.: Multi-machine scheduling with linear deterioration. INFOR 36, 205\u2013214 (1998)","journal-title":"INFOR"},{"key":"9057_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/S0166-218X(00)00385-1","volume":"117","author":"G. Mosheiov","year":"2002","unstructured":"Mosheiov, G.: Complexity analysis of job-shop scheduling with deteriorating jobs. Discrete Appl. Math. 117, 195\u2013209 (2002)","journal-title":"Discrete Appl. Math."},{"key":"9057_CR11","doi-asserted-by":"publisher","first-page":"907","DOI":"10.1057\/palgrave.jors.0401008","volume":"40","author":"C. Sriskandarajah","year":"1989","unstructured":"Sriskandarajah, C., Goyal, S.K.: Scheduling of two-machine flowshop with processing time linearly dependent on job waiting-time. J. Oper. Res. Soc. 40, 907\u2013921 (1989)","journal-title":"J. Oper. Res. Soc."},{"key":"9057_CR12","first-page":"193","volume":"29","author":"C. Sriskandarajah","year":"1991","unstructured":"Sriskandarajah, C., Wagneur, E.: Hierarchical control of the two processor flow-shop with state-dependent processing time: complexity analysis and approximate algorithms. INFOR 29, 193\u2013205 (1991)","journal-title":"INFOR"},{"key":"9057_CR13","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF01439161","volume":"3","author":"E. Wagneur","year":"1993","unstructured":"Wagneur, E., Sriskandarajah, C.: Optimal control of a class of deds: flow-shops with state-dependent processing times. Discret. Event Dyn. Syst., Theory Appl. 3, 397\u2013425 (1993)","journal-title":"Discret. Event Dyn. Syst., Theory Appl."},{"key":"9057_CR14","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1002\/1520-6750(199308)40:5<697::AID-NAV3220400511>3.0.CO;2-V","volume":"40","author":"E. Wagneur","year":"1993","unstructured":"Wagneur, E., Sriskandarajah, C.: The two-machine permutation flow-shops with state-dependent processing times. Nav. Res. Logist. 40, 697\u2013717 (1993)","journal-title":"Nav. Res. Logist."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-007-9057-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10852-007-9057-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-007-9057-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-007-9057-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,15]],"date-time":"2022-05-15T07:08:52Z","timestamp":1652598532000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10852-007-9057-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,6]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["9057"],"URL":"https:\/\/doi.org\/10.1007\/s10852-007-9057-6","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,6]]},"assertion":[{"value":"3 April 2006","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 January 2007","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 March 2007","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}