{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:54:19Z","timestamp":1764996859378},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2010,2]]},"DOI":"10.1007\/s10951-009-0111-2","type":"journal-article","created":{"date-parts":[[2009,6,1]],"date-time":"2009-06-01T19:18:27Z","timestamp":1243883907000},"page":"95-110","source":"Crossref","is-referenced-by-count":24,"title":["Parallel machine match-up scheduling with manufacturing cost considerations"],"prefix":"10.1007","volume":"13","author":[{"given":"M. Selim","family":"Akt\u00fcrk","sequence":"first","affiliation":[]},{"given":"Alper","family":"Atamt\u00fcrk","sequence":"additional","affiliation":[]},{"given":"Sinan","family":"G\u00fcrel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,2]]},"reference":[{"key":"111_CR1","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0377-2217(97)00396-2","volume":"112","author":"M. S. Akt\u00fcrk","year":"1999","unstructured":"Akt\u00fcrk, M. S., & G\u00f6rg\u00fcl\u00fc, E. (1999). Match-up scheduling under a machine breakdown. European Journal of Operational Research, 112, 81\u201397.","journal-title":"European Journal of Operational Research"},{"key":"111_CR2","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.orl.2008.12.009","volume":"37","author":"M. S. Akt\u00fcrk","year":"2009","unstructured":"Akt\u00fcrk, M. S., Atamt\u00fcrk, A., & G\u00fcrel, S. (2009). A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Operations Research Letters, 37, 187\u2013191.","journal-title":"Operations Research Letters"},{"key":"111_CR3","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F. Alizadeh","year":"2003","unstructured":"Alizadeh, F., & Goldfarb, D. (2003). Second-order cone programming. Mathematical Programming, 95, 3\u201351.","journal-title":"Mathematical Programming"},{"issue":"3","key":"111_CR4","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/opre.39.3.470","volume":"39","author":"J. C. Bean","year":"1991","unstructured":"Bean, J. C., Birge, J. R., Mittenthal, J., & Noon, C. E. (1991). Match-up scheduling with multiple resources, release dates and disruptions. Operations Research, 39(3), 470\u2013483.","journal-title":"Operations Research"},{"key":"111_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718829","volume-title":"Lectures on modern convex optimization: analysis, algorithms, and engineering applications","author":"A. Ben-Tal","year":"2001","unstructured":"Ben-Tal, A., & Nemirovski, A. (2001). Lectures on modern convex optimization: analysis, algorithms, and engineering applications. Philadelphia: SIAM."},{"issue":"4","key":"111_CR6","doi-asserted-by":"crossref","first-page":"670","DOI":"10.1287\/opre.43.4.670","volume":"43","author":"K. M. Bretthauer","year":"1995","unstructured":"Bretthauer, K. M., & Shetty, B. (1995). The nonlinear resource allocation problem. Operations Research, 43(4), 670\u2013683.","journal-title":"Operations Research"},{"issue":"3","key":"111_CR7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/s10951-007-0010-3","volume":"10","author":"C. Briand","year":"2007","unstructured":"Briand, C., La, H. T., & Erschler, J. (2007). A robust approach for the single machine scheduling problem. Journal of Scheduling, 10(3), 209\u2013221.","journal-title":"Journal of Scheduling"},{"key":"111_CR8","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1016\/j.ejor.2006.10.024","volume":"183","author":"S. G\u00fcrel","year":"2007","unstructured":"G\u00fcrel, S., & Akt\u00fcrk, M. S. (2007). Optimal allocation and processing time decisions on parallel CNC machines: \u03b5-constraint approach. European Journal of Operational Research, 183, 591\u2013607.","journal-title":"European Journal of Operational Research"},{"key":"111_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S1568-4946(01)00005-9","volume":"1","author":"M. T. Jensen","year":"2001","unstructured":"Jensen, M. T. (2001). Improving robustness and flexibility of tardiness and total flow-time job shops using robustness measures. Applied Soft Computing, 1, 35\u201352.","journal-title":"Applied Soft Computing"},{"key":"111_CR10","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1016\/j.ejor.2004.07.012","volume":"167","author":"R. K. Kayan","year":"2005","unstructured":"Kayan, R. K., & Akt\u00fcrk, M. S. (2005). A new bounding mechanism for the CNC machine scheduling problems with controllable processing times. European Journal of Operational Research, 167, 624\u2013643.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"111_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/s10951-007-0014-z","volume":"10","author":"R. Leus","year":"2007","unstructured":"Leus, R., & Herroelen, W. (2007). Scheduling for stability in single-machine production. Journal of Scheduling, 10(3), 223\u2013235.","journal-title":"Journal of Scheduling"},{"key":"111_CR12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/70.678447","volume":"14","author":"S. V. Mehta","year":"1998","unstructured":"Mehta, S. V., & Uzsoy, R. M. (1998). Predictable scheduling of a job shop subject to breakdowns. IEEE Transactions on Robotics and Automation, 14, 365\u2013378.","journal-title":"IEEE Transactions on Robotics and Automation"},{"issue":"13","key":"111_CR13","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1016\/j.dam.2007.02.003","volume":"155","author":"D. Shabtay","year":"2007","unstructured":"Shabtay, D., & Steiner, G. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643\u20131666.","journal-title":"Discrete Applied Mathematics"},{"key":"111_CR14","volume-title":"Multicriteria scheduling: theory, models and algorithms","author":"V. T\u2019kindt","year":"2006","unstructured":"T\u2019kindt, V., & Billaut, J.-C. (2006). Multicriteria scheduling: theory, models and algorithms (2nd ed.). Berlin: Springer.","edition":"2"},{"key":"111_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1023\/A:1022235519958","volume":"6","author":"G. E. Vieira","year":"2003","unstructured":"Vieira, G. E., Herrmann, J. W., & Lin, E. (2003). Rescheduling manufacturing systems: A framework of strategies, policies and methods. Journal of Scheduling, 6, 39\u201362.","journal-title":"Journal of Scheduling"},{"key":"111_CR16","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10951-007-0044-6","volume":"10","author":"L. Yedidsion","year":"2007","unstructured":"Yedidsion, L., Shabtay, D., & Kaspi, M. (2007). A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine. Journal of Scheduling, 10, 341\u2013352.","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-009-0111-2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T08:15:30Z","timestamp":1555575330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-009-0111-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,2]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,2]]}},"alternative-id":["111"],"URL":"https:\/\/doi.org\/10.1007\/s10951-009-0111-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,2]]}}}