{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T12:01:06Z","timestamp":1778587266328,"version":"3.51.4"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2011,9,4]],"date-time":"2011-09-04T00:00:00Z","timestamp":1315094400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s11590-011-0385-0","type":"journal-article","created":{"date-parts":[[2011,9,6]],"date-time":"2011-09-06T13:03:16Z","timestamp":1315314196000},"page":"1897-1911","source":"Crossref","is-referenced-by-count":6,"title":["On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date"],"prefix":"10.1007","volume":"6","author":[{"given":"M. S.","family":"Beyranvand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Reza","family":"Peyghami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Ghatee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,9,4]]},"reference":[{"issue":"1","key":"385_CR1","first-page":"1","volume":"38","author":"K. Baker","year":"2002","unstructured":"Baker K., Scudder G.: Sequencing with earliness and tardiness penalties: a review. Oper. Res. 38(1), 1\u201325 (2002)","journal-title":"Oper. Res."},{"issue":"6","key":"385_CR2","doi-asserted-by":"crossref","first-page":"1185","DOI":"10.1016\/j.dam.2007.12.007","volume":"157","author":"A. Billionnt","year":"2009","unstructured":"Billionnt A., Elloumi S., Plateau M.-C.: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method. Discrete Appl. Math. 157(6), 1185\u20131197 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"8","key":"385_CR3","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1016\/S0305-0548(00)00008-3","volume":"28","author":"D. Biskup","year":"2001","unstructured":"Biskup D., Feldmann M.: Benchmarks for scheduling on a single machine against restrictive and unrestrictive common due date. Comput. Oper. Res. 28(8), 787\u2013801 (2001)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"385_CR4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/S0360-8352(02)00181-X","volume":"44","author":"M. Feldmann","year":"2003","unstructured":"Feldmann M., Biskup D.: Single-machine scheduling for minimizing earliness\u2013tardiness penalties by meta-heuristic approach. Comput. Ind. Eng. 44(2), 307\u2013323 (2003)","journal-title":"Comput. Ind. Eng."},{"issue":"1","key":"385_CR5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"38","author":"V. Gordon","year":"2002","unstructured":"Gordon V., Porth J., Chu A.: A survey of the state-of-the-art of common due date assignment and scheduling research. Eur. J. Oper. Res. 38(1), 1\u201325 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"385_CR6","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/978-1-4899-0289-4_22","volume-title":"Nonlinear Optimization and Applications","author":"P.M. Pardalos","year":"1996","unstructured":"Pardalos P.M.: Continuous approaches to discrete optimization problems. In: Di Pillo, G., Giannessi, F. (eds) Nonlinear Optimization and Applications, pp. 313\u2013328. Plenum Publishing, New Jersey (1996)"},{"key":"385_CR7","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1016\/j.ejor.2009.03.049","volume":"201","author":"M.-C. Pleateau","year":"2010","unstructured":"Pleateau M.-C., Rios-Solis Y.A.: Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations. Eur. J. Oper. Res. 201, 729\u2013736 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"385_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1093\/imaman\/dpm016","volume":"18","author":"M. Ravetti","year":"2007","unstructured":"Ravetti M., Pardalos P.M., Robson Mateus G., Leite Rocha P.: Solving parallel machines scheduling problems with sequence-dependent setup times using variable neighborhood search. IMA J. Manag. Math. 18(2), 101\u2013115 (2007)","journal-title":"IMA J. Manag. Math."},{"issue":"4","key":"385_CR9","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1016\/j.cor.2006.07.015","volume":"35","author":"P.L. Rocha","year":"2008","unstructured":"Rocha P.L., Ravetti M., Robson Mateus G., Pardalos P.M.: Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times. Comput. Oper. Res. 35(4), 1250\u20131264 (2008)","journal-title":"Comput. Oper. Res."},{"key":"385_CR10","unstructured":"Sourd F.: A reinforced Lagrangean relaxation for non-preemptive single machine problem. In: Tenth International Workshop on Project Management and Scheduling, pp. 330\u2013334 (2006)"},{"issue":"1","key":"385_CR11","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1287\/ijoc.14.1.37.7706","volume":"14","author":"M. Akker van den","year":"2002","unstructured":"van den Akker M., Hoogeveen J., van den Veld S.: Combining column generation and Lagrangian relaxation to solve a single-machine common due date problem. INFORMS J. Comput. 14(1), 37\u201351 (2002)","journal-title":"INFORMS J. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0385-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0385-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0385-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:30Z","timestamp":1559394690000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0385-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9,4]]},"references-count":11,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["385"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0385-0","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9,4]]}}}