{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:29Z","timestamp":1725893969982},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735557"},{"type":"electronic","value":"9783540735564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_30","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:55:47Z","timestamp":1188316547000},"page":"279-290","source":"Crossref","is-referenced-by-count":5,"title":["Single Machine Common Due Window Scheduling with Controllable Job Processing Times"],"prefix":"10.1007","author":[{"given":"Guohua","family":"Wan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)"},{"key":"30_CR2","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1111\/j.1937-5956.1996.tb00407.x","volume":"5","author":"B. Alidaee","year":"1996","unstructured":"Alidaee, B., Kochenberger, G.A.: A framework for machine scheduling problems with controllable processing times. Production and Operations Management\u00a05, 391\u2013405 (1996)","journal-title":"Production and Operations Management"},{"key":"30_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"K. Baker","year":"1990","unstructured":"Baker, K., Scudder, G.: Sequencing with earliness and tardiness penalties: A review. Operations Research\u00a038, 22\u201336 (1990)","journal-title":"Operations Research"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/S0925-5273(00)00040-2","volume":"69","author":"D. Biskup","year":"2001","unstructured":"Biskup, D., Jahnke, H.: Common due date assignment for scheduling on a single machine with jointly reducible processing times. International Journal of Production Economics\u00a069, 317\u2013322 (2001)","journal-title":"International Journal of Production Economics"},{"key":"30_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0305-0548(88)90001-9","volume":"15","author":"T.C.E. Cheng","year":"1988","unstructured":"Cheng, T.C.E.: Optimal common due-date with limited completion time deviation. Computers and Operations Research\u00a015, 91\u201396 (1988)","journal-title":"Computers and Operations Research"},{"key":"30_CR6","doi-asserted-by":"crossref","first-page":"981","DOI":"10.1287\/opre.37.6.981","volume":"37","author":"R.L. Daniels","year":"1989","unstructured":"Daniels, R.L., Sarin, R.K.: Single machine scheduling with controllable processing times and number of jobs tardy. Operations Research\u00a037, 981\u2013984 (1989)","journal-title":"Operations Research"},{"key":"30_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0305-0548(91)90048-V","volume":"39","author":"B. Dickman","year":"1991","unstructured":"Dickman, B., Wilamowsky, Y., Epstain, S.: Optimal common due-date with limited completion time. Computers and Operations Research\u00a039, 125\u2013127 (1991)","journal-title":"Computers and Operations Research"},{"key":"30_CR8","doi-asserted-by":"crossref","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 problems (I). Operations Research\u00a039, 836\u2013846 (1991)","journal-title":"Operations Research"},{"key":"30_CR9","doi-asserted-by":"crossref","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 problems (II). Operations Research\u00a039, 847\u2013856 (1991)","journal-title":"Operations Research"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/j.ejor.2004.03.025","volume":"167","author":"K. Jansen","year":"2005","unstructured":"Jansen, K., Mastrolilli, M., Solis-Oba, R.: Approximation schemes for job shop scheduling problems with controllable processing times. European Journal of Operational Research\u00a0167, 297\u2013319 (2005)","journal-title":"European Journal of Operational Research"},{"key":"30_CR11","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1002\/nav.3800280411","volume":"28","author":"J.J. Kanet","year":"1981","unstructured":"Kanet, J.J.: Minimize the average deviation of job completion times about a common due date. Naval Research Logistics\u00a028, 643\u2013651 (1981)","journal-title":"Naval Research Logistics"},{"key":"30_CR12","doi-asserted-by":"publisher","first-page":"3015","DOI":"10.1016\/j.cor.2005.02.032","volume":"33","author":"M. Kaspi","year":"2006","unstructured":"Kaspi, M., Shabtay, D.: A bicriterion approach to time\/cost trade-offs in scheduling with convex resource-dependent job processing times and release dates. Computers and Operations Research\u00a033, 3015\u20133033 (2006)","journal-title":"Computers and Operations Research"},{"key":"30_CR13","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1111\/j.1937-5956.1993.tb00102.x","volume":"2","author":"F.J. Kramer","year":"1993","unstructured":"Kramer, F.J., Lee, C.Y.: Common due window scheduling. Production and Operations Management\u00a02, 262\u2013275 (1993)","journal-title":"Production and Operations Management"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0895-7177(94)90208-9","volume":"20","author":"F.J. Kramer","year":"1994","unstructured":"Kramer, F.J., Lee, C.Y.: Due window scheduling for parallel machines. Mathematics and Computer Modelling\u00a020, 69\u201389 (1994)","journal-title":"Mathematics and Computer Modelling"},{"key":"30_CR15","unstructured":"Lee, C.Y.: Earliness-tardiness scheduling problems with constant size of due window. Research Report, Dept. of Industrial and Systems Engineering, University of Florida (1991)"},{"key":"30_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0167-6377(94)90078-7","volume":"15","author":"S.D. Liman","year":"1994","unstructured":"Liman, S.D., Rawaswamy, S.: Earliness-tardiness scheduling problems with a common delivery window. Operations Research Letters\u00a015, 195\u2013203 (1994)","journal-title":"Operations Research Letters"},{"key":"30_CR17","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0377-2217(95)00181-6","volume":"93","author":"S.D. Liman","year":"1996","unstructured":"Liman, S.D., Panwalkar, S.S., Thongmee, S.: Determination of common due window location in a single machine scheduling problem. European Journal of Operational Research\u00a093, 68\u201374 (1996)","journal-title":"European Journal of Operational Research"},{"key":"30_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1023\/A:1018965919691","volume":"70","author":"S.D. Liman","year":"1997","unstructured":"Liman, S.D., Panwalkar, S.S., Thongmee, S.: A single machine scheduling problem with common due window and controllable processing times. Annals of Operations Research\u00a070, 145\u2013154 (1997)","journal-title":"Annals of Operations Research"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1057\/palgrave.jors.2600601","volume":"49","author":"S.D. Liman","year":"1998","unstructured":"Liman, S.D., Panwalkar, S.S., Thongmee, S.: Common due window size and location determination in a single machine scheduling problem. Journal of the Operational Research Society\u00a049, 1007\u201310 (1998)","journal-title":"Journal of the Operational Research Society"},{"key":"30_CR20","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10479-004-5030-1","volume":"133","author":"C.T. Ng","year":"2005","unstructured":"Ng, C.T., Cheng, T.C.E., Janiak, A., Kovalyov, M.Y.: Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time. Annals of Operations Research\u00a0133, 163\u2013174 (2005)","journal-title":"Annals of Operations Research"},{"key":"30_CR21","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/0166-218X(90)90105-L","volume":"26","author":"E. Nowicki","year":"1990","unstructured":"Nowicki, E., Zdrzalka, S.: A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics\u00a026, 271\u2013287 (1990)","journal-title":"Discrete Applied Mathematics"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/0377-2217(92)90144-X","volume":"59","author":"S.S. Panwalkar","year":"1992","unstructured":"Panwalkar, S.S., Rajagopalan, R.: Single machine sequencing with controllable processing times. European Journal of Operational Research\u00a059, 298\u2013302 (1992)","journal-title":"European Journal of Operational Research"},{"key":"30_CR23","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1287\/opre.30.2.391","volume":"30","author":"S.S. Panwalkar","year":"1982","unstructured":"Panwalkar, S.S., Smith, M.L., Seidmann, A.: Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research\u00a030, 391\u2013399 (1982)","journal-title":"Operations Research"},{"key":"30_CR24","unstructured":"Thongmee, S., Liman, S.D.: Common due window size determination in a single machine scheduling problem. Research Report, Dept. of Industrial Engineering, Texas Tech. University (1995)"},{"key":"30_CR25","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/05695558008974515","volume":"12","author":"R.G. Vickson","year":"1980","unstructured":"Vickson, R.G.: Two single machine sequencing problem involving controllable job processing times. AIIE Transactions\u00a012, 258\u2013262 (1980a)","journal-title":"AIIE Transactions"},{"key":"30_CR26","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1287\/opre.28.5.1155","volume":"28","author":"R.G. Vickson","year":"1980","unstructured":"Vickson, R.G.: Choosing the sequence and processing times to minimize total processing plus flow cost on a single machine. Operations Research\u00a028, 1155\u20131167 (1980b)","journal-title":"Operations Research"},{"key":"30_CR27","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1016\/S0377-2217(82)80008-8","volume":"11","author":"L.N. Wassenhove Van","year":"1982","unstructured":"Van Wassenhove, L.N., Baker, K.: A Bicriterion approach to time\/cost trade-offs in sequencing. European Journal of Operational Research\u00a011, 48\u201354 (1982)","journal-title":"European Journal of Operational Research"},{"key":"30_CR28","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1016\/S0377-2217(01)00302-2","volume":"142","author":"G. Wan","year":"2002","unstructured":"Wan, G., Yen, B.P.C.: Tabu search for single machine scheduling with distinct due windows and weighted earliness\/tardiness penalties. European Journal of Operational Research\u00a0142, 271\u2013281 (2002)","journal-title":"European Journal of Operational Research"},{"key":"30_CR29","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1111\/j.1937-5956.1996.tb00393.x","volume":"5","author":"M.X. Weng","year":"1996","unstructured":"Weng, M.X., Ventura, J.A.: A note on Common due window Scheduling. Production and Operations Management\u00a05, 194\u2013200 (1996)","journal-title":"Production and Operations Management"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T09:51:44Z","timestamp":1619517104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}