{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T11:58:48Z","timestamp":1781092728252,"version":"3.54.1"},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,12,20]],"date-time":"2012-12-20T00:00:00Z","timestamp":1355961600000},"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":[[2013,2]]},"DOI":"10.1007\/s10951-012-0303-z","type":"journal-article","created":{"date-parts":[[2012,12,19]],"date-time":"2012-12-19T15:15:23Z","timestamp":1355930123000},"page":"3-28","source":"Crossref","is-referenced-by-count":225,"title":["A survey on offline scheduling with rejection"],"prefix":"10.1007","volume":"16","author":[{"given":"Dvir","family":"Shabtay","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nufar","family":"Gaspar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Moshe","family":"Kaspi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,12,20]]},"reference":[{"issue":"3","key":"303_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 machine sequencing problems involving controllable job processing times. European Journal of Operational Research, 70(3), 335\u2013341.","journal-title":"European Journal of Operational Research"},{"key":"303_CR2","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1007\/3-540-44676-1_16","volume":"2161","author":"E Angel","year":"2001","unstructured":"Angel, E., Bampis, E., & Kononov, A. (2001). A FPTAS for approximating the unrelated parallel machines scheduling problem with costs. Lecture Notes in Computer Science, 2161, 194\u2013205.","journal-title":"Lecture Notes in Computer Science"},{"issue":"2","key":"303_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0020-0190(01)00196-X","volume":"81","author":"A Bechman","year":"2002","unstructured":"Bechman, A., Janiak, A., & Kovalyov, M. Y. (2002). Minimizing the total weighted completion time of deteriorating jobs. Information Processing Letters, 81(2), 81\u201384.","journal-title":"Information Processing Letters"},{"issue":"1","key":"303_CR4","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1137\/S0895480196300522","volume":"13","author":"Y Bartal","year":"2000","unstructured":"Bartal, Y., Leonardi, S., Marchetti-Spaccamela, A., Sgall, J., & Stougie, L. (2000). Multiprocessor scheduling with rejection. SIAM Journal of Discrete Mathematics, 13(1), 64\u201378.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"303_CR5","unstructured":"Bilgint\u00fcrk, Z., O\u011fuz, C., & Salman, S. (2007). Order acceptance and scheduling decisions in make-to-order systems. In 5th Multidisciplinary International Scheduling Conference: Theory and Applications, Paris, France."},{"key":"303_CR6","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1007\/11750321_8","volume":"3959","author":"Z Cao","year":"2006","unstructured":"Cao, Z., Wang, Z., Zhang, Y., & Liu, S. (2006). On several scheduling problems with rejection or discretely compressible processing times. Lecture Notes in Computer Science, 3959, 90\u201398.","journal-title":"Lecture Notes in Computer Science"},{"key":"303_CR7","doi-asserted-by":"crossref","first-page":"2732","DOI":"10.1016\/j.tcs.2009.04.006","volume":"410","author":"Z Cao","year":"2009","unstructured":"Cao, Z., & Yang, X. (2009). A PTAS for parallel batch scheduling with rejection and dynamic job arrivals. Theoretical Computer Science, 410, 2732\u20132745.","journal-title":"Theoretical Computer Science"},{"key":"303_CR8","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s11424-007-9050-1","volume":"20","author":"Z Cao","year":"2007","unstructured":"Cao, Z., & Zhang, Y. (2007). Scheduling with rejection and non-identical job arrivals. Journal of Systems Science and Complexity, 20, 529\u2013535.","journal-title":"Journal of Systems Science and Complexity"},{"issue":"6","key":"303_CR9","doi-asserted-by":"crossref","first-page":"1197","DOI":"10.1016\/j.cor.2010.09.018","volume":"39","author":"B Cesaret","year":"2012","unstructured":"Cesaret, B., O\u011fuz, C., & Salman, F. S. (2012). A tabu search algorithm for order acceptance and scheduling. Computers and Operations Research, 39(6), 1197\u20131205.","journal-title":"Computers and Operations Research"},{"key":"303_CR10","doi-asserted-by":"crossref","unstructured":"Cheng, Y., & Sun, S. (2009). Scheduling linear deteriorating jobs with rejection on a single machine. European Journal of Operational Research, 194(1), 18\u201327.","DOI":"10.1016\/j.ejor.2007.11.047"},{"issue":"2","key":"303_CR11","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1016\/j.ejor.2005.09.030","volume":"176","author":"BC Choi","year":"2007","unstructured":"Choi, B. C., Yoon, S. H., & Chung, S. J. (2007). Minimizing maximum completion time in a proportionate flow shop with one machine of different speed. European Journal of Operational Research, 176(2), 964\u2013974.","journal-title":"European Journal of Operational Research"},{"key":"303_CR12","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.ejor.2011.03.017","volume":"213","author":"BC Choi","year":"2011","unstructured":"Choi, B. C., & Chung, J. (2011). Two-machne flow shop schedulng problem with an outsourcing option. European Journal of Operational Research, 213, 66\u201372.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"303_CR13","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1002\/(SICI)1099-1425(199903\/04)2:2<73::AID-JOS18>3.0.CO;2-Q","volume":"2","author":"F Chudak","year":"1999","unstructured":"Chudak, F. (1999). A min-sum 1.5-approximation algorithm for scheduling unrelated parallel machines. Journal of Scheduling, 2(2), 73\u201377.","journal-title":"Journal of Scheduling"},{"key":"303_CR14","doi-asserted-by":"crossref","unstructured":"De, P., Ghosh, J. B., & Wells, C. E. (1991). Optimal delivery time quotation and order sequencing. Decision Sciences, 22(2), 379\u2013390.","DOI":"10.1111\/j.1540-5915.1991.tb00353.x"},{"issue":"1","key":"303_CR15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0196-6774(03)00078-6","volume":"49","author":"DW Engels","year":"2003","unstructured":"Engels, D. W., Karger, D. R., Kolliopoulos, S. G., Sengupta, S., Uma, R. N., & Wein, J. (2003). Techniques for scheduling with rejection. Journal of Algorithms, 49(1), 175\u2013191.","journal-title":"Journal of Algorithms"},{"key":"303_CR16","unstructured":"Gaspar, N., & Shabtay, D. (2010). Various special cases of the multiple-machine flow-shop scheduling problem with rejection. Working Paper."},{"key":"303_CR17","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of $$\\cal NP$$ -completeness. San Francisco: Freeman."},{"issue":"2","key":"303_CR18","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0305-0548(96)00045-7","volume":"24","author":"JB Ghosh","year":"1997","unstructured":"Ghosh, J. B. (1997). Job selection in a heavily loaded shop. Computers and Operations Research, 24(2), 141\u2013145.","journal-title":"Computers and Operations Research"},{"issue":"4","key":"303_CR19","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1145\/321978.321985","volume":"23","author":"T Gonzalez","year":"1976","unstructured":"Gonzalez, T., & Sahni, S. (1976). Open shop scheduling to minimize finish time. Journal of Association of Computing Machinery, 23(4), 665\u2013679.","journal-title":"Journal of Association of Computing Machinery"},{"key":"303_CR20","doi-asserted-by":"crossref","unstructured":"Gordon, V., Proth, J. M., & Chu, C. B. (2002). A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research, 139(1), 1\u201325.","DOI":"10.1016\/S0377-2217(01)00181-3"},{"issue":"2","key":"303_CR21","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. B. (2002). Due date assignment and scheduling: SLK, TWK and other due date assignment models. Production Planning and Control, 13(2), 117\u2013132.","journal-title":"Production Planning and Control"},{"key":"303_CR22","unstructured":"Gordon, V., Proth, J. M., & Strusevich, V. A. (2004). Scheduling with due date assignment. In J. Y.-T. Leung (Ed.), Handbook of scheduling (pp. 21-1-21-22). Boca Raton, FL: CRC Press."},{"key":"303_CR23","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"RL Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., & Lenstra, J. K. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 4, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"issue":"4","key":"303_CR24","first-page":"59","volume":"29","author":"HH Guerrero","year":"1988","unstructured":"Guerrero, H. H., & Kern, G. M. (1988). How to more effectively accept and refuse orders. Production and Inventory Management, 29(4), 59\u201363.","journal-title":"Production and Inventory Management"},{"issue":"9","key":"303_CR25","doi-asserted-by":"crossref","first-page":"2774","DOI":"10.1016\/j.cor.2005.10.018","volume":"34","author":"S Gurel","year":"2007","unstructured":"Gurel, S., & Akturk, M. S. (2007). Scheduling parallel CNC machines with time\/cost trade-off considerations. Computers and Operations Research, 34(9), 2774\u20132789.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"303_CR26","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/s10107-002-0324-z","volume":"94","author":"H Hoogeveen","year":"2003","unstructured":"Hoogeveen, H., Skutella, M., & Woeginger, G. J. (2003). Preemptive scheduling with rejection. Mathematical Programming, 94(3), 361\u2013374.","journal-title":"Mathematical Programming"},{"key":"303_CR27","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H Hoogeveen","year":"2005","unstructured":"Hoogeveen, H. (2005). Multicriteria scheduling. European Journal of Operational Research, 167, 592\u2013623.","journal-title":"European Journal of Operational Research"},{"key":"303_CR28","doi-asserted-by":"crossref","unstructured":"Jansen, K., & Porkolab, L. (1999). Improved approximation schemes for scheduling unrelated parallel machines. In STOC \u201999 Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta (pp. 408\u2013417).","DOI":"10.1145\/301250.301361"},{"key":"303_CR29","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0167-6377(94)90041-8","volume":"16","author":"J J\u00f3zefowska","year":"1994","unstructured":"J\u00f3zefowska, J., Jurisch, B., & Kubiak, W. (1994). Scheduling shops to minimize the weighted number of late jobs. Operations Research Letters, 16, 277\u2013283.","journal-title":"Operations Research Letters"},{"key":"303_CR30","unstructured":"Kaminsky, P., & Hochbaum, D. (2004). Due date quotation models and algorithms. In J. Y.-T. Leung (Ed.), Handbook of scheduling (pp. 20-1\u201320-22). Boca Raton, FL: CRC Press."},{"key":"303_CR31","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85\u2013103). New York: Plenum Press."},{"key":"303_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., & Pisinger, D. (2004). Knapsack problems. Berlin: Springer."},{"key":"303_CR33","doi-asserted-by":"crossref","first-page":"601","DOI":"10.1007\/978-3-540-87744-8_50","volume":"5193","author":"S Khuller","year":"2008","unstructured":"Khuller, S., & Mestre, J. (2008). An optimal incremental algorithm for minimizing lateness with rejection. Lecture Notes in Computer Science, 5193, 601\u2013610.","journal-title":"Lecture Notes in Computer Science"},{"issue":"2","key":"303_CR34","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.orl.2009.10.013","volume":"38","author":"C Koulamas","year":"2010","unstructured":"Koulamas, C. (2010). A faster algorithm for a due date assignment problem with tardy jobs. Operations Research Letters, 38(2), 127\u2013128.","journal-title":"Operations Research Letters"},{"issue":"1","key":"303_CR35","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1287\/mnsc.16.1.77","volume":"16","author":"EL Lawler","year":"1969","unstructured":"Lawler, E. L., & Moore, J. M. (1969). A functional equation and its application to resource allocation and sequencing problems. Management Science, 16(1), 77\u201384.","journal-title":"Management Science"},{"key":"303_CR36","first-page":"544","volume":"26","author":"EL Lawler","year":"1973","unstructured":"Lawler, E. L. (1973). Optimal sequencing of a single machine subject to precedence constraints. Operations Research, 26, 544\u2013546.","journal-title":"Operations Research"},{"key":"303_CR37","unstructured":"Lawler, E. L., & Lenstra, J. K. (1982). Recent developments in deterministic sequencing and scheduling: A survey. In J. K. Lenstra & A. H. G. Rinnooy Kan (Eds.), Deterministic and stochastic scheduling (pp. 35\u201373). Dordrecht: Dempster, Reidel."},{"issue":"2","key":"303_CR38","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.ijpe.2008.09.003","volume":"116","author":"JYT Leung","year":"2008","unstructured":"Leung, J. Y. T., & Li, C. L. (2008). Scheduling with processing time restriction: A survey. International Journal of Production Economics, 116(2), 251\u2013262.","journal-title":"International Journal of Production Economics"},{"key":"303_CR39","doi-asserted-by":"crossref","unstructured":"Li, X., & Feng, H. (2010). Minimize the sum of total completion time and total rejection penalties on a single batching machine. In Procedding of the International Conference on Information, Engineering (pp. 200\u2013202).","DOI":"10.1109\/ICIE.2010.143"},{"key":"303_CR40","doi-asserted-by":"crossref","unstructured":"Lin, J. H., & Vitter, J. S. (1992). $$\\varepsilon $$ -Approximation algorithms with minimum packing constraint violation. In STOC \u201992 Proceedings of the Twenty-Fourth Annual ACM Symposium on Theory of Computing (pp. 771\u2013782).","DOI":"10.1145\/129712.129787"},{"key":"303_CR41","doi-asserted-by":"crossref","first-page":"3642","DOI":"10.1016\/j.tcs.2010.06.008","volume":"411","author":"S Li","year":"2010","unstructured":"Li, S., & Yuan, J. (2010). Parallel-machine scheduling with deteriorating jobs and rejection. Theoretical Computer Science, 411, 3642\u20133650.","journal-title":"Theoretical Computer Science"},{"issue":"10","key":"303_CR42","doi-asserted-by":"crossref","first-page":"2748","DOI":"10.1016\/j.cor.2008.12.003","volume":"36","author":"L Lu","year":"2009","unstructured":"Lu, L., Cheng, T. C. E., Yuan, J., & Zhang, L. (2009). Bounded single-machine parallel-batch scheduling with release dates and rejection. Computers and Operations Research, 36(10), 2748\u20132751.","journal-title":"Computers and Operations Research"},{"key":"303_CR43","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.tcs.2008.02.015","volume":"396","author":"L Lu","year":"2008","unstructured":"Lu, L., Zhang, L., & Yuan, J. (2008). The unbounded parallel batch machine scheduling with release dates and rejection to minimize makespan. Theoretical Computer Science, 396, 283\u2013289.","journal-title":"Theoretical Computer Science"},{"key":"303_CR44","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-642-14355-7_23","volume":"6124","author":"C Miao","year":"2010","unstructured":"Miao, C., Zhang, Y., & Wang, C. (2010). Bounded parallel-batch scheduling on unrelated parallel machines. Lecture Notes in Computer Science, 6124, 220\u2013228.","journal-title":"Lecture Notes in Computer Science"},{"key":"303_CR45","unstructured":"Moghaddam, A., Yalaoui, F., Amodeo, L., Karimi, B., & Jolai, F. (2010). Developing a technique for a bi-objective scheduling model with rejection by simulated annealing. In MOSIM\u201910, Proceedings of the Eight International Conference of Modeling and Simulation, Hammamet."},{"key":"303_CR46","doi-asserted-by":"crossref","unstructured":"Mosheiov, G. (2003). Scheduling unit processing time jobs on an $$m$$ -machine flow shop. Journal of the Operational Research Society, 54(4), 437\u2013441.","DOI":"10.1057\/palgrave.jors.2601512"},{"issue":"1","key":"303_CR47","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/j.ejor.2003.09.010","volume":"161","author":"G Mosheiov","year":"2005","unstructured":"Mosheiov, G., & Oron, D. (2005). A note on flow-shop and job-shop batch scheduling with identical processing-time jobs. European Journal of Operational Research, 161(1), 285\u2013291.","journal-title":"European Journal of Operational Research"},{"key":"303_CR48","unstructured":"Mosheiov, G., & Sarig, A. (2009). Scheduling and due-date assignment problems with job rejection. Foundations of Computing and Decision Sciences, 34(3), 193\u2013208."},{"key":"303_CR49","first-page":"2","volume":"83","author":"G McGovern","year":"2005","unstructured":"McGovern, G., & Quelch, J. (2005). Outsourcing marketing. Harvard Business Review, 83, 2\u20133.","journal-title":"Harvard Business Review"},{"issue":"10","key":"303_CR50","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.cor.2010.06.003","volume":"38","author":"FT Nobibon","year":"2011","unstructured":"Nobibon, F. T., & Leus, R. (2011). Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment. Computers and Operations Research, 38(10), 367\u2013378.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"303_CR51","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1016\/j.ijpe.2010.02.002","volume":"125","author":"C O\u011fuz","year":"2010","unstructured":"O\u011fuz, C., Salman, S., & Bilgint\u00fcrk, Z. (2010). Order acceptance and scheduling decisions in make-to-order systems. International Journal of Production Economics, 125(1), 200\u2013211.","journal-title":"International Journal of Production Economics"},{"key":"303_CR52","doi-asserted-by":"crossref","unstructured":"Orlin, J. B., Schulz, A. S., & Sengupta, S. (2000). $$\\varepsilon $$ -Optimization schemes and L-Bit precision: Alternative perspectives in combinatorial optimization. In STOC \u201900 Proceedings of the Thirty-Two Annual ACM Symposium on Theory of Computing.","DOI":"10.1145\/335305.335377"},{"key":"303_CR53","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-3-642-80784-8_2","volume-title":"Symposium on the theory of scheduling and its applications","author":"SS Panwalker","year":"1973","unstructured":"Panwalker, S. S., Dudek, R. A., & Smith, M. L. (1973). Sequencing research and the industrial problem. In S. E. Elmaghraby (Ed.), Symposium on the theory of scheduling and its applications (pp. 29\u201338). Berlin: Springer."},{"key":"303_CR54","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C. H., & Yannakakis, M. (2000). On the approximability of trade-offs and optimal access of web sources. In Proceedings 41th Annual IEEE Symposium on Foundations of Computer Science, Redondo Beach, CA, USA (pp. 86\u201392).","DOI":"10.1109\/SFCS.2000.892068"},{"key":"303_CR55","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1002\/1099-1425(200011\/12)3:6<365::AID-JOS56>3.0.CO;2-P","volume":"3","author":"CA Phillips","year":"2000","unstructured":"Phillips, C. A., Uma, R. N., & Wein, J. (2000). Off-line admission control for general scheduling problems. Journal of Scheduling, 3, 365\u2013381.","journal-title":"Journal of Scheduling"},{"key":"303_CR56","volume-title":"Scheduling: Theory, algorithms and systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo, M. (2008). Scheduling: Theory, algorithms and systems (3rd ed.). Upper Saddle River, NJ: Prentice-Hall.","edition":"3"},{"key":"303_CR57","doi-asserted-by":"crossref","unstructured":"Rom, W. O., & Slotnick, S. A. (2009). Order acceptance using genetic algorithms. Computers and Operations Research, 36(5), 1758\u2013 1767.","DOI":"10.1016\/j.cor.2008.04.010"},{"issue":"5","key":"303_CR58","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1287\/mnsc.12.5.437","volume":"12","author":"MH Rothkopf","year":"1966","unstructured":"Rothkopf, M. H. (1966). Scheduling independent tasks on parallel processors. Management Science, 12(5), 437\u2013447.","journal-title":"Management Science"},{"issue":"1","key":"303_CR59","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S Sahni","year":"1976","unstructured":"Sahni, S. (1976). Algorithms for scheduling independent tasks. Journal of the ACM, 23(1), 116\u2013127.","journal-title":"Journal of the ACM"},{"key":"303_CR60","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/3-540-63248-4_11","volume":"1269","author":"AS Schulz","year":"1997","unstructured":"Schulz, A. S., & Skutella, M. (1997). Random-based scheduling: New approximations and LP lower bounds. Lecture Notes in Computer Science, 1269, 119\u2013133.","journal-title":"Lecture Notes in Computer Science"},{"key":"303_CR61","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1007\/3-540-63397-9_32","volume":"1284","author":"AS Schulz","year":"1997","unstructured":"Schulz, A. S., & Skutella, M. (1997). Scheduling-LPs bear probabilities: Randomized approximations for min-sum criteria. Lecture Notes in Computer Science, 1284, 416\u2013429.","journal-title":"Lecture Notes in Computer Science"},{"key":"303_CR62","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/978-3-540-45078-8_8","volume":"2748","author":"S Sengupta","year":"2003","unstructured":"Sengupta, S. (2003). Algorithms and approximation schemes for minimum lateness\/tardiness scheduling with rejection. Lecture Notes in Computer Science, 2748, 79\u201390.","journal-title":"Lecture Notes in Computer Science"},{"issue":"6","key":"303_CR63","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(6), 683\u2013691.","journal-title":"Operations Research Letters"},{"issue":"13","key":"303_CR64","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. (2007). A survey of scheduling with controllable processing times. Discrete Applied Mathematics, 155(13), 1643\u20131666.","journal-title":"Discrete Applied Mathematics"},{"key":"303_CR65","doi-asserted-by":"crossref","unstructured":"Shabtay, D., Gaspar, N., & Yedidsion, L. (2012). A bicriteria approach to scheduling a single machine with rejection and positional penalties. Journal of Combinatorial Optimization, 23(4), 395\u2013424.","DOI":"10.1007\/s10878-010-9350-6"},{"issue":"5","key":"303_CR66","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1016\/j.cor.2011.05.023","volume":"39","author":"D Shabtay","year":"2012","unstructured":"Shabtay, D., & Gaspar, N. (2012). Two-machine flow-shop with rejection. Computers and Operations Research, 39(5), 1087\u20131096.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"303_CR67","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1002\/(SICI)1099-1425(1998100)1:3<157::AID-JOS12>3.0.CO;2-Y","volume":"1","author":"N Shakhlevich","year":"1998","unstructured":"Shakhlevich, N., Hoogeveen, H., & Pinedo, M. (1998). Minimizing total weighted completion time in a proportionate flow shop. Journal of Scheduling, 1(3), 157\u2013168.","journal-title":"Journal of Scheduling"},{"key":"303_CR68","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"DB Shmoys","year":"1993","unstructured":"Shmoys, D. B., & Tardos, E. (1993). An approximation algorithm for the generalized assignment problem. Mathematical Programming, 62, 461\u2013474.","journal-title":"Mathematical Programming"},{"issue":"2","key":"303_CR69","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0305-0548(95)00015-E","volume":"23","author":"SA Slotnick","year":"1996","unstructured":"Slotnick, S. A., & Morton, T. E. (1996). Selecting jobs for a heavily loaded shop with lateness penalties. Computers and Operations Research, 23(2), 131\u2013140.","journal-title":"Computers and Operations Research"},{"key":"303_CR70","doi-asserted-by":"crossref","unstructured":"Slotnick, S. A., & Morton, T. E. (2007). Order acceptance with weighted tardiness. Computers and Operations Research, 34, 3029\u20133042.","DOI":"10.1016\/j.cor.2005.11.012"},{"key":"303_CR71","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"WE Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"303_CR72","doi-asserted-by":"crossref","unstructured":"Steiner, G., & Zhang, R. (2011). Revised delivery-time quotation in scheduling with tardiness penalties. Operations Research, 59, 1504\u20131511.","DOI":"10.1287\/opre.1110.0948"},{"key":"303_CR73","volume-title":"Multicriteria scheduling: Theory, models and algorithms","author":"V T\u2019kindt","year":"2006","unstructured":"T\u2019kindt, V., & Billaut, J.-C. (2006). Multicriteria scheduling: Theory, models and algorithms (2nd ed.). Berlin: Springer.","edition":"2"},{"issue":"1","key":"303_CR74","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/ijoc.1050.0167","volume":"19","author":"V T\u2019kindt","year":"2007","unstructured":"T\u2019kindt, V., & Della Croce, F. (2007). Enumeration of Pareto optima for a flowshop scheduling problem with two criteria. INFORMS Journal of Computing, 19(1), 64\u201372.","journal-title":"INFORMS Journal of Computing"},{"issue":"2","key":"303_CR75","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1287\/opre.42.2.234","volume":"42","author":"MA Trick","year":"1994","unstructured":"Trick, M. A. (1994). Scheduling multiple variable-speed machines. Operations Research, 42(2), 234\u2013248.","journal-title":"Operations Research"},{"key":"303_CR76","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1016\/j.cie.2007.02.005","volume":"53","author":"B Yang","year":"2007","unstructured":"Yang, B., & Geunes, J. (2007). A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times. Computers and Industrial Engineering, 53, 420\u2013432.","journal-title":"Computers and Industrial Engineering"},{"key":"303_CR77","unstructured":"Zhang, S., Cao, Z., & Zhang Y. (2009a). Scheduling with rejection to minimize the total weighted completion time. In ISORA\u201909 (pp. 111\u2013114)."},{"key":"303_CR78","doi-asserted-by":"crossref","unstructured":"Zhang, L., Lu, L., & Yuan, J. (2009b). Single machine scheduling with release dates and rejection. European Journal of Operational Research, 198(3), 975\u2013978.","DOI":"10.1016\/j.ejor.2008.10.006"},{"key":"303_CR79","doi-asserted-by":"crossref","first-page":"1877","DOI":"10.1016\/j.tcs.2010.02.006","volume":"411","author":"L Zhang","year":"2010","unstructured":"Zhang, L., Lu, L., & Yuan, J. (2010). Single-machine scheduling under the job rejection constraint. Theoretical Computer Science, 411, 1877\u20131882.","journal-title":"Theoretical Computer Science"},{"key":"303_CR80","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Ren, J., & Wang, C. (2009c). Scheduling with rejection to minimize the makespan. Lecture Notes in Computer Science, 5573, 411\u2013420.","DOI":"10.1007\/978-3-642-02026-1_39"}],"updated-by":[{"DOI":"10.1007\/s10951-015-0417-1","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2015,1,23]],"date-time":"2015-01-23T00:00:00Z","timestamp":1421971200000}}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0303-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0303-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0303-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,27]],"date-time":"2023-06-27T22:32:40Z","timestamp":1687905160000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0303-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,12,20]]},"references-count":80,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,2]]}},"alternative-id":["303"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0303-z","relation":{"correction":[{"id-type":"doi","id":"10.1007\/s10951-015-0417-1","asserted-by":"object"}]},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,12,20]]}}}