{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T00:20:21Z","timestamp":1769818821664,"version":"3.49.0"},"reference-count":46,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2016,11,5]],"date-time":"2016-11-05T00:00:00Z","timestamp":1478304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10732-016-9321-x","type":"journal-article","created":{"date-parts":[[2016,11,5]],"date-time":"2016-11-05T12:53:11Z","timestamp":1478350391000},"page":"849-890","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Order acceptance and scheduling with earliness and tardiness penalties"],"prefix":"10.1007","volume":"22","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":[[2016,11,5]]},"reference":[{"issue":"1","key":"9321_CR1","first-page":"1","volume":"5","author":"D Anghinolfi","year":"2008","unstructured":"Anghinolfi, D., Paolucci, M.: A new ant colony optimization approach for the single machine total weighted tardiness scheduling problem. Int. J. Oper. Res. 5(1), 1\u201317 (2008)","journal-title":"Int. J. Oper. Res."},{"issue":"21","key":"9321_CR2","doi-asserted-by":"crossref","first-page":"6087","DOI":"10.1080\/00207540701262913","volume":"46","author":"MO Atan","year":"2008","unstructured":"Atan, M.O., Akturk, M.S.: Single CNC machine scheduling with controllable processing times and multiple due dates. Int. J. Product. Res. 46(21), 6087\u20136111 (2008)","journal-title":"Int. J. Product. Res."},{"issue":"1","key":"9321_CR3","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1287\/opre.38.1.22","volume":"38","author":"KR Baker","year":"1990","unstructured":"Baker, K.R., Scudder, G.D.: Sequencing with earliness and tardiness penalties: a review. Oper. Res. 38(1), 22\u201336 (1990)","journal-title":"Oper. Res."},{"issue":"1","key":"9321_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.: Scheduling a single machine to minimize a regular objective function under setup constraints. Discret. Optim. 2(1), 83\u201399 (2005)","journal-title":"Discret. Optim."},{"issue":"6","key":"9321_CR5","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, S.F.: A tabu search algorithm for order acceptance and scheduling. Comput. Oper. Res. 39(6), 1197\u20131205 (2012). Special Issue on Scheduling in Manufacturing Systems","journal-title":"Comput. Oper. Res."},{"key":"9321_CR6","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1007\/s00170-006-0904-9","volume":"36","author":"Y-W Chen","year":"2008","unstructured":"Chen, Y.-W., Lu, Y.-Z., Yang, G.-K.: Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling. Int. J. Adv. Manuf. Technol. 36, 959\u2013968 (2008)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"4","key":"9321_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo, M., Birattari, M., Stuetzle, T.: Ant colony optimization-artificial ants as a computational intelligence technique. IEEE Comput. Intell. Mag. 1(4), 28\u201339 (2006)","journal-title":"IEEE Comput. Intell. Mag."},{"issue":"2","key":"9321_CR8","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/moor.13.2.330","volume":"13","author":"MR Garey","year":"1988","unstructured":"Garey, M.R., Tarjan, R.E., Wilfong, G.T.: One-processor scheduling with symmetric earliness and tardiness penalties. Math. Oper. Res. 13(2), 330\u2013348 (1988)","journal-title":"Math. Oper. Res."},{"key":"9321_CR9","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Potvin, J.-Y. (eds.): Handbook of metaheuristics. 2nd edn. Springer, New York (2010)","DOI":"10.1007\/978-1-4419-1665-5"},{"issue":"10","key":"9321_CR10","doi-asserted-by":"crossref","first-page":"2931","DOI":"10.1016\/j.cor.2005.11.004","volume":"34","author":"Y Hendel","year":"2007","unstructured":"Hendel, Y., Sourd, F.: An improved earliness\u2013tardiness timing algorithm. Comput. Oper. Res. 34(10), 2931\u20132938 (2007)","journal-title":"Comput. Oper. Res."},{"issue":"8","key":"9321_CR11","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1002\/nav.20259","volume":"54","author":"J Herbots","year":"2007","unstructured":"Herbots, J., Herroelen, W., Leus, R.: Dynamic order acceptance and capacity planning on a single bottleneck resource. Nav. Res. Logist. (NRL) 54(8), 874\u2013889 (2007)","journal-title":"Nav. Res. Logist. (NRL)"},{"issue":"5","key":"9321_CR12","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10732-008-9072-4","volume":"15","author":"A Hertz","year":"2009","unstructured":"Hertz, A., Schindl, D., Zufferey, N.: A solution method for a car fleet management problem with maintenance constraints. J. Heuristics 15(5), 425\u2013450 (2009)","journal-title":"J. Heuristics"},{"issue":"13","key":"9321_CR13","doi-asserted-by":"crossref","first-page":"4085","DOI":"10.1080\/00207543.2010.496797","volume":"49","author":"S Huang","year":"2011","unstructured":"Huang, S., Lu, M., Wan, G.: Integrated order selection and production scheduling under MTO strategy. Int. J. Product. Res. 49(13), 4085\u20134101 (2011)","journal-title":"Int. J. Product. Res."},{"issue":"5\u20136","key":"9321_CR14","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1007\/s00170-008-1618-y","volume":"42","author":"F Jolai","year":"2009","unstructured":"Jolai, F., Sheikh, S., Rabbani, M., Karimi, B.: A genetic algorithm for solving no-wait flexible flow lines with due window and job rejection. Int. J. Adv. Manuf. Technol. 42(5\u20136), 523\u2013532 (2009)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"8","key":"9321_CR15","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1016\/j.cor.2009.11.002","volume":"37","author":"S Kedad-Sidhoum","year":"2010","unstructured":"Kedad-Sidhoum, S., Sourd, F.: Fast neighborhood search for the single machine earliness\u2013tardiness scheduling problem. Comput. Operat. Res. 37(8), 1464\u20131471 (2010)","journal-title":"Comput. Operat. Res."},{"issue":"12","key":"9321_CR16","doi-asserted-by":"crossref","first-page":"2978","DOI":"10.1016\/j.cor.2012.03.004","volume":"39","author":"K Kianfar","year":"2012","unstructured":"Kianfar, K., Moslehi, G.: A branch-and-bound algorithm for single machine scheduling with quadratic earliness and tardiness penalties. Comput. Operat. Res. 39(12), 2978\u20132990 (2012)","journal-title":"Comput. Operat. Res."},{"issue":"4","key":"9321_CR17","doi-asserted-by":"crossref","first-page":"2531","DOI":"10.1016\/j.apm.2012.06.012","volume":"37","author":"N Manavizadeh","year":"2013","unstructured":"Manavizadeh, N., Goodarzi, A.H., Rabbani, M., Jolai, F.: Order acceptance\/rejection policies in determining the sequence in mixed model assembly lines. Appl. Math. Model. 37(4), 2531\u20132551 (2013)","journal-title":"Appl. Math. Model."},{"issue":"1","key":"9321_CR18","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/j.ijpe.2010.11.016","volume":"135","author":"SA Mansouri","year":"2012","unstructured":"Mansouri, S.A., Gallear, D., Askariazad, M.H.: Decision support for build-to-order supply chain management through multiobjective optimization. Int. J. Product. Econ. 135(1), 24\u201336 (2012)","journal-title":"Int. J. Product. Econ."},{"issue":"2","key":"9321_CR19","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0377-2217(99)00260-X","volume":"123","author":"S Martello","year":"2000","unstructured":"Martello, S., Pisinger, D., Toth, P.: New trends in exact algorithms for the 0\u20131 knapsack problem. Eur. J. Operat. Res. 123(2), 325\u2013332 (2000)","journal-title":"Eur. J. Operat. Res."},{"issue":"1","key":"9321_CR20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0377-2217(99)00345-8","volume":"128","author":"R Mazzini","year":"2001","unstructured":"Mazzini, R., Armentano, V.A.: A heuristic for single machine scheduling with early and tardy costs. Eur. J. Operat. Res. 128(1), 129\u2013146 (2001)","journal-title":"Eur. J. Operat. Res."},{"issue":"January","key":"9321_CR21","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.: Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment. Comput. Operat. Res. 38(January), 367\u2013378 (2011)","journal-title":"Comput. Operat. Res."},{"key":"9321_CR22","unstructured":"Nuijten, W., Bousonville, T., Focacci, F., Godard, D., Le Pape, C.: Towards an industrial manufacturing scheduling problem and test bed. In: Proceedings of the 9th International Workshop on Project Management and Scheduling, pms (2004)"},{"issue":"1","key":"9321_CR23","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.F., Yal\u00e7\u0131n, B.Z.: Order acceptance and scheduling decisions in make-to-order systems. Int. J. Product. Econ. 125(1), 200\u2013211 (2010)","journal-title":"Int. J. Product. Econ."},{"key":"9321_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-26580-3","volume-title":"Scheduling: Theory, Algorithms, and Systems","author":"M Pinedo","year":"2016","unstructured":"Pinedo, M.: Scheduling: Theory, Algorithms, and Systems, 5th edn. Springer, Berlin (2016)","edition":"5"},{"key":"9321_CR25","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1057\/jors.2009.27","volume":"61","author":"M Plumettaz","year":"2010","unstructured":"Plumettaz, M., Schindl, D., Zufferey, N.: Ant local search and its efficient adaptation to graph colouring. J. Operat. Res. Soc. 61, 819\u2013826 (2010)","journal-title":"J. Operat. Res. Soc."},{"issue":"2","key":"9321_CR26","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.: A branch and bound algorithm for the total weighted tardiness problem. Operat. Res. 33(2), 363\u2013377 (1985)","journal-title":"Operat. Res."},{"key":"9321_CR27","unstructured":"Respen, J., Zufferey, N.: Ant algorithms for a truck loading problem with multiple destinations. In: Proceedings of the 14th International Workshop on Project Management and Scheduling, PMS (2014)"},{"key":"9321_CR28","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147\u2013167 (1995)","journal-title":"J. Heuristics"},{"issue":"3","key":"9321_CR29","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1016\/j.cie.2004.01.011","volume":"46","author":"J Schaller","year":"2004","unstructured":"Schaller, J.: Single machine scheduling with early and quadratic tardy penalties. Comput. Ind. Eng. 46(3), 511\u2013532 (2004)","journal-title":"Comput. Ind. Eng."},{"issue":"4","key":"9321_CR30","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.: A bicriteria approach to scheduling a single machine with job rejection and positional penalties. J. Comb. Optim. 23(4), 395\u2013424 (2012)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"9321_CR31","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10951-012-0303-z","volume":"16","author":"D Shabtay","year":"2013","unstructured":"Shabtay, D., Gaspar, N., Kaspi, M.: A survey on offline scheduling with rejection. J. Sched. 16(1), 3\u201328 (2013)","journal-title":"J. Sched."},{"issue":"15","key":"9321_CR32","doi-asserted-by":"crossref","first-page":"2178","DOI":"10.1016\/j.dam.2005.04.014","volume":"154","author":"NV Shakhlevich","year":"2006","unstructured":"Shakhlevich, N.V., Strusevich, V.A.: Single machine scheduling with controllable release and processing parameters. Discret. Appl. Math. 154(15), 2178\u20132199 (2006)","journal-title":"Discret. Appl. Math."},{"issue":"1","key":"9321_CR33","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.: Order acceptance and scheduling: a taxonomy and review. Eur. J. Operat. Res. 212(1), 1\u201311 (2011)","journal-title":"Eur. J. Operat. Res."},{"issue":"7","key":"9321_CR34","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1002\/1520-6750(199510)42:7<1109::AID-NAV3220420709>3.0.CO;2-5","volume":"42","author":"W Szwarc","year":"1995","unstructured":"Szwarc, W., Mukhopadhyay, S.K.: Optimal timing schedules in earliness\u2013tardiness single machine sequencing. Nav. Res. logist. 42(7), 1109\u20131114 (1995)","journal-title":"Nav. Res. logist."},{"issue":"3","key":"9321_CR35","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10951-011-0242-0","volume":"15","author":"S Tanaka","year":"2012","unstructured":"Tanaka, S., Fujikuma, S.: A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time. J. Sched. 15(3), 347\u2013361 (2012)","journal-title":"J. Sched."},{"issue":"1","key":"9321_CR36","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0925-5273(94)90014-0","volume":"37","author":"HA Kate ten","year":"1994","unstructured":"ten Kate, H.A.: Towards a better understanding of order acceptance. Int. J. Product. Econ. 37(1), 139\u2013152 (1994)","journal-title":"Int. J. Product. Econ."},{"key":"9321_CR37","unstructured":"Thevenin, S., Zufferey, N., Widmer, M.: 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) (2012)"},{"issue":"1","key":"9321_CR38","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10951-014-0395-8","volume":"18","author":"S Thevenin","year":"2015","unstructured":"Thevenin, S., Zufferey, N., Widmer, M.: Metaheuristics for a scheduling problem with rejection and tardiness penalties. J. Sched. 18(1), 89\u2013105 (2015)","journal-title":"J. Sched."},{"key":"9321_CR39","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s00170-010-2921-y","volume":"54","author":"J Valente","year":"2011","unstructured":"Valente, J., Moreira, M., Singh, A., Alves, R.: Genetic algorithms for single machine scheduling with quadratic earliness and tardiness costs. Int. J. Adv. Manuf. Technol. 54, 251\u2013265 (2011)","journal-title":"Int. J. Adv. Manuf. Technol."},{"issue":"October","key":"9321_CR40","doi-asserted-by":"crossref","first-page":"2707","DOI":"10.1016\/j.cor.2008.11.016","volume":"36","author":"JMS Valente","year":"2009","unstructured":"Valente, J.M.S., Gon\u00e7alves, J.F.: A genetic algorithm approach for the single machine scheduling problem with linear earliness and quadratic tardiness penalties. Comput. Operat. Res. 36(October), 2707\u20132715 (2009)","journal-title":"Comput. Operat. Res."},{"issue":"2","key":"9321_CR41","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/S0377-2217(01)00302-2","volume":"142","author":"G Wan","year":"2002","unstructured":"Wan, G., Yen, B.P.-C.: Tabu search for single machine scheduling with distinct due windows and weighted earliness\/tardiness penalties. Eur. J. Oper. Res. 142(2), 271\u2013281 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9321_CR42","unstructured":"Weng, M., Weng, M.\u00a0X., Sedani, M.: Schedule one machine to minimize early\/tardy penalty by tabu search. In: Proceedings of the Annual IIE Research Conference (2002)"},{"key":"9321_CR43","unstructured":"Yal\u00e7\u0131n, B.\u00a0Z., O\u011fuz, C., Salman, S.\u00a0F.: 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 (2007)"},{"issue":"2","key":"9321_CR44","doi-asserted-by":"crossref","first-page":"919","DOI":"10.1016\/j.ijpe.2007.08.005","volume":"112","author":"M Zorzini","year":"2008","unstructured":"Zorzini, M., Corti, D., Pozzetti, A.: Due date (dd) quotation and capacity planning in make-to-order companies: results from an empirical analysis. Int. J. Product. Econ. 112(2), 919\u2013933 (2008)","journal-title":"Int. J. Product. Econ."},{"issue":"5","key":"9321_CR45","doi-asserted-by":"crossref","first-page":"963","DOI":"10.1007\/s11590-011-0327-x","volume":"6","author":"N Zufferey","year":"2012","unstructured":"Zufferey, N.: Optimization by ant algorithms: possible roles for an individual ant. Optim. Lett. 6(5), 963\u2013973 (2012a)","journal-title":"Optim. Lett."},{"key":"9321_CR46","first-page":"446","volume":"3","author":"N Zufferey","year":"2012","unstructured":"Zufferey, N.: Metaheuristics: some principles for an efficient design. Comput. Technol. Appl. 3, 446\u2013462 (2012b)","journal-title":"Comput. Technol. Appl."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-016-9321-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-016-9321-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-016-9321-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T05:34:11Z","timestamp":1568525651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-016-9321-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,5]]},"references-count":46,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["9321"],"URL":"https:\/\/doi.org\/10.1007\/s10732-016-9321-x","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,5]]}}}