{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,16]],"date-time":"2023-12-16T13:36:46Z","timestamp":1702733806165},"reference-count":85,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,4,21]],"date-time":"2007-04-21T00:00:00Z","timestamp":1177113600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2007,4,21]],"date-time":"2007-04-21T00:00:00Z","timestamp":1177113600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s10479-007-0175-3","type":"journal-article","created":{"date-parts":[[2007,4,20]],"date-time":"2007-04-20T16:14:24Z","timestamp":1177085664000},"page":"215-234","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Counting and enumeration complexity with application to multicriteria scheduling"],"prefix":"10.1007","volume":"153","author":[{"given":"Vincent","family":"T\u2019kindt","sequence":"first","affiliation":[]},{"given":"Karima","family":"Bouibede-Hocine","sequence":"additional","affiliation":[]},{"given":"Carl","family":"Esswein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,4,21]]},"reference":[{"issue":"7\u20138","key":"175_CR1","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1016\/S0305-0548(97)00097-X","volume":"25","author":"M. T. Almeida","year":"1998","unstructured":"Almeida, M. T., & Centeno, M. (1998). A composite heuristic for the single machine early\/tardy job scheduling problem. Computers and Operations Research, 25(7\u20138), 625\u2013635.","journal-title":"Computers and Operations Research"},{"key":"175_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation: combinatorial optimization problems and their approximability properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., & Protasi, M. (1999). Complexity and approximation: combinatorial optimization problems and their approximability properties. Heidelberg: Springer."},{"key":"175_CR3","doi-asserted-by":"publisher","first-page":"1321","DOI":"10.1080\/002075497195344","volume":"35","author":"M. Azizoglu","year":"1997","unstructured":"Azizoglu, M., & Webster, S. (1997). Scheduling job families about an unrestricted common due date on a single machine. International Journal of Production Research, 35, 1321\u20131330.","journal-title":"International Journal of Production Research"},{"key":"175_CR4","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0925-5273(91)90044-T","volume":"23","author":"M. Azizoglu","year":"1991","unstructured":"Azizoglu, M., Kondakci, S. K., & Kirca, O. (1991). Bicriteria scheduling problem involving total tardiness and total earliness penalties. International Journal of Production Economics, 23, 17\u201324.","journal-title":"International Journal of Production Economics"},{"key":"175_CR5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/978-3-642-60667-0_27","volume-title":"Multicriteria analysis","author":"M. Azizoglu","year":"1997","unstructured":"Azizoglu, M., Kondakci, S. K., & Koksalan, M. (1997). Bicriteria scheduling: minimizing flowtime and maximum earliness on a single machine. In J. Climaco (Ed.), Multicriteria analysis (pp.\u00a0279\u2013288). Heidelberg: Springer."},{"issue":"3","key":"175_CR6","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0377-2217(80)90087-9","volume":"5","author":"S. P. Bansal","year":"1980","unstructured":"Bansal, S. P. (1980). Single machine scheduling to minimize weighted sum of completion times with secondary criterion\u2014a\u00a0branch and bound approach. European Journal of Operational Research, 5(3), 177\u2013181.","journal-title":"European Journal of Operational Research"},{"key":"175_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P. (2004). Scheduling algorithms. Berlin: Springer."},{"issue":"1","key":"175_CR8","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/nav.3800230111","volume":"23","author":"R. N. Burns","year":"1976","unstructured":"Burns, R. N. (1976). Scheduling to minimize the weighted sum of completion times with secondary criteria. Naval Research Logistics Quarterly, 23(1), 125\u2013129.","journal-title":"Naval Research Logistics Quarterly"},{"key":"175_CR9","unstructured":"Chand, S., & Schneeberger, H. (1984). Single machine scheduling to minimize weighted completion time with maximum allowable tardiness. Technical report, University of Purdue, U.S.A."},{"issue":"3","key":"175_CR10","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1002\/nav.3800330319","volume":"33","author":"S. Chand","year":"1986","unstructured":"Chand, S., & Schneeberger, H. (1986). A note on the single machine scheduling problem with minimum weighted completion time and maximum allowable tardiness. Naval Research Logistics Quarterly, 33(3), 551\u2013557.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"175_CR11","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0377-2217(88)90356-6","volume":"34","author":"S. Chand","year":"1988","unstructured":"Chand, S., & Schneeberger, H. (1988). Single machine scheduling to minimize weighted earliness subject to no tardy jobs. European Journal of Operational Research, 34(2), 221\u2013230.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"175_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0305-0548(90)90022-Y","volume":"17","author":"C.-L. Chen","year":"1990","unstructured":"Chen, C.-L., & Bulfin, R. L. (1990). Scheduling unit processing time jobs on a single machine with multiple criteria. Computers and Operations Research, 17(1), 1\u20137.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"175_CR13","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/S0360-8352(99)00149-7","volume":"36","author":"F. D. Chou","year":"1999","unstructured":"Chou, F. D., & Lee, C. Y. (1999). Two-machine flowshop scheduling with bicriteria problem. Computers and Industrial Engineering, 36(3), 549\u2013564.","journal-title":"Computers and Industrial Engineering"},{"key":"175_CR14","doi-asserted-by":"publisher","first-page":"981","DOI":"10.1002\/1520-6750(199012)37:6<981::AID-NAV3220370617>3.0.CO;2-H","volume":"37","author":"R. L. Daniels","year":"1990","unstructured":"Daniels, R. L., & Chambers, R. J. (1990). Multiobjective flow-shop scheduling. Naval Research Logistics, 37, 981\u2013995.","journal-title":"Naval Research Logistics"},{"issue":"4","key":"175_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0305-0548(82)90025-9","volume":"9","author":"R. F. Deckro","year":"1982","unstructured":"Deckro, R. F., Herbert, J. E., & Winkofsky, E. P. (1982). Multiple criteria job-shop scheduling. Computers and Operations Research, 9(4), 279\u2013285.","journal-title":"Computers and Operations Research"},{"key":"175_CR16","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0167-188X(91)90008-P","volume":"21","author":"P. Dileepan","year":"1991","unstructured":"Dileepan, P., & Sen, T. (1991). Bicriterion jobshop scheduling with total flowtime and sum of squared lateness. Engineering Costs and Production Economic, 21, 295\u2013299.","journal-title":"Engineering Costs and Production Economic"},{"key":"175_CR17","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1111\/j.1475-3995.2000.tb00182.x","volume":"7","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott, M. (2000). Approximation algorithms for combinatorial multicriteria optimization problems. International Transactions in Operations Research, 7, 5\u201331.","journal-title":"International Transactions in Operations Research"},{"issue":"4","key":"175_CR18","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1002\/nav.3800220314","volume":"22","author":"H. Emmons","year":"1975","unstructured":"Emmons, H. (1975). One machine sequencing to minimize mean flow time with minimum number tardy. Naval Research Logistics Quarterly, 22(4), 585\u2013592.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"12","key":"175_CR19","doi-asserted-by":"crossref","first-page":"1853","DOI":"10.1080\/00207548808948000","volume":"26","author":"T. D. Fry","year":"1988","unstructured":"Fry, T. D., & Blackstone, R. H. (1988). Planning for idle time: a rationale for underutilization of capacity. International Journal of Production Research, 26(12), 1853\u20131859.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"175_CR20","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0167-188X(86)90007-8","volume":"10","author":"T. D. Fry","year":"1986","unstructured":"Fry, T. D., & Leong, G. K. (1986). Bi-criterion single-machine scheduling with forbidden early shipments. Engineering Costs and Production Science, 10(2), 133\u2013137.","journal-title":"Engineering Costs and Production Science"},{"issue":"4","key":"175_CR21","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1080\/07408178708975418","volume":"19","author":"T. D. Fry","year":"1987","unstructured":"Fry, T. D., Armstrong, R. D., & Blackstone, R. H. (1987a). Minimizing weighted absolute deviation in single machine scheduling. IIE Transactions, 19(4), 445\u2013450.","journal-title":"IIE Transactions"},{"issue":"4","key":"175_CR22","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0305-0483(87)90015-6","volume":"15","author":"T. D. Fry","year":"1987","unstructured":"Fry, T. D., Leong, G. K., & Rakes, T. R. (1987b). Single machine scheduling: a comparison of two solution procedures. Omega, 15(4), 277\u2013282.","journal-title":"Omega"},{"issue":"2","key":"175_CR23","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/0305-0548(95)00008-A","volume":"23","author":"T. D. Fry","year":"1996","unstructured":"Fry, T. D., Armstrong, R. D., Darby-Dowman, K., & Philipoom, P. R. (1996). A\u00a0branch and bound procedure to minimize mean absolute lateness on a single processor. Computers and Operations Research, 23(2), 171\u2013182.","journal-title":"Computers and Operations Research"},{"key":"175_CR24","unstructured":"Fukuda, K. (1996). Note on new complexity classes \n$\\mathcal{ENP}$\n, \n$\\mathcal{EP}$ \nand \n$\\mathcal{CEP}$\n\u2014an\u00a0extension of the classes\u00a0\n$\\mathcal{NP}$\n, co\u2014\n$\\mathcal{NP}$ \nand\u00a0 \u2118. http:\/\/www.ifor.math.ethz.ch\/staff\/fukuda\/ENP_home\/ENP_note.html."},{"key":"175_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0925-7721(95)00049-6","volume":"8","author":"K. Fukuda","year":"1997","unstructured":"Fukuda, K., Liebling, T. M., & Margot, F. (1997). Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron. Computational Geometry, 8, 1\u201312.","journal-title":"Computational Geometry"},{"key":"175_CR26","volume-title":"Computers and intractability: a guide to the theory of $\\mathcal{NP}$ -Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of \n                           $\\mathcal{NP}$\n                           -Completeness. New York: Freeman."},{"key":"175_CR27","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawler, E. L., Lenstra, J. K., & Rinnooy Kan, A. H. G. (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":"175_CR28","unstructured":"Gupta, J. N. D., & Werner, F. (1999). On the solution of 2-machine flow and open shop scheduling problems with secondary criteria. In 15th ISPE\/IEE international conference on CAD\/CAM, robotics, and factories of the future, Aguas de Lindoia, Sao Paulo, Brasil."},{"issue":"3","key":"175_CR29","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1080\/095372899233217","volume":"10","author":"J. N. D. Gupta","year":"1999","unstructured":"Gupta, J. N. D., Palanimuthu, N., & Chen, C.-L. (1999). Designing a tabu search algorithm for the two-stage flowshop problem with secondary criterion. Production Planning and Control, 10(3), 251\u2013265.","journal-title":"Production Planning and Control"},{"issue":"3","key":"175_CR30","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0925-5273(00)00039-6","volume":"69","author":"J. N. D. Gupta","year":"2001","unstructured":"Gupta, J. N. D., Neppalli, V. R., & Werner, F. (2001). Minimizing total flow time in a two-machine flowshop problem with minimum makespan. International Journal of Production Economics, 69(3), 323\u2013338.","journal-title":"International Journal of Production Economics"},{"issue":"2","key":"175_CR31","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0305-0548(00)00061-7","volume":"29","author":"J. N. D. Gupta","year":"2002","unstructured":"Gupta, J. N. D., Hennig, K., & Werner, F. (2002). Local search heuristic for the two-stage flowshop problems with secondary criterion. Computers and Operations Research, 29(2), 113\u2013149.","journal-title":"Computers and Operations Research"},{"key":"175_CR32","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800190215","volume":"19","author":"H. Heck","year":"1972","unstructured":"Heck, H., & Roberts, S. (1972). A note on the extension of a result on scheduling with secondary criteria. Naval Research Logistics Quarterly, 19, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"175_CR33","unstructured":"Hoogeveen, J. A. (1992). Single-machine bicriteria scheduling. PhD\u00a0thesis, CWI, Amsterdam, The Netherlands."},{"issue":"1","key":"175_CR34","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1287\/moor.21.1.100","volume":"21","author":"J. A. Hoogeveen","year":"1996","unstructured":"Hoogeveen, J. A. (1996a). Minimizing maximum promptness and maximum lateness on a single machine. Mathematics of Operations Research, 21(1), 100\u2013114.","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"175_CR35","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1006\/jagm.1996.0051","volume":"21","author":"J. A. Hoogeveen","year":"1996","unstructured":"Hoogeveen, J. A. (1996b). Single machine scheduling to minimize a function of two or three maximum cost criteria. Journal of Algorithms, 21(2), 415\u2013433.","journal-title":"Journal of Algorithms"},{"key":"175_CR36","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0167-6377(95)00023-D","volume":"17","author":"J. A. Hoogeveen","year":"1995","unstructured":"Hoogeveen, J. A., & VandeVelde, S. L. (1995). Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Operations Research Letters, 17, 205\u2013208.","journal-title":"Operations Research Letters"},{"key":"175_CR37","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BF01920271","volume":"24","author":"K. Huckert","year":"1980","unstructured":"Huckert, K., Rhode, R., Roglin, O., & Weber, R. (1980). On the interactive solution to a multicriteria scheduling problem. Zeitchrift fur Operations Research, 24, 47\u201360.","journal-title":"Zeitchrift fur Operations Research"},{"key":"175_CR38","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/S0377-2217(96)00239-1","volume":"102","author":"R. J. W. James","year":"1997","unstructured":"James, R. J. W., & Buchanan, J. T. (1997). A neighbourhood scheme with a compressed solution space for the early\/tardy scheduling problem. European Journal of Operational Research, 102, 513\u2013527.","journal-title":"European Journal of Operational Research"},{"key":"175_CR39","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1016\/S0377-2217(97)00261-0","volume":"106","author":"R. J. W. James","year":"1998","unstructured":"James, R. J. W., & Buchanan, J. T. (1998). Performance enhancements to tabu search for the early\/tardy scheduling problem. European Journal of Operational Research, 106, 254\u2013265.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"175_CR40","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/0305-0548(89)90034-8","volume":"16","author":"T. C. John","year":"1989","unstructured":"John, T. C. (1989). Tradeoff solutions in single machine production scheduling for minimizing flow time and maximum penalty. Computers and Operations Research, 16(5), 471\u2013479.","journal-title":"Computers and Operations Research"},{"key":"175_CR41","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D. S. Johnson","year":"1988","unstructured":"Johnson, D. S., Yannakakis, M., & Papadimitriou, C. H. (1988). On generating all maximal independent sets. Information Processing Letters, 27, 119\u2013123.","journal-title":"Information Processing Letters"},{"key":"175_CR42","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/nav.3800010110","volume":"1","author":"S. M. Johnson","year":"1954","unstructured":"Johnson, S. M. (1954). Optimal two and three stage production schedules with set-up time included. Naval Research Logistics Quarterly, 1, 61\u201368.","journal-title":"Naval Research Logistics Quarterly"},{"key":"175_CR43","first-page":"27","volume":"10","author":"J. Jozefowska","year":"1994","unstructured":"Jozefowska, J., Jurisch, B., & Kubiak, W. (1994). Scheduling shops to minimize the weighted number of late jobs. Operations Research Letters, 10, 27\u201333.","journal-title":"Operations Research Letters"},{"key":"175_CR44","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1002\/1520-6750(199412)41:7<913::AID-NAV3220410705>3.0.CO;2-A","volume":"41","author":"Y.-D. Kim","year":"1994","unstructured":"Kim, Y.-D., & Yano, C. A. (1994). Minimizing mean tardiness and earliness in single-machine scheduling problems with unequal due dates. Naval Research Logistics, 41, 913\u2013933.","journal-title":"Naval Research Logistics"},{"key":"175_CR45","series-title":"Lecture notes in economics and mathematical systems","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1007\/978-3-642-59132-7_70","volume-title":"Multiple criteria decision making","author":"S. K. Kondakci","year":"1997","unstructured":"Kondakci, S. K., Emre, E., & Koksalan, M. (1997). Scheduling of unit processing time jobs on a single machine. In G. Fandel & T. Gal (Eds.), Multiple criteria decision making. Lecture notes in economics and mathematical systems (vol.\u00a0448, pp.\u00a0654\u2013660). Heidelberg: Springer."},{"key":"175_CR46","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/0377-2217(95)00116-6","volume":"91","author":"C. Koulamas","year":"1996","unstructured":"Koulamas, C. (1996). Single-machine scheduling with time windows and earliness\/tardiness penalties. European Journal of Operational Research, 91, 190\u2013202.","journal-title":"European Journal of Operational Research"},{"key":"175_CR47","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0305-0548(99)00005-2","volume":"27","author":"G. J. Kyparisis","year":"2000","unstructured":"Kyparisis, G. J., & Koulamas, C. (2000). Open shop scheduling with makespan and total completion time criteria. Computers and Operations Research, 27, 15\u201327.","journal-title":"Computers and Operations Research"},{"key":"175_CR48","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/S0377-2217(96)00062-8","volume":"96","author":"G. Li","year":"1997","unstructured":"Li, G. (1997). Single machine earliness and tardiness scheduling. European Journal of Operational Research, 96, 546\u2013558.","journal-title":"European Journal of Operational Research"},{"key":"175_CR49","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1057\/palgrave.jors.2600442","volume":"48","author":"C. J. Liao","year":"1997","unstructured":"Liao, C. J., Yu, W. C., & Joe, C. B. (1997). Bicriterion scheduling in the two-machine flowshop. Journal of the Operational Research Society, 48, 929\u2013935.","journal-title":"Journal of the Operational Research Society"},{"key":"175_CR50","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/S0305-0548(98)00081-1","volume":"26","author":"C. F. Liaw","year":"1999","unstructured":"Liaw, C. F. (1999). A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Computers and Operations Research, 26, 679\u2013693.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"175_CR51","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF00934608","volume":"39","author":"K. S. Lin","year":"1983","unstructured":"Lin, K. S. (1983). Hybrid algorithm for sequencing with bicriteria. Journal of Optimization Theory and Applications, 39(1), 105\u2013124.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"175_CR52","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/S0377-2217(99)00345-8","volume":"128","author":"R. Mazzini","year":"2001","unstructured":"Mazzini, R., & Armentano, V. A. (2001). A heuristic for single machine scheduling with early and tardy costs. European Journal of Operational Research, 128, 129\u2013146.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"175_CR53","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/ijoc.7.1.63","volume":"7","author":"S. T. Mc Cormick","year":"1995","unstructured":"Mc Cormick, S. T., & Pinedo, M. L. (1995). Scheduling n independent jobs on m uniform machines with both flowtime and makespan objectives: a parametric analysis. ORSA Journal on Computing, 7(1), 63\u201377.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"175_CR54","doi-asserted-by":"crossref","first-page":"37","DOI":"10.15807\/jorsj.24.37","volume":"24","author":"S. Miyazaki","year":"1981","unstructured":"Miyazaki, S. (1981). One machine scheduling problem with dual criteria. Journal of the Operational Research Society of Japan, 24(1), 37\u201350.","journal-title":"Journal of the Operational Research Society of Japan"},{"key":"175_CR55","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/S0925-5273(98)00166-2","volume":"60\u201361","author":"S. Mohri","year":"1999","unstructured":"Mohri, S., Masuda, T., & Ishii, H. (1999). Bi-criteria scheduling problem on three identical parallel machines. International Journal of Production Economics, 60\u201361, 529\u2013536.","journal-title":"International Journal of Production Economics"},{"key":"175_CR56","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1038\/sj\/jors\/0460606","volume":"46","author":"A. Nagar","year":"1995","unstructured":"Nagar, A., Heragu, S. S., & Haddock, J. (1995). A branch-and-bound approach for a two-machine flowshop scheduling problem. Journal of the Operational Research Society, 46, 721\u2013734.","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"175_CR57","doi-asserted-by":"crossref","first-page":"464","DOI":"10.1287\/mnsc.32.4.464","volume":"32","author":"R. T. Nelson","year":"1986","unstructured":"Nelson, R. T., Sarin, R. K., & Daniels, R. L. (1986). Scheduling with multiple performance measures: the one-machine case. Management Science, 32(4), 464\u2013479.","journal-title":"Management Science"},{"key":"175_CR58","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/0377-2217(95)00275-8","volume":"95","author":"V. R. Neppalli","year":"1996","unstructured":"Neppalli, V. R., Chen, C. L., & Gupta, J. N. D. (1996). Genetic algorithms for the two-stage bicriteria flowshop problem. European Journal of Operational Research, 95, 356\u2013373.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"175_CR59","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1080\/00207548808947840","volume":"26","author":"P. S. Ow","year":"1988","unstructured":"Ow, P. S., & Morton, T. E. (1988). Filtered beam search in scheduling. International Journal of Production Research, 26(1), 35\u201362.","journal-title":"International Journal of Production Research"},{"issue":"2","key":"175_CR60","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1287\/mnsc.35.2.177","volume":"35","author":"P. S. Ow","year":"1989","unstructured":"Ow, P. S., & Morton, T. E. (1989). The single machine early\/tardy problem. Management Science, 35(2), 177\u2013190.","journal-title":"Management Science"},{"key":"175_CR61","volume-title":"Computational complexity","author":"C. H. Papadimitriou","year":"1995","unstructured":"Papadimitriou, C. H. (1995). Computational complexity. Reading: Addison\u2013Wesley."},{"key":"175_CR62","volume-title":"Scheduling\u2014theory, algorithms, and systems","author":"M. Pinedo","year":"1995","unstructured":"Pinedo, M. (1995). Scheduling\u2014theory, algorithms, and systems. Englewood Cliffs: Prentice Hall."},{"issue":"9","key":"175_CR63","doi-asserted-by":"publisher","first-page":"871","DOI":"10.1057\/palgrave.jors.0430903","volume":"43","author":"C. Rajendran","year":"1992","unstructured":"Rajendran, C. (1992). Two-stage flowshop scheduling problem with bicriteria. Journal of the Operational Research Society, 43(9), 871\u2013884.","journal-title":"Journal of the Operational Research Society"},{"issue":"1\u20132","key":"175_CR64","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0360-8352(97)00087-9","volume":"33","author":"A. J. Ruiz-Torres","year":"1997","unstructured":"Ruiz-Torres, A. J., Enscore, E. E., & Barton, R. R. (1997). Simulated annealing heuristics for the average flow-time and the number of tardy jobs bi-criteria identical parallel machine problem. Computers and Industrial Engineering, 33(1\u20132), 257\u2013260.","journal-title":"Computers and Industrial Engineering"},{"key":"175_CR65","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0925-5273(99)00050-X","volume":"65","author":"S. C. Sarin","year":"2000","unstructured":"Sarin, S. C., & Hariharan, R. (2000). A two machine bicriteria scheduling problem. International Journal of Production Economics, 65, 125\u2013139.","journal-title":"International Journal of Production Economics"},{"key":"175_CR66","first-page":"222","volume-title":"Lecture notes in economics and mathematical systems","author":"P. Serafini","year":"1986","unstructured":"Serafini, P. (1986). Some considerations about computational complexity for multi objective combinatorial problems. In Lecture notes in economics and mathematical systems (vol.\u00a0294, pp.\u00a0222\u2013232). Heidelberg: Springer."},{"key":"175_CR67","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/S0377-2217(97)00338-X","volume":"107","author":"F. S. Serifoglu","year":"1998","unstructured":"Serifoglu, F. S., & Ulusoy, G. (1998). A bicriteria two-machine permutation flowshop problem. European Journal of Operational Research, 107, 414\u2013430.","journal-title":"European Journal of Operational Research"},{"key":"175_CR68","doi-asserted-by":"crossref","unstructured":"Simon, J. (1977). On the difference between the one and the many. In Proceedings ICALP 1977, Lecture Notes in Computer Sciences (vol.\u00a052, pp.\u00a0480\u2013491).","DOI":"10.1007\/3-540-08342-1_37"},{"issue":"1","key":"175_CR69","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W. E. Smith","year":"1956","unstructured":"Smith, W. E. (1956). Various optimizers for single-stage production. Naval Research Logistics Quarterly, 3(1), 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"2","key":"175_CR70","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1002\/nav.3800310214","volume":"31","author":"P. S. Sundararaghavan","year":"1984","unstructured":"Sundararaghavan, P. S., & Ahmed, M. U. (1984). Minimizing the sum of absolute lateness in single-machine and multimachine scheduling. Naval Research Logistics Quarterly, 31(2), 325\u2013333.","journal-title":"Naval Research Logistics Quarterly"},{"key":"175_CR71","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/1520-6750(199303)40:2<229::AID-NAV3220400207>3.0.CO;2-R","volume":"40","author":"W. Szwarc","year":"1993","unstructured":"Szwarc, W. (1993). Adjacent orderings in single machine scheduling with earliness and tardiness penalties. Naval Research Logistics, 40, 229\u2013243.","journal-title":"Naval Research Logistics"},{"key":"175_CR72","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\u00a0edn.). Berlin: Springer.","edition":"2"},{"issue":"4","key":"175_CR73","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1016\/S0305-0548(02)00021-7","volume":"30","author":"V. T\u2019kindt","year":"2003","unstructured":"T\u2019kindt, V., Gupta, J. N. D., & Billaut, J.-C. (2003). Two-machine flowshop scheduling problem with a secondary criterion. Computers and Operations Research, 30(4), 505\u2013526.","journal-title":"Computers and Operations Research"},{"issue":"1","key":"175_CR74","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10288-005-0063-0","volume":"3","author":"V. T\u2019kindt","year":"2005","unstructured":"T\u2019kindt, V., Bouibede-Hocine, K., & Esswein, C. (2005a). Counting and enumeration complexity with application to multicriteria scheduling. 4OR, 3(1), 1\u201321.","journal-title":"4OR"},{"key":"175_CR75","unstructured":"T\u2019kindt, V., Della Croce, F., & Bouquard, J.-L. (2005b). Enumeration of Pareto optima for a flowshop scheduling problem with two criteria. Submitted for publication, p.\u00a024."},{"issue":"1","key":"175_CR76","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0305-0548(97)00038-5","volume":"25","author":"A. Tuzikov","year":"1998","unstructured":"Tuzikov, A., Makhaniok, M., & Manner, R. (1998). Bicriterion scheduling of identical processing time jobs by uniform processors. Computers and Operations Research, 25(1), 31\u201335.","journal-title":"Computers and Operations Research"},{"key":"175_CR77","unstructured":"Vadhan, S. (1995). The complexity of counting. Thesis of Bachelor of Arts, Harvard College, Cambridge (USA), p.\u00a058."},{"key":"175_CR78","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L. G. Valiant","year":"1979","unstructured":"Valiant, L. G. (1979a). The complexity of computing the permanent. Theoretical Computer Science, 8, 189\u2013201.","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"175_CR79","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L. G. Valiant","year":"1979","unstructured":"Valiant, L. G. (1979b). The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3), 410\u2013421.","journal-title":"SIAM Journal on Computing"},{"key":"175_CR80","unstructured":"VandenAkker, M., Hoogeveen, H., & VandeVelde, S. (1998). A\u00a0combined column generation and Lagrangian relaxation algorithm for common due date scheduling. In 6th\u00a0workshop on project management and scheduling PMS\u201998, EURO, Istanbul, Turkey."},{"issue":"4","key":"175_CR81","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0377-2217(78)90043-7","volume":"2","author":"L. VanWassenhove","year":"1978","unstructured":"VanWassenhove, L., & Gelders, L. F. (1978). Four solution techniques for a general one machine scheduling problem: a comparative study. European Journal of Operational Research, 2(4), 281\u2013290.","journal-title":"European Journal of Operational Research"},{"issue":"9","key":"175_CR82","doi-asserted-by":"publisher","first-page":"2543","DOI":"10.1080\/002075498192689","volume":"36","author":"S. Webster","year":"1998","unstructured":"Webster, S., Job, P. D., & Gupta, A. (1998). A genetic algorithm for scheduling job families on a single machine with arbitrary earliness\/tardiness penalties and an unrestricted common due date. International Journal of Production Research, 36(9), 2543\u20132551.","journal-title":"International Journal of Production Research"},{"key":"175_CR83","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0377-2217(91)90078-A","volume":"52","author":"C. A. Yano","year":"1991","unstructured":"Yano, C. A., & Kim, Y. D. (1991). Algorithms for a class of single machine weighted tardiness and earliness problems. European Journal of Operational Research, 52, 167\u2013178.","journal-title":"European Journal of Operational Research"},{"key":"175_CR84","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1016\/S0305-0548(98)00106-3","volume":"26","author":"W. C. Yeh","year":"1999","unstructured":"Yeh, W. C. (1999). A new branch-and-bound approach for the n\/2\/flowshop\/aF+bCmax flowshop scheduling problem. Computers and Operations Research, 26, 1293\u20131310.","journal-title":"Computers and Operations Research"},{"issue":"5","key":"175_CR85","doi-asserted-by":"crossref","first-page":"1449","DOI":"10.1080\/00207549508930220","volume":"33","author":"S. H. Zegordi","year":"1995","unstructured":"Zegordi, S. H., Itoh, K., & Enkawa, T. (1995). A knowledgeable simulated annealing scheme for the early\/tardy flow shop scheduling problem. International Journal of Production Research, 33(5), 1449\u20131466.","journal-title":"International Journal of Production Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0175-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-007-0175-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0175-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0175-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T15:31:05Z","timestamp":1652887865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-007-0175-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,21]]},"references-count":85,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["175"],"URL":"https:\/\/doi.org\/10.1007\/s10479-007-0175-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4,21]]},"assertion":[{"value":"21 April 2007","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}