{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:04:36Z","timestamp":1758823476639},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,10,5]],"date-time":"2011-10-05T00:00:00Z","timestamp":1317772800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10951-011-0256-7","type":"journal-article","created":{"date-parts":[[2011,10,5]],"date-time":"2011-10-05T01:05:44Z","timestamp":1317776744000},"page":"369-383","source":"Crossref","is-referenced-by-count":10,"title":["Multi-criteria scheduling: an agent-based approach for expert knowledge integration"],"prefix":"10.1007","volume":"16","author":[{"given":"Christian","family":"Grimme","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Lepping","sequence":"additional","affiliation":[]},{"given":"Uwe","family":"Schwiegelshohn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,10,5]]},"reference":[{"key":"256_CR1","first-page":"773","volume-title":"IEEE congress on evolutionary computation","author":"T. Bartz-Beielstein","year":"2005","unstructured":"Bartz-Beielstein, T., Lasarczyk, C. W. G., & Preuss, M. (2005). Sequential parameter optimization. In IEEE congress on evolutionary computation (Vol.\u00a01, pp.\u00a0773\u2013780). New York: IEEE Press."},{"key":"256_CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0377-2217(93)90236-G","volume":"70","author":"C. L. Chen","year":"1993","unstructured":"Chen, C. L., & Bulfin, R. L. (1993). Complexity of single machine multi-criteria scheduling problems. European Journal of Operational Research, 70, 115\u2013125.","journal-title":"European Journal of Operational Research"},{"key":"256_CR3","series-title":"Genetic and evolutionary computation","volume-title":"Evolutionary algorithms for solving multi-objective problems","author":"C. A. C. Coello","year":"2007","unstructured":"Coello, C. A. C., Lamont, G. B., & Veldhuizen, D. A. V. (2007). Evolutionary algorithms for solving multi-objective problems. Genetic and evolutionary computation (2nd ed.). New York: Springer.","edition":"2"},{"issue":"23","key":"256_CR4","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1080\/00401706.1981.10487680","volume":"4","author":"W. J. Conover","year":"1981","unstructured":"Conover, W. J., Johnson, M. E., & Johnson, M. M. (1981). A\u00a0comparative study of tests for homogeneity of variances, with applications to the outer continental shelf bidding data. Technometrics, 4(23), 351\u2013361.","journal-title":"Technometrics"},{"key":"256_CR5","series-title":"Wiley-interscience series in systems and optimization","volume-title":"Multi-objective optimization using evolutionary algorithms","author":"K. Deb","year":"2001","unstructured":"Deb, K. (2001). Multi-objective optimization using evolutionary algorithms. Wiley-interscience series in systems and optimization (1st ed.). New York: Wiley.","edition":"1"},{"key":"256_CR6","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1007\/3-540-45356-3_83","volume-title":"Proceedings of the conference on parallel problem solving from nature","author":"K. Deb","year":"2000","unstructured":"Deb, K., Agrawal, S., Pratab, A., & Meyarivan, T. (2000). A fast elitist non-dominated sorting genetic algorithm for multi-objective optimization: NSGA-II. In M. Schoenauer et al. (Eds.), Lecture notes in computer science: Vol.\u00a01917. Proceedings of the conference on parallel problem solving from nature (pp.\u00a0849\u2013858). Berlin: Springer."},{"key":"256_CR7","first-page":"4138","volume-title":"IEEE congress on evolutionary computation","author":"J. Durillo","year":"2010","unstructured":"Durillo, J., Nebro, A., & Alba, E. (2010). The jMetal framework for multi-objective optimization: design and architecture. In IEEE congress on evolutionary computation (Vol.\u00a05467, pp.\u00a04138\u20134325). Barcelona, Spain. Berlin: Springer."},{"key":"256_CR8","first-page":"219","volume-title":"Introduction to scheduling","author":"P. F. Dutot","year":"2010","unstructured":"Dutot, P. F., Rzadca, K., Saule, E., & Trystram, D. (2010). Multi-objective scheduling. In Introduction to scheduling, (1st ed.). (pp.\u00a0219\u2013251). Boca Raton: CRC Press.","edition":"1"},{"key":"256_CR9","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/978-3-540-31880-4_5","volume-title":"Proceedings of the international conference on evolutionary multi-criterion optimization","author":"M. Emmerich","year":"2005","unstructured":"Emmerich, M., Beume, N., & Naujoks, B. (2005). An EMO algorithm using the hypervolume measure as selection criterion. In Proceedings of the international conference on evolutionary multi-criterion optimization (pp.\u00a062\u201376)."},{"issue":"353","key":"256_CR10","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1080\/01621459.1976.10481517","volume":"71","author":"M. A. Fligner","year":"1976","unstructured":"Fligner, M. A., & Killeen, T. J. (1976). Distribution-free two-sample tests for scale. Journal of the American Statistical Association, 71(353), 210\u2013213.","journal-title":"Journal of the American Statistical Association"},{"issue":"3","key":"256_CR11","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","volume":"25","author":"M. R. Garey","year":"1978","unstructured":"Garey, M. R., & Johnson, D. S. (1978). \u201cStrong\u201d NP-completeness results: motivation, examples, and implications. Journal of the ACM, 25(3), 499\u2013508.","journal-title":"Journal of the ACM"},{"key":"256_CR12","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. L. Graham","year":"1969","unstructured":"Graham, R. L. (1969). Bounds on multiprocessing timing anomalies. SIAM Journal on Applied Mathematics, 17, 416\u2013429.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"256_CR13","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"5","author":"R. L. Graham","year":"1979","unstructured":"Graham, R. L., Lawer, E. L., Lenstra, J. K., & Kan, A. H. G. R. (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":"256_CR14","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-540-70928-2_6","volume-title":"Proceedings of the international conference on evolutionary multi-criterion optimization","author":"C. Grimme","year":"2007","unstructured":"Grimme, C., & Lepping, J. (2007). Designing multi-objective variation operators using a predator\u2013prey approach. In Lecture notes in computer science: Vol.\u00a04403. Proceedings of the international conference on evolutionary multi-criterion optimization (pp.\u00a021\u201335). Berlin: Springer."},{"key":"256_CR15","first-page":"805","volume-title":"Proceedings of the genetic and evolutionary computation conference","author":"C. Grimme","year":"2007","unstructured":"Grimme, C., Lepping, J., & Papaspyrou, A. (2007). Exploring the behavior of building blocks for multi-objective variation operator design using predator\u2013prey dynamics. In D. Thierens et al. (Eds.), Proceedings of the genetic and evolutionary computation conference (pp.\u00a0805\u2013812). New York: ACM."},{"issue":"3","key":"256_CR16","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2004.07.011","volume":"167","author":"H. Hoogeveen","year":"2005","unstructured":"Hoogeveen, H. (2005). Multicriteria scheduling. European Journal of Operational Research, 167(3), 592\u2013623.","journal-title":"European Journal of Operational Research"},{"key":"256_CR17","unstructured":"Jackson, J. R. (1955). Scheduling a production line to minimize maximum tardiness (Management Science Research Project, Research Report 43), University of California, Los Angeles."},{"issue":"2","key":"256_CR18","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1162\/106365600568167","volume":"8","author":"J. Knowles","year":"2000","unstructured":"Knowles, J., & Corne, D. (2000). Approximating the nondominated front using the Pareto archived evolution strategies. Evolutionary Computation, 8(2), 149\u2013172.","journal-title":"Evolutionary Computation"},{"key":"256_CR19","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1007\/978-3-540-70928-2_57","volume-title":"Proceedings of the 4th international conference on evolutionary multi-criterion optimization","author":"J. Knowles","year":"2007","unstructured":"Knowles, J., & Corne, D. (2007). Quantifying the effects of objective space dimension in evolutionary multiobjective optimization. In Proceedings of the 4th international conference on evolutionary multi-criterion optimization (pp.\u00a0757\u2013771). Berlin: Springer."},{"key":"256_CR20","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/BFb0056867","volume-title":"Proceedings of the conference on parallel problem solving from nature","author":"M. Laumanns","year":"1998","unstructured":"Laumanns, M., Rudolph, G., & Schwefel, H. P. (1998). A\u00a0spatial predator\u2013prey approach to multi-objective optimization: a preliminary study. In T. B\u00e4ck et al. (Eds.), Proceedings of the conference on parallel problem solving from nature (pp.\u00a0241\u2013249). Berlin: Springer."},{"key":"256_CR21","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1287\/mnsc.15.1.102","volume":"15","author":"J. M. Moore","year":"1968","unstructured":"Moore, J. M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15, 102\u2013109.","journal-title":"Management Science"},{"key":"256_CR22","volume-title":"Scheduling: theory, algorithms, and systems","author":"M. Pinedo","year":"2009","unstructured":"Pinedo, M. (2009). Scheduling: theory, algorithms, and systems (3rd ed.). Berlin: Springer.","edition":"3"},{"key":"256_CR23","volume-title":"Evolution and optimum seeking","author":"H. P. Schwefel","year":"1995","unstructured":"Schwefel, H. P. (1995). Evolution and optimum seeking (1st ed.). New York: Wiley.","edition":"1"},{"key":"256_CR24","doi-asserted-by":"crossref","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, 59\u201366.","journal-title":"Naval Research Logistics Quarterly"},{"key":"256_CR25","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0167-6377(97)00025-4","volume":"21","author":"C. Stein","year":"1997","unstructured":"Stein, C., & Wein, J. (1997). On the existence of schedules that are near-optimal for both makespan and total weighted completion time. Operations Research Letters, 21, 115\u2013122.","journal-title":"Operations Research Letters"},{"issue":"1\u20134","key":"256_CR26","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0360-8352(93)90266-Z","volume":"25","author":"G. A. S\u00fcer","year":"1993","unstructured":"S\u00fcer, G. A., B\u00e1ez, E., & Czajkiewicz, Z. (1993). Minimizing the number of tardy jobs in identical machine scheduling. Computers & Industrial Engineering, 25(1\u20134), 243\u2013246.","journal-title":"Computers & Industrial Engineering"},{"key":"256_CR27","volume-title":"Multicriteria scheduling. Theory, models and algorithms","author":"V. T\u2019kindt","year":"2006","unstructured":"T\u2019kindt, V., & Billaut, J. C. (2006). Multicriteria scheduling. Theory, models and algorithms (2nd ed.). Berlin: Springer.","edition":"2"},{"issue":"1","key":"256_CR28","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10951-007-0034-8","volume":"11","author":"M. Akker van\u00a0den","year":"2008","unstructured":"van\u00a0den Akker, M., & Hoogeveen, H. (2008). Minimizing the number of late jobs in a stochastic setting using a chance constraint. Journal of Scheduling, 11(1), 59\u201369.","journal-title":"Journal of Scheduling"},{"issue":"4","key":"256_CR29","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/0377-2217(78)90043-7","volume":"2","author":"L. N. Wassenhove van","year":"1980","unstructured":"van Wassenhove, L. N., & Gelders, F. (1980). Solving a bicriterion scheduling problem. European Journal of Operational Research, 2(4), 281\u2013290.","journal-title":"European Journal of Operational Research"},{"key":"256_CR30","volume-title":"Optimality in parametric systems","author":"T. L. Vincent","year":"1981","unstructured":"Vincent, T. L., & Grantham, W. J. (1981). Optimality in parametric systems (1st ed.). New York: Wiley.","edition":"1"},{"key":"256_CR31","unstructured":"Zitzler, E. (1999). Evolutionary algorithms for multiobjective optimization: methods and applications. Ph.D. thesis, ETH Z\u00fcrich."},{"issue":"4","key":"256_CR32","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E. Zitzler","year":"1999","unstructured":"Zitzler, E., & Thiele, L. (1999). Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach. IEEE Transactions on Evolutionary Computation, 3(4), 257\u2013271.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"256_CR33","unstructured":"Zitzler, E., Laumanns, M., & Thiele, L. (2001). SPEA2: Improving the strength Pareto evolutionary algorithm (Technical Report 103). Computer Engineering and Communication Networks Lab (TIK), ETH Z\u00fcrich."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0256-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-011-0256-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-011-0256-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T09:39:46Z","timestamp":1559468386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-011-0256-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10,5]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["256"],"URL":"https:\/\/doi.org\/10.1007\/s10951-011-0256-7","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10,5]]}}}