{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T16:19:28Z","timestamp":1770999568267,"version":"3.50.1"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,15]],"date-time":"2011-06-15T00:00:00Z","timestamp":1308096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2012,8]]},"DOI":"10.1007\/s10951-011-0240-2","type":"journal-article","created":{"date-parts":[[2011,6,15]],"date-time":"2011-06-15T06:08:58Z","timestamp":1308118138000},"page":"447-456","source":"Crossref","is-referenced-by-count":56,"title":["Scheduling with due date assignment under special conditions on job processing"],"prefix":"10.1007","volume":"15","author":[{"given":"Valery","family":"Gordon","sequence":"first","affiliation":[]},{"given":"Vitaly","family":"Strusevich","sequence":"additional","affiliation":[]},{"given":"Alexandre","family":"Dolgui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,6,15]]},"reference":[{"key":"240_CR1","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/0377-2217(93)90245-I","volume":"70","author":"B. Alidaee","year":"1993","unstructured":"Alidaee, B., & Ahmadian, A. (1993). Two parallel machines sequencing problems involving controllable job processing times. European Journal of Operational Research, 70, 335\u2013341.","journal-title":"European Journal of Operational Research"},{"key":"240_CR2","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1057\/palgrave.jors.2600740","volume":"50","author":"B. Alidaee","year":"1999","unstructured":"Alidaee, B., & Womer, N. K. (1999). Scheduling with time dependent processing times: Review and extensions. The Journal of the Operational Research Society, 50, 711\u2013720.","journal-title":"The Journal of the Operational Research Society"},{"key":"240_CR3","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/opre.31.2.381","volume":"31","author":"K. R. Baker","year":"1983","unstructured":"Baker, K. R., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (1983). Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Operations Research, 31, 381\u2013386.","journal-title":"Operations Research"},{"key":"240_CR4","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/S0305-0548(02)00225-3","volume":"31","author":"M. Birman","year":"2004","unstructured":"Birman, M., & Mosheiov, G. (2004). A note on a due-date assignment on a two-machine flow-shop. Computers & Operations Research, 31, 473\u2013480.","journal-title":"Computers & Operations Research"},{"key":"240_CR5","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/S0377-2217(98)00246-X","volume":"115","author":"D. Biskup","year":"1999","unstructured":"Biskup, D. (1999). Single-machine scheduling with learning considerations. European Journal of Operational Research, 115, 173\u2013178.","journal-title":"European Journal of Operational Research"},{"key":"240_CR6","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.ejor.2007.05.040","volume":"188","author":"D. Biskup","year":"2008","unstructured":"Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. European Journal of Operational Research, 188, 315\u2013329.","journal-title":"European Journal of Operational Research"},{"key":"240_CR7","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1080\/03052159908941376","volume":"31","author":"D. Biskup","year":"1999","unstructured":"Biskup, D., & Cheng, T. C. E. (1999). Single-machine scheduling with controllable processing times and earliness, tardiness and completion time penalties. Engineering Optimization, 31, 329\u2013336.","journal-title":"Engineering Optimization"},{"key":"240_CR8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/S0925-5273(00)00040-2","volume":"69","author":"D. Biskup","year":"2001","unstructured":"Biskup, D., & Jahnke, H. (2001). Common due date assignment for scheduling on a single machine with jointly reducible processing times. International Journal of Production Economics, 69, 317\u2013322.","journal-title":"International Journal of Production Economics"},{"key":"240_CR9","first-page":"23-1","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"J. Blazewicz","year":"2004","unstructured":"Blazewicz, J., Brauner, N., & Finke, G. (2004). Scheduling with discrete resource constraints. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp. 23-1\u201323-18). Boca Raton: CRC Press."},{"key":"240_CR10","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1287\/opre.38.3.495","volume":"38","author":"S. Browne","year":"1990","unstructured":"Browne, S., & Yechiali, U. (1990). Scheduling deteriorating jobs on a single processor. Operations Research, 38, 495\u2013498.","journal-title":"Operations Research"},{"key":"240_CR11","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0893-9659(89)90081-5","volume":"2","author":"T. C. E. Cheng","year":"1989","unstructured":"Cheng, T. C. E. (1989). Optimal assignment of slack due dates and sequencing in a single-machine shop. Applied Mathematics Letters, 2, 333\u2013335.","journal-title":"Applied Mathematics Letters"},{"key":"240_CR12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0895-7177(94)90204-6","volume":"20","author":"T. C. E. Cheng","year":"1994","unstructured":"Cheng, T. C. E., & Gordon, V. S. (1994). Optimal assignment of due-dates for preemptive single-machine scheduling. Mathematical and Computer Modelling, 20, 33\u201340.","journal-title":"Mathematical and Computer Modelling"},{"key":"240_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0925-5273(95)00194-8","volume":"43","author":"T. C. E. Cheng","year":"1996","unstructured":"Cheng, T. C. E., Oguz, C., & Qi, X. D. (1996). Due-date assignment and single machine scheduling with compressible processing times. International Journal of Production Economics, 43, 29\u201335.","journal-title":"International Journal of Production Economics"},{"key":"240_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00909-8","volume":"152","author":"T. C. E. Cheng","year":"2004","unstructured":"Cheng, T. C. E., Ding, Q., & Lin, B. M. T. (2004a). A concise survey of scheduling with time-dependent processing times. European Journal of Operational Research, 152, 1\u201313.","journal-title":"European Journal of Operational Research"},{"key":"240_CR15","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1057\/palgrave.jors.2601681","volume":"55","author":"T. C. E. Cheng","year":"2004","unstructured":"Cheng, T. C. E., Kang, L., & Ng, C. T. (2004b). Due-date assignment and single machine scheduling with deteriorating jobs. The Journal of the Operational Research Society, 55, 198\u2013203.","journal-title":"The Journal of the Operational Research Society"},{"key":"240_CR16","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1016\/j.ejor.2005.06.072","volume":"175","author":"T. C. E. Cheng","year":"2006","unstructured":"Cheng, T. C. E., Kovalyov, M. Y., & Shakhlevich, N. (2006). Scheduling with controllable release dates and processing times: total completion time minimization. European Journal of Operational Research, 175, 769\u2013781.","journal-title":"European Journal of Operational Research"},{"key":"240_CR17","doi-asserted-by":"crossref","first-page":"1103","DOI":"10.1057\/palgrave.jors.2602225","volume":"58","author":"T. C. E. Cheng","year":"2007","unstructured":"Cheng, T. C. E., Kang, L., & Ng, C. T. (2007). Due-date assignment and parallel-machine scheduling with deteriorating jobs. The Journal of the Operational Research Society, 58, 1103\u20131108.","journal-title":"The Journal of the Operational Research Society"},{"key":"240_CR18","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/0377-2217(93)90242-F","volume":"70","author":"V. S. Gordon","year":"1993","unstructured":"Gordon, V. S. (1993). A note on optimal assignment of slack due-dates in single-machine scheduling. European Journal of Operational Research, 70, 311\u2013315.","journal-title":"European Journal of Operational Research"},{"key":"240_CR19","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0305-0548(98)00055-0","volume":"26","author":"V. S. Gordon","year":"1999","unstructured":"Gordon, V. S., & Strusevich, V. A. (1999). Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Computers & Operations Research, 26, 157\u2013177.","journal-title":"Computers & Operations Research"},{"key":"240_CR20","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ejor.2008.07.044","volume":"198","author":"V. S. Gordon","year":"2009","unstructured":"Gordon, V. S., & Strusevich, V. A. (2009). Single machine scheduling and due date assignment with positionally dependent processing times. European Journal of Operational Research, 198, 57\u201362.","journal-title":"European Journal of Operational Research"},{"key":"240_CR21","first-page":"3","volume":"3","author":"V. S. Gordon","year":"1983","unstructured":"Gordon, V. S., & Tanaev, V. S. (1983). On minmax single machine scheduling problems. Izvestiya Akademii Nauk BSSR,Sery\u00e2 Fizika-Matematy\u010dnyh Nauk, 3, 3\u20139. (In Russian) (Transactions of the Academy of Sciences of BSSR, Ser. Phys.-Math. Sci.).","journal-title":"Izvestiya Akademii Nauk BSSR,Sery\u00e2 Fizika-Matematy\u010dnyh Nauk"},{"key":"240_CR22","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/j.cor.2007.10.008","volume":"36","author":"V. S. Gordon","year":"2009","unstructured":"Gordon, V. S., & Tarasevich, A. A. (2009). A note: Common due date assignment for a single machine scheduling with the rate-modifying activity. Computers and Operations Research, 36, 325\u2013328.","journal-title":"Computers and Operations Research"},{"key":"240_CR23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(01)00181-3","volume":"139","author":"V. Gordon","year":"2002","unstructured":"Gordon, V., Proth, J. M., & Chu, C. (2002a). A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research, 139, 1\u201325.","journal-title":"European Journal of Operational Research"},{"key":"240_CR24","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/09537280110069621","volume":"13","author":"V. Gordon","year":"2002","unstructured":"Gordon, V., Proth, J. M., & Chu, C. (2002b). Due date assignment and scheduling: SLK, TWK and other due date assignment models. Production Planning and Control, 13, 117\u2013132.","journal-title":"Production Planning and Control"},{"key":"240_CR25","first-page":"21-1","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"V. S. Gordon","year":"2004","unstructured":"Gordon, V. S., Proth, J.-M., & Strusevich, V. A. (2004). Scheduling with due date assignment. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp. 21-1\u201321-22). Boca Raton: CRC Press."},{"key":"240_CR26","first-page":"15","volume":"13","author":"V. S. Gordon","year":"2005","unstructured":"Gordon, V. S., Proth, J.-M., & Strusevich, V. A. (2005). Single machine scheduling and due date assignment under series-parallel precedence constraints. Central European Journal of Operations Research, 13, 15\u201335.","journal-title":"Central European Journal of Operations Research"},{"key":"240_CR27","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/s10951-008-0064-x","volume":"11","author":"V. S. Gordon","year":"2008","unstructured":"Gordon, V. S., Potts, C. N., Strusevich, V. A., & Whitehead, J. D. (2008). Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation. Journal of Scheduling, 11, 357\u2013370.","journal-title":"Journal of Scheduling"},{"key":"240_CR28","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1080\/07408178608975351","volume":"18","author":"N. G. Hall","year":"1986","unstructured":"Hall, N. G. (1986). Scheduling problems with generalized due dates. IIE Transactions, 18, 220\u2013222.","journal-title":"IIE Transactions"},{"key":"240_CR29","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/0377-2217(91)90149-P","volume":"51","author":"N. G. Hall","year":"1991","unstructured":"Hall, N. G., Sethi, S. P., & Sriskandarajah, C. (1991). On the complexity of generalized due date scheduling problems. European Journal of Operational Research, 51, 100\u2013109.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"240_CR30","first-page":"289","volume":"23","author":"A. Janiak","year":"1987","unstructured":"Janiak, A. (1987). One-machine scheduling with allocating of continuously-divisible resource and with no precedence constraints. Kybernetika, 23(4), 289\u2013293.","journal-title":"Kybernetika"},{"key":"240_CR31","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0377-2217(96)00129-4","volume":"94","author":"A. Janiak","year":"1996","unstructured":"Janiak, A., & Kovalyov, M. Y. (1996). Single machine scheduling subject to deadlines and resource dependent processing times. European Journal of Operational Research, 94, 284\u2013291.","journal-title":"European Journal of Operational Research"},{"key":"240_CR32","first-page":"24-1","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"J. Jozefowska","year":"2004","unstructured":"Jozefowska, J., & Weglarz, J. (2004). Scheduling with resource constraints \u2013 continuous resources. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp. 24-1\u201324-15). Boca Raton: CRC Press."},{"key":"240_CR33","first-page":"20-1","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"P. Kaminsky","year":"2004","unstructured":"Kaminsky, P., & Hochbaum, D. (2004). Due-date quotation models and algorithms. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp. 20-1\u201320-22). Boca Raton: CRC Press."},{"key":"240_CR34","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1287\/opre.1060.0301","volume":"54","author":"M. A. Kubzin","year":"2006","unstructured":"Kubzin, M. A., & Strusevich, V. A. (2006). Planning machine maintenance in two-machine job scheduling. Operations Research, 54, 789\u2013800.","journal-title":"Operations Research"},{"key":"240_CR35","series-title":"Logistics of production and inventory","first-page":"445","volume-title":"Handbooks in operations research and management science","author":"E. L. Lawler","year":"1993","unstructured":"Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., & Shmoys, D. B. (1993). Sequencing and scheduling: algorithms and complexity. In S. C. Graves, A. H. G. Rinnooy Kan, & P. H. Zipkin (Eds.), Logistics of production and inventory: Vol. 4. Handbooks in operations research and management science (pp. 445\u2013522). Amsterdam: North-Holland."},{"key":"240_CR36","first-page":"22-1","volume-title":"Handbook of scheduling: algorithms, models and performance analysis","author":"C.-Y. Lee","year":"2004","unstructured":"Lee, C.-Y. (2004). Machine scheduling with availability constraints. In J. Y.-T. Leung (Ed.), Handbook of scheduling: algorithms, models and performance analysis (pp. 22-1\u201320-13). Boca Raton: CRC Press."},{"key":"240_CR37","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/(SICI)1520-6750(200003)47:2<145::AID-NAV5>3.0.CO;2-3","volume":"47","author":"C.-Y. Lee","year":"2000","unstructured":"Lee, C.-Y., & Chen, Z.-L. (2000). Scheduling jobs and maintenance activities on parallel machines. Naval Research Logistics, 47, 145\u2013165.","journal-title":"Naval Research Logistics"},{"key":"240_CR38","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0377-2217(99)00066-1","volume":"128","author":"C.-Y. Lee","year":"2001","unstructured":"Lee, C.-Y., & Leon, V.-J. (2001). Machine scheduling with a rate modifying activity. European Journal of Operational Research, 128, 119\u2013128.","journal-title":"European Journal of Operational Research"},{"key":"240_CR39","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1018909801944","volume":"70","author":"C.-Y. Lee","year":"1997","unstructured":"Lee, C.-Y., Lei, L., & Pinedo, M. (1997). Current trends in deterministic scheduling. Annals of Operation Research, 70, 1\u201341.","journal-title":"Annals of Operation Research"},{"key":"240_CR40","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1080\/07408170903394322","volume":"42","author":"Y. Leyvand","year":"2010","unstructured":"Leyvand, Y., Shabtay, D., & Steiner, G. (2010). Optimal delivery time quotation to minimize total tardiness penalties with controllable processing times. IIE Transactions, 42, 221\u2013231.","journal-title":"IIE Transactions"},{"key":"240_CR41","doi-asserted-by":"crossref","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. (1997). A single machine scheduling problem with common due window and controllable processing times. Annals of Operation Research, 70, 145\u2013154.","journal-title":"Annals of Operation Research"},{"key":"240_CR42","doi-asserted-by":"crossref","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. (1998). Common due window size and location determination in a single machine scheduling problem. The Journal of the Operational Research Society, 49, 1007\u20131010.","journal-title":"The Journal of the Operational Research Society"},{"key":"240_CR43","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/j.cie.2009.04.014","volume":"58","author":"Y. Ma","year":"2010","unstructured":"Ma, Y., Chu, C., & Zuo, C. (2010). A survey of scheduling with deterministic machine availability constraints. Computers & Industrial Engineering, 58, 199\u2013211.","journal-title":"Computers & Industrial Engineering"},{"key":"240_CR44","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/j.rcim.2004.12.005","volume":"22","author":"L. Min","year":"2006","unstructured":"Min, L., & Cheng, W. (2006). Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness\/tardiness scheduling problems. Robotics and Computer-Integrated Manufacturing, 22, 279\u2013287.","journal-title":"Robotics and Computer-Integrated Manufacturing"},{"key":"240_CR45","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/moor.12.1.22","volume":"12","author":"C. L. Monma","year":"1987","unstructured":"Monma, C. L., & Sidney, J. B. (1987). Optimal sequencing via modular decomposition: characterization of sequencing functions. Mathematics of Operations Research, 12, 22\u201331.","journal-title":"Mathematics of Operations Research"},{"key":"240_CR46","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1287\/moor.15.4.736","volume":"15","author":"C. L. Monma","year":"1990","unstructured":"Monma, C. L., Schrijver, A., Todd, M. J., & Wei, V. K. (1990). Convex resource allocation problems on directed acyclic graphs: duality, complexity, special cases and extensions. Mathematics of Operations Research, 15, 736\u2013748.","journal-title":"Mathematics of Operations Research"},{"key":"240_CR47","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1016\/S0377-2217(00)00175-2","volume":"132","author":"G. Mosheiov","year":"2001","unstructured":"Mosheiov, G. (2001). Scheduling problems with a learning effect. European Journal of Operational Research, 132, 687\u2013693.","journal-title":"European Journal of Operational Research"},{"key":"240_CR48","doi-asserted-by":"crossref","first-page":"1053","DOI":"10.1016\/j.mcm.2006.03.008","volume":"44","author":"G. Mosheiov","year":"2006","unstructured":"Mosheiov, G., & Oron, D. (2006). Due-date assignment and maintenance activity scheduling problem. Mathematical and Computer Modelling, 44, 1053\u20131057.","journal-title":"Mathematical and Computer Modelling"},{"key":"240_CR49","doi-asserted-by":"crossref","first-page":"997","DOI":"10.1057\/palgrave.jors.2602439","volume":"59","author":"G. Mosheiov","year":"2008","unstructured":"Mosheiov, G., & Sarig, A. (2008). A due-window assignment problem with position-dependent processing times. The Journal of the Operational Research Society, 59, 997\u20131003.","journal-title":"The Journal of the Operational Research Society"},{"key":"240_CR50","doi-asserted-by":"crossref","first-page":"2541","DOI":"10.1016\/j.cor.2008.10.007","volume":"36","author":"G. Mosheiov","year":"2009","unstructured":"Mosheiov, G., & Sarig, A. (2009). Scheduling a maintenance activity and due-window assignment on a single machine. Computers and Operations Research, 36, 2541\u20132545.","journal-title":"Computers and Operations Research"},{"key":"240_CR51","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/S0377-2217(02)00358-2","volume":"147","author":"G. Mosheiov","year":"2003","unstructured":"Mosheiov, G., & Sidney, J. B. (2003). Scheduling with general job-dependent learning curves. European Journal of Operational Research, 147, 665\u2013670.","journal-title":"European Journal of Operational Research"},{"key":"240_CR52","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1057\/jors.2008.114","volume":"60","author":"G. Mosheiov","year":"2009","unstructured":"Mosheiov, G., & Sidney, J. B. (2009). Scheduling a deteriorating maintenance activity on a single machine. The Journal of the Operational Research Society, 60, 1\u20136.","journal-title":"The Journal of the Operational Research Society"},{"key":"240_CR53","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1016\/j.ejor.2004.10.021","volume":"172","author":"G. Mosheiov","year":"2006","unstructured":"Mosheiov, G., & Yovel, U. (2006). Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs. European Journal of Operational Research, 172, 528\u2013544.","journal-title":"European Journal of Operational Research"},{"key":"240_CR54","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/58562.59300","volume":"36","author":"J. H. Muller","year":"1989","unstructured":"Muller, J. H., & Spinrad, J. (1989). Incremental modular decomposition: Polynomial algorithms. Journal of the Association for Computing Machinery, 36, 1\u201319.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"240_CR55","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1016\/S0305-0548(02)00066-7","volume":"30","author":"C. T. D. Ng","year":"2003","unstructured":"Ng, C. T. D., Cheng, T. C. E., Kovalyov, M. Y., & Lam, S. S. (2003). Single machine scheduling with a variable common due date and resource-dependent processing times. Computers and Operations Research, 30, 1173\u20131185.","journal-title":"Computers and Operations Research"},{"key":"240_CR56","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0166-218X(90)90105-L","volume":"26","author":"E. Nowicki","year":"1990","unstructured":"Nowicki, E., & Zdrza\u0142ka, S. (1990). A survey of results for sequencing problems with controllable processing times. Discrete Applied Mathematics, 26, 271\u2013287.","journal-title":"Discrete Applied Mathematics"},{"key":"240_CR57","doi-asserted-by":"crossref","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. (1992). Single-machine sequencing with controllable processing times. European Journal of Operational Research, 59, 298\u2013302.","journal-title":"European Journal of Operational Research"},{"key":"240_CR58","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. (1982). Common due date assignment to minimize total penalty for the one machine scheduling problem. Operations Research, 30, 391\u2013399.","journal-title":"Operations Research"},{"key":"240_CR59","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(98)00367-1","volume":"121","author":"G. Schmidt","year":"2000","unstructured":"Schmidt, G. (2000). Scheduling with limited machine availability. European Journal of Operational Research, 121, 1\u201315.","journal-title":"European Journal of Operational Research"},{"key":"240_CR60","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1016\/j.orl.2005.10.009","volume":"34","author":"D. Shabtay","year":"2006","unstructured":"Shabtay, D., & Steiner, G. (2006). Two due date assignment problems in scheduling a single machine. Operations Research Letters, 34, 683\u2013691.","journal-title":"Operations Research Letters"},{"key":"240_CR61","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1287\/msom.1060.0139","volume":"9","author":"D. Shabtay","year":"2007","unstructured":"Shabtay, D., & Steiner, G. (2007a). Optimal due date assignment and resource allocation to minimize the weighted number of tardy jobs on a single machine. Manufacturing & Service Operations Management, 9, 332\u2013350.","journal-title":"Manufacturing & Service Operations Management"},{"issue":"13","key":"240_CR62","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. (2007b). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643\u20131666.","journal-title":"Discrete Applied Mathematics"},{"key":"240_CR63","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10479-007-0269-y","volume":"159","author":"D. Shabtay","year":"2008","unstructured":"Shabtay, D., & Steiner, G. (2008a). The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times. Annals of Operation Research, 159, 25\u201340.","journal-title":"Annals of Operation Research"},{"key":"240_CR64","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s10951-007-0015-y","volume":"11","author":"D. Shabtay","year":"2008","unstructured":"Shabtay, D., & Steiner, G. (2008b). Optimal due date assignment in multi-machine scheduling environments. Journal of Scheduling, 11, 217\u2013228.","journal-title":"Journal of Scheduling"},{"key":"240_CR65","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/s10951-005-6813-1","volume":"8","author":"N. V. Shakhlevich","year":"2005","unstructured":"Shakhlevich, N. V., & Strusevich, V. A. (2005). Preemptive scheduling problems with controllable processing times. Journal of Scheduling, 8, 233\u2013253.","journal-title":"Journal of Scheduling"},{"key":"240_CR66","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1016\/j.dam.2005.04.014","volume":"154","author":"N. V. Shakhlevich","year":"2006","unstructured":"Shakhlevich, N. V., & Strusevich, V. A. (2006). Single machine scheduling with controllable release and processing times. Discrete Applied Mathematics, 154, 2178\u20132199.","journal-title":"Discrete Applied Mathematics"},{"key":"240_CR67","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1287\/opre.34.4.606","volume":"34","author":"J. B. Sidney","year":"1986","unstructured":"Sidney, J. B., & Steiner, G. (1986). Optimal sequencing by modular decomposition: Polynomial algorithms. Operations Research, 34, 606\u2013612.","journal-title":"Operations Research"},{"issue":"3","key":"240_CR68","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1080\/05695558008974515","volume":"12","author":"R. G. Vickson","year":"1980","unstructured":"Vickson, R. G. (1980). Two single machine sequencing problems involving controllable job processing times. AIIE Transactions, 12(3), 258\u2013262.","journal-title":"AIIE Transactions"},{"key":"240_CR69","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1016\/j.cor.2009.11.007","volume":"37","author":"S.-J. Yang","year":"2010","unstructured":"Yang, S.-J., Yang, D.-L., & Cheng, T. C. E. (2010). Single-machine due-window assignment and scheduling with job-dependent aging effects and deteriorating maintenance. Computers and Operations Research, 37, 1510\u20131514.","journal-title":"Computers and Operations Research"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0240-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0240-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0240-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T05:39:46Z","timestamp":1559453986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0240-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,15]]},"references-count":69,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["240"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0240-2","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,15]]}}}