{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T21:44:45Z","timestamp":1766180685880},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T00:00:00Z","timestamp":1404518400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1007\/s10951-014-0386-9","type":"journal-article","created":{"date-parts":[[2014,7,4]],"date-time":"2014-07-04T06:18:01Z","timestamp":1404454681000},"page":"75-88","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Multipurpose machine scheduling with rejection and identical job processing times"],"prefix":"10.1007","volume":"18","author":[{"given":"Dvir","family":"Shabtay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shlomo","family":"Karhi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Oron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,7,5]]},"reference":[{"issue":"1","key":"386_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0305-0548(85)90011-5","volume":"12","author":"V Aggarwal","year":"1985","unstructured":"Aggarwal, V. (1985). A Lagrangean-relaxation method for the constrained assignment problem. Computers and Operations Research, 12(1), 97\u2013106.","journal-title":"Computers and Operations Research"},{"key":"386_CR2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1006\/jcss.1995.1074","volume":"51","author":"Y Bartal","year":"1995","unstructured":"Bartal, Y., Fiat, A., Karloff, H. J., & Vohra, R. (1995). New algorithms for an ancient scheduling problem. Journal of Computer and System Sciences, 51, 359\u2013366.","journal-title":"Journal of Computer and System Sciences"},{"key":"386_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-04550-3","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2001","unstructured":"Brucker, P. (2001). Scheduling algorithms. New York, NJ: Springer."},{"key":"386_CR4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1023\/A:1018950911030","volume":"70","author":"P Brucker","year":"1997","unstructured":"Brucker, P., Jurisch, B., & Kramer, A. (1997). Complexity of scheduling problems with multi-purpose machines. Annals of Operations Research, 70, 57\u201373.","journal-title":"Annals of Operations Research"},{"key":"386_CR5","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":"386_CR6","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":"386_CR7","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0360-8352(97)00091-0","volume":"33","author":"G Centeno","year":"1997","unstructured":"Centeno, G., & Armacost, R. L. (1997). Parallel machine scheduling with release time and machine eligibility restrictions. Computers and Industrial Engineering, 33, 273\u2013276.","journal-title":"Computers and Industrial Engineering"},{"key":"386_CR8","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., Segupta, S., Uma, R. N., & Wein, J. (2003). Techniques for scheduling with rejection. Journal of Algorithms, 49, 175\u2013191.","journal-title":"Journal of Algorithms"},{"issue":"1\u20133","key":"386_CR9","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1016\/j.tcs.2006.05.025","volume":"359","author":"PS Efraimidis","year":"2006","unstructured":"Efraimidis, P. S., & Spirakis, P. G. (2006). Approximation schemes for scheduling and covering on unrelated machines. Theoretical Computer Science, 359(1\u20133), 400\u2013417.","journal-title":"Theoretical Computer Science"},{"key":"386_CR10","volume-title":"Computers and intractability: A guide to the theory of NP completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP completeness. New York, NY: W.H. Freeman & Co."},{"key":"386_CR11","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"},{"key":"386_CR12","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1002\/nav.20202","volume":"54","author":"A Glass","year":"2007","unstructured":"Glass, A., & Kellerer, H. (2007). Parallel machine scheduling with job assignment restrictions. Naval Research Logistics, 54, 250\u2013257.","journal-title":"Naval Research Logistics"},{"key":"386_CR13","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/j.cor.2004.07.010","volume":"33","author":"CA Glass","year":"2006","unstructured":"Glass, C. A., & Mills, H. R. (2006). Scheduling unit length jobs with parallel nested machine processing set restriction. Computers and Operations Research, 33, 620\u2013638.","journal-title":"Computers and Operations Research"},{"key":"386_CR14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0305-0548(81)90013-7","volume":"8","author":"A Gupta","year":"1981","unstructured":"Gupta, A., & Sharma, J. (1981). Tree search method for optimal core management of pressurised water reactors. Computers and Operations Research, 8, 263\u2013266.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"386_CR15","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.jalgor.2005.01.003","volume":"59","author":"NJA Harvey","year":"2006","unstructured":"Harvey, N. J. A., Ladner, R. E., Lovasz, L., & Tamir, T. (2006). Semi-matchings for bipartite graphs and load balancing. Journal of Algorithms, 59(1), 53\u201378.","journal-title":"Journal of Algorithms"},{"issue":"3","key":"386_CR16","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1287\/opre.21.3.846","volume":"21","author":"WA Horn","year":"1973","unstructured":"Horn, W. A. (1973). Minimizing average flow time with parallel machines. Operations Research, 21(3), 846\u2013847.","journal-title":"Operations Research"},{"issue":"2","key":"386_CR17","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E Horowitz","year":"1976","unstructured":"Horowitz, E., & Sahni, S. (1976). Exact and approximate algorithms for scheduling nonidentical processors. Journal of the Association for Computing Machinery, 23(2), 317\u2013327.","journal-title":"Journal of the Association for Computing Machinery"},{"issue":"3","key":"386_CR18","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":"386_CR19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/j.ejor.2009.10.025","volume":"204","author":"Y Huo","year":"2010","unstructured":"Huo, Y., & Leung, J. Y.-T. (2010). Parallel machine scheduling with nested processing set restrictions. European Journal of Operational Research, 204, 229\u2013236.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"386_CR20","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1287\/moor.26.2.324.10559","volume":"26","author":"K Jansen","year":"2001","unstructured":"Jansen, K., & Porkolab, L. (2001). Improved approximation schemes for scheduling unrelated parallel machines. Mathematics of Operations Research, 26(2), 324\u2013338.","journal-title":"Mathematics of Operations Research"},{"issue":"4","key":"386_CR21","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ipl.2008.04.021","volume":"108","author":"M Ji","year":"2008","unstructured":"Ji, M., & Cheng, T. C. E. (2008). An FPTAS for parallel-machine scheduling under a grade of service provision to minimize Makespan. Information Processing Letters, 108(4), 171\u2013174.","journal-title":"Information Processing Letters"},{"key":"386_CR22","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1137\/0206014","volume":"6","author":"DG Kafura","year":"1977","unstructured":"Kafura, D. G., & Shen, V. Y. (1977). Task scheduling on a multiprocessor system with independent memories. SIAM Journal on Computing, 6, 167\u2013187.","journal-title":"SIAM Journal on Computing"},{"key":"386_CR23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","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, NY: Plenum."},{"issue":"1","key":"386_CR24","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.ejor.2005.05.028","volume":"176","author":"PMD Lieshout","year":"2007","unstructured":"Lieshout, P. M. D., & Volgenant, A. (2007). A branch-and-bound algorithm for the singly constrained assignment problem. European Journal of Operational Research, 176(1), 151\u2013164.","journal-title":"European Journal of Operational Research"},{"key":"386_CR25","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10951-010-0190-0","volume":"14","author":"K Lee","year":"2011","unstructured":"Lee, K., Leung, J. Y.-T., & Pinedo, M. L. (2011). Scheduling jobs with equal processing times subject to machine eligibility constraints. Journal of Scheduling, 14, 27\u201338.","journal-title":"Journal of Scheduling"},{"key":"386_CR26","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/BF01585745","volume":"46","author":"JK Lenstra","year":"1990","unstructured":"Lenstra, J. K., Shmoys, D. B., & Tardos, E. (1990). Approximation algorithms for scheduling unrelated parallel machines. Mathematical Programming, 46, 259\u2013271.","journal-title":"Mathematical Programming"},{"issue":"2","key":"386_CR27","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/j.ijpe.2008.09.003","volume":"116","author":"JY-T Leung","year":"2008","unstructured":"Leung, J. Y.-T., & Li, C. L. (2008). Scheduling with processing set restriction: A survey. International Journal of Production Economics, 116(2), 251\u2013262.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"386_CR28","doi-asserted-by":"crossref","first-page":"1325","DOI":"10.1016\/j.ejor.2005.03.023","volume":"174","author":"C-L Li","year":"2006","unstructured":"Li, C.-L. (2006). Scheduling unit-length jobs with machine eligibility restrictions. European Journal of Operational Research, 174(2), 1325\u20131328.","journal-title":"European Journal of Operational Research"},{"key":"386_CR29","doi-asserted-by":"crossref","unstructured":"Li, S., & Yuan, J. (2010). Parallel-machine scheduling with deteriorating jobs and rejection. Theoretical Computer Science, 411, 3642\u20133650.","DOI":"10.1016\/j.tcs.2010.06.008"},{"key":"386_CR30","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/S0377-2217(02)00914-1","volume":"156","author":"Y Lin","year":"2004","unstructured":"Lin, Y., & Li, W. (2004). Parallel machine scheduling of machine-dependent jobs with unit-length. European Journal of Operational Research, 156, 261\u2013266.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"386_CR31","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1016\/j.ejor.2009.02.011","volume":"200","author":"CL Li","year":"2010","unstructured":"Li, C. L., & Wang, X. (2010). Scheduling parallel machines with inclusive processing set restrictions and job release times. European Journal of Operational Research, 200(3), 702\u2013710.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"386_CR32","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0020-0190(02)00210-7","volume":"83","author":"CP Low","year":"2002","unstructured":"Low, C. P. (2002). An efficient retrieval selection algorithm for video servers with random duplicated assignment storage technique. Information Processing Letters, 83(6), 315\u2013321.","journal-title":"Information Processing Letters"},{"key":"386_CR33","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1287\/opre.34.4.560","volume":"34","author":"JB Mazzola","year":"1986","unstructured":"Mazzola, J. B., & Neebe, A. W. (1986). Resource-constrained assignment scheduling. Operations Research, 34, 560\u2013572.","journal-title":"Operations Research"},{"issue":"4","key":"386_CR34","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1002\/nav.20286","volume":"55","author":"J Ou","year":"2008","unstructured":"Ou, J., Leung, J. Y.-T., & Li, C. L. (2008). Scheduling parallel machines with inclusive processing set restrictions. Naval Research Logistics, 55(4), 328\u2013338.","journal-title":"Naval Research Logistics"},{"key":"386_CR35","volume-title":"Scheduling: Theory, algorithms and systems","author":"M Pinedo","year":"2001","unstructured":"Pinedo, M. (2001). Scheduling: Theory, algorithms and systems (2nd ed.). Upper Saddle River, NJ: Prentice-Hall.","edition":"2"},{"key":"386_CR36","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"},{"key":"386_CR37","unstructured":"Serafini, P. (1986). Some Considerations about computational complexity for multiobjective combinatorial problems. In J. Jahn & W. Krabs (Eds.), Recent advances and historical development of vector optimization ( vol. 294). Lecture notes in Economics and mathematical systems. Berlin: Springer."},{"issue":"4","key":"386_CR38","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s10878-010-9350-6","volume":"23","author":"D Shabtay","year":"2012","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.","journal-title":"Journal of Combinatorial Optimization"},{"key":"386_CR39","doi-asserted-by":"crossref","unstructured":"Shabtay, D., Gasper, N., & Kaspi, M. (2013). A survey on scheduling problems with rejection. Journal of Scheduling, 16(1), 3\u201328.","DOI":"10.1007\/s10951-012-0303-z"},{"issue":"2","key":"386_CR40","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.orl.2004.05.004","volume":"33","author":"EV Shchepin","year":"2005","unstructured":"Shchepin, E. V., & Vakhania, N. (2005). An optimal rounding gives a better approximation for scheduling unrelated machines. Operations Research Letters, 33(2), 127\u2013133.","journal-title":"Operations Research Letters"},{"key":"386_CR41","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":"386_CR42","unstructured":"Spyropoulos, C. D., & Evans, D. J. (1985). Analysis of the Q.A.D. algorithm for an homogeneous multiprocessor computing model with independent memories. International Journal of Computer Mathematics, 17, 237\u2013255."},{"key":"386_CR43","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"},{"key":"386_CR44","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1007\/978-3-642-02026-1_39","volume":"5573","author":"Y Zhang","year":"2009","unstructured":"Zhang, Y., Ren, J., & Wang, C. (2009). Scheduling with rejection to minimize the Makespan. Lecture Notes in Computer Science, 5573, 411\u2013420.","journal-title":"Lecture Notes in Computer Science"},{"key":"386_CR45","unstructured":"Zhang, S., Cao, Z., & Zhang, Y. (2009). Scheduling with rejection to minimize the total weighted completion time, ISORA\u201909, pp. 111\u2013114."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0386-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0386-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0386-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:50Z","timestamp":1559468390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0386-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,5]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["386"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0386-9","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,5]]}}}