{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T20:33:51Z","timestamp":1776976431699,"version":"3.51.4"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,9,5]],"date-time":"2014-09-05T00:00:00Z","timestamp":1409875200000},"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-0395-8","type":"journal-article","created":{"date-parts":[[2014,9,4]],"date-time":"2014-09-04T23:34:03Z","timestamp":1409873643000},"page":"89-105","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":36,"title":["Metaheuristics for a scheduling problem with rejection and tardiness penalties"],"prefix":"10.1007","volume":"18","author":[{"given":"Simon","family":"Thevenin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Zufferey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marino","family":"Widmer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,9,5]]},"reference":[{"key":"395_CR1","doi-asserted-by":"crossref","first-page":"1091","DOI":"10.1023\/A:1013741325877","volume":"32","author":"MS Akturk","year":"2000","unstructured":"Akturk, M. S., & Ozdemir, D. (2000). An exact approach to minimizing total weighted tardiness with release dates. IIE Transactions, 32, 1091\u20131101.","journal-title":"IIE Transactions"},{"issue":"2","key":"395_CR2","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1016\/S0377-2217(00)00319-2","volume":"135","author":"MS Akturk","year":"2001","unstructured":"Akturk, M. S., & Ozdemir, D. (2001). A new dominance rule to minimize total weighted tardiness with unequal release dates. European Journal of Operational Research, 135(2), 394\u2013412.","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"395_CR3","doi-asserted-by":"crossref","first-page":"3471","DOI":"10.1016\/j.cor.2006.02.009","volume":"34","author":"D Anghinolfi","year":"2007","unstructured":"Anghinolfi, D., & Paolucci, M. (2007). Parallel machine total tardiness scheduling with a new hybrid metaheuristic approach. Computers & Operations Research, 34(11), 3471\u20133490.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"395_CR4","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.disopt.2004.12.003","volume":"2","author":"P Baptiste","year":"2005","unstructured":"Baptiste, P., & Le Pape, C. (2005). Scheduling a single machine to minimize a regular objective function under setup constraints. Discrete Optimization, 2(1), 83\u201399.","journal-title":"Discrete Optimization"},{"key":"395_CR5","unstructured":"Bilgint\u00fcrk Yal\u00e7\u0131n, Z., O\u011fuz, C., & Salman Sibel, F. (2007). Order acceptance and scheduling decisions in make-to-order systems. In Proceedings of the 3rd Multidisciplinary International Conference on Scheduling: Theory and Application (MISTA 2007) (pp. 80\u201387). Paris."},{"issue":"32","key":"395_CR6","first-page":"231","volume":"186","author":"L Bo","year":"2011","unstructured":"Bo, L., Ling, W., Ying, L., & Shouyang, W. (2011). A unified framework for population-based metaheuristics. Annals of Operations Research, 186(32), 231\u2013262.","journal-title":"Annals of Operations Research"},{"key":"395_CR7","doi-asserted-by":"crossref","first-page":"777","DOI":"10.1007\/s10845-009-0253-2","volume":"21","author":"W Bo\u017cejko","year":"2010","unstructured":"Bo\u017cejko, W. (2010). Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups. Journal of Intelligent Manufacturing, 21, 777\u2013785.","journal-title":"Journal of Intelligent Manufacturing"},{"issue":"6","key":"395_CR8","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., & Sibel Salman, F. (2012). A tabu search algorithm for order acceptance and scheduling. Computers & Operations Research, 39(6), 1197\u20131205. Special Issue on Scheduling in Manufacturing Systems.","journal-title":"Computers & Operations Research"},{"key":"395_CR9","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1287\/moor.15.3.483","volume":"15","author":"J Du","year":"1990","unstructured":"Du, J., & Leung, J. Y. (1990). Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research, 15, 483\u2013495.","journal-title":"Mathematics of Operations Research"},{"key":"395_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-1665-5","volume-title":"Handbook of Metaheuristics","author":"M Gendreau","year":"2010","unstructured":"Gendreau, M., & Potvin, J.-Y. (2010). Handbook of Metaheuristics (2nd ed.). New York: Springer.","edition":"2"},{"key":"395_CR11","unstructured":"Goslawski, M., J\u00f3zefowska, J., Kulus, M., & Nossack, J. (2014). Scheduling orders with mold setups in an injection plant. In Proceedings of the 14th International Workshop on Project Management and Scheduling, PMS 2014, Munich, Germany."},{"key":"395_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R Graham","year":"1979","unstructured":"Graham, R., Lawler, E., Lenstra, J., & Kan, A. (1979). Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics, 5, 287\u2013326.","journal-title":"Annals of Discrete Mathematics"},{"key":"395_CR13","unstructured":"Harrison, S.A., Philpott, M.S., & Price, M.E. (1999). Task scheduling for satellite based imagery. In Proceedings of the 18th Workshop of the UK Planning and Scheduling Special Interest Group (pp. 64\u201378) Salford: University of Salford."},{"key":"395_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(99)00435-X","volume":"126","author":"A Hertz","year":"2000","unstructured":"Hertz, A., & Kobler, D. (2000). A framework for the description of evolutionary algorithms. European Journal of Operational Research, 126, 1\u201312.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"395_CR15","doi-asserted-by":"crossref","first-page":"12,095","DOI":"10.1016\/j.eswa.2009.04.075","volume":"36","author":"HM Hsu","year":"2009","unstructured":"Hsu, H. M., Hsiung, Y., Chen, Y. Z., & Wu, M. C. (2009). A GA methodology for the scheduling of yarn-dyed textile production. Expert Systems with Applications, 36(10), 12,095\u201312,103.","journal-title":"Expert Systems with Applications"},{"issue":"3","key":"395_CR16","doi-asserted-by":"crossref","first-page":"879","DOI":"10.1016\/j.ejor.2006.11.036","volume":"184","author":"A Jouglet","year":"2008","unstructured":"Jouglet, A., Savourey, D., Carlier, J., & Baptiste, P. (2008). Dominance-based heuristics for one-machine total cost scheduling problems. European Journal of Operational Research, 184(3), 879\u2013899.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"395_CR17","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/j.amc.2007.10.013","volume":"199","author":"T Kelleg\u00f6z","year":"2008","unstructured":"Kelleg\u00f6z, T., Toklu, B., & Wilson, J. (2008). Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem. Applied Mathematics and Computation, 199(2), 590\u2013598.","journal-title":"Applied Mathematics and Computation"},{"issue":"7","key":"395_CR18","doi-asserted-by":"crossref","first-page":"1506","DOI":"10.1016\/j.cor.2011.08.022","volume":"39","author":"G Kirlik","year":"2012","unstructured":"Kirlik, G., & O\u011fuz, C. (2012). A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine. Computers and Operations Research, 39(7), 1506\u20131520.","journal-title":"Computers and Operations Research"},{"key":"395_CR19","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01471219","volume":"2","author":"M Laguna","year":"1991","unstructured":"Laguna, M., Barnes, J. W., & Glover, F. (1991). Tabu search methods for a single machine scheduling problem. Journal of Intelligent Manufacturing, 2, 63\u201373.","journal-title":"Journal of Intelligent Manufacturing"},{"key":"395_CR20","unstructured":"Le Pape, C. (2007). A Test Bed for Manufacturing Planning and Scheduling Discussion of Design Principles. In Proceedings of the International Workshop on Scheduling a Scheduling Competition, Providence Rhode Island USA."},{"issue":"1","key":"395_CR21","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1080\/07408179708966311","volume":"29","author":"YH Lee","year":"1997","unstructured":"Lee, Y. H., Bhaskaran, K., & Pinedo, M. (1997). A heuristic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions, 29(1), 45\u201352.","journal-title":"IIE Transactions"},{"key":"395_CR22","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/S1270-9638(02)01173-2","volume":"6","author":"M Lemaitre","year":"2002","unstructured":"Lemaitre, M., Verfaillie, G., Jouhaud, F., Lachiver, J. M., & Bataille, N. (2002). Selecting and scheduling observations of agile satellites. Aerospace Science and Technology, 6, 367\u2013381.","journal-title":"Aerospace Science and Technology"},{"key":"395_CR23","unstructured":"L\u00fc, Z., Glover, F., & Hao, J.K. (2009). Neighborhood combination for unconstrained binary quadratic problems. In Proceedings of the 8th Metaheuristic International Conference. Hamburg, Germany, 13\u201316 July, 2009."},{"issue":"2","key":"395_CR24","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0925-5273(97)00109-6","volume":"53","author":"N Nagarur","year":"1997","unstructured":"Nagarur, N., Vrat, P., & Duongsuwan, W. (1997). Production planning and scheduling for injection moulding of pipe fittings a case study. International Journal of Production Economics, 53(2), 157\u2013170.","journal-title":"International Journal of Production Economics"},{"key":"395_CR25","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 & Operations Research, 38, 367\u2013378.","journal-title":"Computers & Operations Research"},{"key":"395_CR26","unstructured":"Nobibon, F.T., Herbots, J., & Leus, R. (2009). Order acceptance and scheduling in a single-machine environment: Exact and heuristic algorithms. In Multidisciplinary International Conference on Scheduling: Theory and Applications (MISTA 2009), Dublin, Ireland."},{"key":"395_CR27","unstructured":"Nuijten, W., Bousonville, T., Focacci, F., Godard, D., & Le Pape, C. (2004). Towards an industrial manufacturing scheduling problem and test bed. In Proceedings of Project Management and Scheduling (PMS 2004), Nancy (pp. 162\u2013165)."},{"issue":"1","key":"395_CR28","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., Sibel Salman, F., & Bilgint\u00fcrk Yal\u00e7\u0131n, 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":"395_CR29","volume-title":"Scheduling: Theory, algorithms, and systems","author":"M Pinedo","year":"2008","unstructured":"Pinedo, M. (2008). Scheduling: Theory, algorithms, and systems. Berlin: Springer."},{"issue":"2","key":"395_CR30","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.33.2.363","volume":"33","author":"CN Potts","year":"1985","unstructured":"Potts, C. N., & van Wassenhove, L. N. (1985). A branch and bound algorithm for the total weighted tardiness problem. Operations Research, 33(2), 363\u2013377.","journal-title":"Operations Research"},{"key":"395_CR31","doi-asserted-by":"crossref","unstructured":"Ribeiro, F., de Souza, S., Souza, M., & Gomes, R. (2010). An adaptive genetic algorithm to solve the single machine scheduling problem with earliness and tardiness penalties. In IEEE Congress on Evolutionary Computation (CEC) (pp. 1\u20138).","DOI":"10.1109\/CEC.2010.5586367"},{"key":"395_CR32","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat, Y., & Taillard, E. (1995). Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics, 1, 147\u2013167.","journal-title":"Journal of Heuristics"},{"issue":"6","key":"395_CR33","doi-asserted-by":"crossref","first-page":"1758","DOI":"10.1016\/j.cor.2008.04.010","volume":"36","author":"WO Rom","year":"2009","unstructured":"Rom, W. O., & Slotnick, S. A. (2009). Order acceptance using genetic algorithms. Computers & Operations Research, 36(6), 1758\u20131767.","journal-title":"Computers & Operations Research"},{"key":"395_CR34","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/978-3-642-20364-0_2","volume":"6622","author":"V Sels","year":"2011","unstructured":"Sels, V., & Vanhoucke, M. (2011). A hybrid dual-population genetic algorithm for the single machine maximum lateness problem. Lecture Notes in Computer Science, 6622, 14\u201325.","journal-title":"Lecture Notes in Computer Science"},{"issue":"4","key":"395_CR35","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 job rejection and positional penalties. Journal of Combinatorial Optimization, 23(4), 395\u2013424.","journal-title":"Journal of Combinatorial Optimization"},{"key":"395_CR36","doi-asserted-by":"crossref","first-page":"859","DOI":"10.1007\/s001700200097","volume":"19","author":"HJ Shin","year":"2002","unstructured":"Shin, H. J., Kim, C. O., & Kim, S. S. (2002). A tabu search algorithm for single machine scheduling with release times, due dates, and sequence-dependent set-up times. The International Journal of Advanced Manufacturing Technology, 19, 859\u2013866.","journal-title":"The International Journal of Advanced Manufacturing Technology"},{"issue":"1","key":"395_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2010.09.042","volume":"212","author":"SA Slotnick","year":"2011","unstructured":"Slotnick, S. A. (2011). Order acceptance and scheduling: A taxonomy and review. European Journal of Operational Research, 212(1), 1\u201311.","journal-title":"European Journal of Operational Research"},{"key":"395_CR38","doi-asserted-by":"crossref","unstructured":"Taillard, E. D., Gambardella, L. M., Gendreau, M., & Potvin, J. Y. (2001). Adaptive memory programming: A unified view of metaheuristics. European Journal of Operational Research, 135, 1\u201316.","DOI":"10.1016\/S0377-2217(00)00268-X"},{"key":"395_CR39","unstructured":"Thevenin, S., Zufferey, N., & Widmer, M. (2012). Tabu search for a single machine scheduling problem with rejected jobs, setups and deadlines. In 9th International Conference of Modeling, Optimization and SIMulation (MOSIM 2012), Bordeaux."},{"issue":"8","key":"395_CR40","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1287\/mnsc.33.8.1035","volume":"33","author":"APJ Vepsalainen","year":"1987","unstructured":"Vepsalainen, A. P. J., & Morton, T. E. (1987). Priority rules for job shops with weighted tardiness costs. Management Science, 33(8), 1035\u20131047.","journal-title":"Management Science"},{"key":"395_CR41","doi-asserted-by":"crossref","first-page":"2518","DOI":"10.1109\/ICSMC.2005.1571527","volume":"3","author":"L Wei-Cheng","year":"2005","unstructured":"Wei-Cheng, L., & Chang, S. C. (2005). Hybrid algorithms for satellite imaging scheduling. Systems, Man and Cybernetics, Hawaii, USA, 3, 2518\u20132523.","journal-title":"Systems, Man and Cybernetics, Hawaii, USA"},{"key":"395_CR42","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/s10479-012-1124-3","volume":"196","author":"Q Wu","year":"2012","unstructured":"Wu, Q., Hao, J. K., & Glover, F. (2012). Multi-neighborhood tabu search for the maximum weight clique problem. Annals of Operations Research, 196, 611\u2013634.","journal-title":"Annals of Operations Research"},{"key":"395_CR43","doi-asserted-by":"crossref","unstructured":"Xiao, Y. Y., Zhang, R. Q., Zhao, Q. H., & Kaku, I. (2012). Permutation flow shop scheduling with order acceptance and weighted tardiness. Applied Mathematics and Computation, 218(15), 7911\u20137926.","DOI":"10.1016\/j.amc.2012.01.073"},{"issue":"3","key":"395_CR44","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 & Industrial Engineering, 53(3), 420\u2013432.","journal-title":"Computers & Industrial Engineering"},{"issue":"3","key":"395_CR45","doi-asserted-by":"crossref","first-page":"975","DOI":"10.1016\/j.ejor.2008.10.006","volume":"198","author":"L Zhang","year":"2009","unstructured":"Zhang, L., Lu, L., & Yuan, J. (2009). Single machine scheduling with release dates and rejection. European Journal of Operational Research, 198(3), 975\u2013978.","journal-title":"European Journal of Operational Research"},{"key":"395_CR46","doi-asserted-by":"crossref","unstructured":"Zorzini, M., Corti, D., & Pozzetti, A. (2008). Due date (dd) quotation and capacity planning in make-to-order companies: Results from an empirical analysis. International Journal of Production Economics, 112(2), 919\u2013933.","DOI":"10.1016\/j.ijpe.2007.08.005"},{"key":"395_CR47","unstructured":"Zufferey, N. (2012). Metaheuristics: Some principles for an efficient design. Computer Technology and Application, 3, 446\u2013462."},{"issue":"4","key":"395_CR48","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10951-008-0066-8","volume":"11","author":"N Zufferey","year":"2008","unstructured":"Zufferey, N., Amstutz, P., & Giaccari, P. (2008). Graph colouring approaches for a satellite range scheduling problem. Journal of Scheduling, 11(4), 263\u2013277.","journal-title":"Journal of Scheduling"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0395-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-014-0395-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-014-0395-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T11:14:44Z","timestamp":1689506084000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-014-0395-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,5]]},"references-count":48,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,2]]}},"alternative-id":["395"],"URL":"https:\/\/doi.org\/10.1007\/s10951-014-0395-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,9,5]]}}}