@article{
 title = {Best compromise solution for a new multiobjective scheduling problem},
 type = {article},
 year = {2006},
 pages = {2353-2368},
 volume = {33},
 month = {8},
 id = {9e0bb8b2-9061-3d9f-9211-fdec31321f28},
 created = {2024-03-31T02:55:40.274Z},
 file_attached = {false},
 profile_id = {cc2743c9-5fd7-3bb8-82e6-88c4edec0708},
 group_id = {69570cd6-89fc-31d4-a24b-a7ade9d4ce16},
 last_modified = {2024-03-31T02:55:40.274Z},
 read = {false},
 starred = {false},
 authored = {false},
 confirmed = {false},
 hidden = {false},
 private_publication = {false},
 bibtype = {article},
 author = {Setämaa-Kärkkäinen, Anne and Miettinen, Kaisa and Vuori, Jarkko},
 doi = {10.1016/j.cor.2005.02.006},
 journal = {Computers & Operations Research},
 number = {8}
}

{"_id":"PmS27aneFdACzim88","bibbaseid":"setmaakrkkinen-miettinen-vuori-bestcompromisesolutionforanewmultiobjectiveschedulingproblem-2006","authorIDs":[],"author_short":["Setämaa-Kärkkäinen, A.","Miettinen, K.","Vuori, J."],"bibdata":{"title":"Best compromise solution for a new multiobjective scheduling problem","type":"article","year":"2006","pages":"2353-2368","volume":"33","month":"8","id":"9e0bb8b2-9061-3d9f-9211-fdec31321f28","created":"2024-03-31T02:55:40.274Z","file_attached":false,"profile_id":"cc2743c9-5fd7-3bb8-82e6-88c4edec0708","group_id":"69570cd6-89fc-31d4-a24b-a7ade9d4ce16","last_modified":"2024-03-31T02:55:40.274Z","read":false,"starred":false,"authored":false,"confirmed":false,"hidden":false,"private_publication":false,"bibtype":"article","author":"Setämaa-Kärkkäinen, Anne and Miettinen, Kaisa and Vuori, Jarkko","doi":"10.1016/j.cor.2005.02.006","journal":"Computers & Operations Research","number":"8","bibtex":"@article{\n title = {Best compromise solution for a new multiobjective scheduling problem},\n type = {article},\n year = {2006},\n pages = {2353-2368},\n volume = {33},\n month = {8},\n id = {9e0bb8b2-9061-3d9f-9211-fdec31321f28},\n created = {2024-03-31T02:55:40.274Z},\n file_attached = {false},\n profile_id = {cc2743c9-5fd7-3bb8-82e6-88c4edec0708},\n group_id = {69570cd6-89fc-31d4-a24b-a7ade9d4ce16},\n last_modified = {2024-03-31T02:55:40.274Z},\n read = {false},\n starred = {false},\n authored = {false},\n confirmed = {false},\n hidden = {false},\n private_publication = {false},\n bibtype = {article},\n author = {Setämaa-Kärkkäinen, Anne and Miettinen, Kaisa and Vuori, Jarkko},\n doi = {10.1016/j.cor.2005.02.006},\n journal = {Computers & Operations Research},\n number = {8}\n}","author_short":["Setämaa-Kärkkäinen, A.","Miettinen, K.","Vuori, J."],"biburl":"https://bibbase.org/service/mendeley/cc2743c9-5fd7-3bb8-82e6-88c4edec0708","bibbaseid":"setmaakrkkinen-miettinen-vuori-bestcompromisesolutionforanewmultiobjectiveschedulingproblem-2006","role":"author","urls":{},"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"article","biburl":"https://bibbase.org/service/mendeley/cc2743c9-5fd7-3bb8-82e6-88c4edec0708","creationDate":"2019-09-01T07:08:12.719Z","downloads":0,"keywords":[],"search_terms":["best","compromise","solution","new","multiobjective","scheduling","problem","setämaa-kärkkäinen","miettinen","vuori"],"title":"Best compromise solution for a new multiobjective scheduling problem","year":2006,"dataSources":["MamPEtwgNq2Y7qmvi","6LdRyk2k6fRXRJm97","avuEyo66cyuXEfdWk","ya2CyA73rpZseyrZ8"]}