{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:18:59Z","timestamp":1726409939328},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642121005"},{"type":"electronic","value":"9783642121012"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12101-2_42","type":"book-chapter","created":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T12:16:59Z","timestamp":1270124219000},"page":"410-419","source":"Crossref","is-referenced-by-count":0,"title":["DCA for Minimizing the Cost and Tardiness of Preventive Maintenance Tasks under Real-Time Allocation Constraint"],"prefix":"10.1007","author":[{"given":"Tran Duc","family":"Quynh","sequence":"first","affiliation":[]},{"given":"Le Thi Hoai","family":"An","sequence":"additional","affiliation":[]},{"given":"Kondo Hloindo","family":"Adjallah","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"42_CR1","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1080\/02331930108844555","volume":"50","author":"H.A. Thi Le","year":"2001","unstructured":"Le Thi, H.A., Pham Dinh, T.: A Continuous approach for globally solving linearly constrained quadratic zero-one programming problem. Optimization\u00a050(1-2), 93\u2013120 (2001)","journal-title":"Optimization"},{"key":"42_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"H.A. Thi Le","year":"2005","unstructured":"Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) Programming and DCA revisited with DC models of real world non convex optimization problems. Annals of Operations Research\u00a0133, 23\u201346 (2005)","journal-title":"Annals of Operations Research"},{"issue":"2","key":"42_CR3","first-page":"169","volume":"27","author":"H.A. Thi Le","year":"1999","unstructured":"Le Thi, H.A., Pham Dinh, T., Le Dung, M.: Exact penalty ind.c. programming. Vietnam Journal of Mathematics\u00a027(2), 169\u2013178 (1999)","journal-title":"Vietnam Journal of Mathematics"},{"key":"42_CR4","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"Rockafellar, R.T.: Convex analysis, 1st edn. Princeton University Press, Princeton (1970)","edition":"1"},{"issue":"1","key":"42_CR5","first-page":"289","volume":"22","author":"T. Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to d.c Programming: Theory, Algorithms and Applications. Acta Mathematica Vietnamica, dedicated to Professor Hoang Tuy on the occasion of his 70th birthday\u00a022(1), 289\u2013355 (1997)","journal-title":"Acta Mathematica Vietnamica, dedicated to Professor Hoang Tuy on the occasion of his 70th birthday"},{"key":"42_CR6","first-page":"476","volume":"8","author":"T. Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: DC optimization algorihms for solving the trust region subproblem. SIAM J. Optimization\u00a08, 476\u2013505 (1997)","journal-title":"SIAM J. Optimization"},{"key":"42_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.dam.2007.03.024","volume":"156","author":"H.A. Thi Le","year":"2008","unstructured":"Le Thi, H.A., Pham Dinh, T.: A continuous approach for the concave cost supply problem via DC programming and DCA. Discrete Applied Mathematics\u00a0156, 325\u2013338 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"42_CR8","first-page":"57","volume":"221","author":"K.H. Adjallah","year":"2007","unstructured":"Adjallah, K.H., Adzakpa, K.P.: Minimizing maintenance cost involving flow-time and tardiness penalty with unequal release dates. Journal of Risk and Reliability, Part O\u00a0221(1), 57\u201366 (2007) (in press)","journal-title":"Journal of Risk and Reliability, Part O"},{"key":"42_CR9","unstructured":"Adzakpa, K.P.: Maintenance of distributed systems: methods for real-time decision-making. PhD Thesis, University of Technology of Troyes, France (October 2004)"},{"issue":"1","key":"42_CR10","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/59.852110","volume":"15","author":"E.K. Burke","year":"2000","unstructured":"Burke, E.K., Smith, A.J.: Hybrid evolutionary techniques for the maintenance scheduling problem. IEEE 2000 Trans. on Power Systems\u00a015(1), 122\u2013128 (2000)","journal-title":"IEEE 2000 Trans. on Power Systems"},{"issue":"2","key":"42_CR11","doi-asserted-by":"publisher","first-page":"577","DOI":"10.2307\/3213050","volume":"17","author":"C. Derman","year":"1980","unstructured":"Derman, C., Lieberman, G.J., Ross, S.M.: On the optimal assignment of servers and a repairman. Journal of Applied Probability\u00a017(2), 577\u2013581 (1980)","journal-title":"Journal of Applied Probability"},{"key":"42_CR12","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/j.ejor.2007.09.048","volume":"199","author":"C. Duron","year":"2009","unstructured":"Duron, C., Ould Louly, M.A., Proth, J.-M.: The one machine scheduling problem: Insertion of a job under the real-time constraint. European Journal of Operational Research\u00a0199, 695\u2013701 (2009)","journal-title":"European Journal of Operational Research"},{"issue":"1-2","key":"42_CR13","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0360-8352(01)00014-6","volume":"40","author":"M. Gopalakrishnan","year":"2001","unstructured":"Gopalakrishnan, M., Mohan, S., He, Z.: A tabu search heuristic for preventive maintenance scheduling. Computers & Industrial Engineering\u00a040(1-2), 149\u2013160 (2001)","journal-title":"Computers & Industrial Engineering"},{"key":"42_CR14","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J. Lenstra","year":"1977","unstructured":"Lenstra, J., Kan, A.R., Brucker, P.: Complexity of machine scheduling problems. Annals of Discrete Mathematics\u00a01, 343\u2013362 (1977)","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12101-2_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:03:08Z","timestamp":1619784188000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12101-2_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121005","9783642121012"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12101-2_42","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}