{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:25:58Z","timestamp":1726410358015},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642274510"},{"type":"electronic","value":"9783642274527"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-27452-7_75","type":"book-chapter","created":{"date-parts":[[2011,12,17]],"date-time":"2011-12-17T03:01:41Z","timestamp":1324090901000},"page":"552-559","source":"Crossref","is-referenced-by-count":0,"title":["Study of the Single-Machine Multi-criteria Scheduling Problem with Common Due Date"],"prefix":"10.1007","author":[{"given":"Shuming","family":"Guan","sequence":"first","affiliation":[]},{"given":"Xiaoqing","family":"Lu","sequence":"additional","affiliation":[]},{"given":"Jia","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ruyu","family":"Tian","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"75_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2001","unstructured":"Brucker, P.: Scheduling Algorithms, 3rd edn. Springer, Berlin (2001)","edition":"3"},{"issue":"1","key":"75_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/0305-0483(88)90008-4","volume":"16","author":"P. Dileepan","year":"1988","unstructured":"Dileepan, P., Sen, T.: Bicriterion Static Scheduling Research for a Single Machine. Omega\u00a016(1), 53\u201359 (1988)","journal-title":"Omega"},{"key":"75_CR3","volume-title":"Complexity of single machine hierarchical scheduling: A survey","author":"L.I. Zhongyi","year":"1993","unstructured":"Zhongyi, L.I., Vairaktarakis, G.L.: Complexity of single machine hierarchical scheduling: A survey. World Scientific Publishing Company, New Jersey (1993)"},{"key":"75_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1022231419049","volume":"6","author":"K.R. Baker","year":"2003","unstructured":"Baker, K.R., Smith, J.C.: A multiple-criterion model for machine scheduling. Journal of Scheduling\u00a06, 7\u201316 (2003)","journal-title":"Journal of Scheduling"},{"key":"75_CR5","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1287\/opre.39.5.836","volume":"39","author":"N.G. Hall","year":"1991","unstructured":"Hall, N.G., Posner, M.E.: Posner: Earliness-Tardiness Scheduling Problems. Operations Research\u00a039, 836\u2013846 (1991)","journal-title":"Operations Research"},{"key":"75_CR6","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0377-2217(93)90236-G","volume":"70","author":"C.L. Chen","year":"1993","unstructured":"Chen, C.L., Bulfin, R.L.: Complexity of Single machine, multi-criteria scheduling problems. European Journal of Operational Research\u00a070, 115\u2013125 (1993)","journal-title":"European Journal of Operational Research"},{"key":"75_CR7","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/S0305-0548(99)00153-7","volume":"28","author":"S.A. Mondal","year":"2001","unstructured":"Mondal, S.A., Sen, A.K.: Single machine weighted earliness-tardiness penalty problem with a common due date. Computer & Operations Research\u00a028, 649\u2013669 (2001)","journal-title":"Computer & Operations Research"},{"key":"75_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1057\/palgrave.jors.2601681","volume":"55","author":"T.C.E. Cheng","year":"2009","unstructured":"Cheng, T.C.E., Kang, L.-y., Ng, C.T.: Due-date assignment and single machine scheduling with deteriorating jobs. Journal of the Operational Research Society\u00a055, 198\u2013203 (2009)","journal-title":"Journal of the Operational Research Society"},{"key":"75_CR9","doi-asserted-by":"publisher","first-page":"3161","DOI":"10.1016\/j.eswa.2010.09.002","volume":"38","author":"A. Prakash","year":"2011","unstructured":"Prakash, A., Chan, F.T.S., Deshmuch, S.G.: FMS scheduling with knowledge based genetic algorithm approach. Expert Systems with Applications\u00a038, 3161\u20133171 (2011)","journal-title":"Expert Systems with Applications"},{"key":"75_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/j.dam.2010.11.006","volume":"159","author":"K. Thornblad","year":"2011","unstructured":"Thornblad, K., Patriksson, M.: A note on the complexity of flow-shop scheduling with deteriorating jobs. Discrete Applied Mathematics\u00a0159, 251\u2013253 (2011)","journal-title":"Discrete Applied Mathematics"},{"issue":"5","key":"75_CR11","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1287\/opre.39.5.836","volume":"39","author":"N.G. Hall","year":"1991","unstructured":"Hall, N.G., Posner, M.E.: Earliness-tardiness scheduling problem I: Weighted deviation of completion times about a common due date. Operations Research\u00a039(5), 836\u2013846 (1991)","journal-title":"Operations Research"},{"key":"75_CR12","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1016\/j.ejor.2004.04.013","volume":"165","author":"T.C.E. Cheng","year":"2005","unstructured":"Cheng, T.C.E., Ng, C.T., Yuan, J.-j., et al.: Single machine scheduling to minimize total weighted tardiness. European Journal of Operational Research\u00a0165, 423\u2013443 (2005)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"75_CR13","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/0377-2217(89)90100-8","volume":"38","author":"T.C.E. Cheng","year":"1989","unstructured":"Cheng, T.C.E., Gupta, M.C.: Survey of scheduling research involving due date determination decisions. European Journal of Operational Research\u00a038(2), 156\u2013166 (1989)","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"75_CR14","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1287\/opre.39.5.847","volume":"39","author":"N.G. Hall","year":"1991","unstructured":"Hall, N.G., Kubiak, W., Sethi, S.P.: Earliness-tardiness scheduling problem II: Deviation of completion times about a restrictive common due date. Operations Research\u00a039(5), 847\u2013856 (1991)","journal-title":"Operations Research"},{"key":"75_CR15","doi-asserted-by":"crossref","unstructured":"Baker, K.: Sequencing with earliness and tardiness Penalties: a review. Operation Research, 22\u201324 (1990)","DOI":"10.1287\/opre.38.1.22"},{"key":"75_CR16","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1006\/jagm.1996.0051","volume":"21","author":"J.A. Hoogeveen","year":"1996","unstructured":"Hoogeveen, J.A.: single-machine scheduling to minimize a function of two or three maximum cost criteria. Journal of Algorithms\u00a021, 415\u2013433 (1996)","journal-title":"Journal of Algorithms"},{"key":"75_CR17","first-page":"1294","volume":"117","author":"S.-W. Lin","year":"2009","unstructured":"Lin, S.-W., Chou, S.-Y., Ying, K.-C.: A sequential exchange approach for minimizing earliness-tardiness penalties of single-machine scheduling with a common due date. European Journal of Operational Research\u00a0117, 1294\u20131301 (2009)","journal-title":"European Journal of Operational Research"},{"key":"75_CR18","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/j.tcs.2010.09.017","volume":"412","author":"B. Fan","year":"2011","unstructured":"Fan, B., Li, S., Zhou, L., Zhang, L.: Scheduling resumable deteriorating jobs on a single machine with non-availability. Theoretical Computer Science\u00a0412, 275\u2013280 (2011)","journal-title":"Theoretical Computer Science"},{"key":"75_CR19","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1016\/S0377-2217(99)00432-4","volume":"130","author":"G. Mosheior","year":"2001","unstructured":"Mosheior, G., Shamon, M.: Min-max earliness-tardiness costs with unit processing time job. European Journal of Operational Research\u00a0130, 638\u2013652 (2001)","journal-title":"European Journal of Operational Research"},{"key":"75_CR20","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1016\/j.ejor.2004.03.017","volume":"165","author":"Z.-j. Tian","year":"2005","unstructured":"Tian, Z.-j., Ng, C.T., Cheng, T.C.E.: On the single machine total tardiness problem. European Journal of Operational Research\u00a0165, 843\u2013846 (2005)","journal-title":"European Journal of Operational Research"},{"key":"75_CR21","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J.K. Lenstra","year":"1977","unstructured":"Lenstra, J.K., Rinnooy Kan, A.H.G., Brucher, R.: Complexity of Machine Scheduling Problems. Annals of Discrete Mathematics\u00a01, 343\u2013362 (1977)","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Communications in Computer and Information Science","Information Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27452-7_75","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T00:53:07Z","timestamp":1555894387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27452-7_75"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642274510","9783642274527"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27452-7_75","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2011]]}}}