{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T10:09:23Z","timestamp":1725703763391},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642346446"},{"type":"electronic","value":"9783642346453"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34645-3_4","type":"book-chapter","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T15:17:40Z","timestamp":1349968660000},"page":"82-101","source":"Crossref","is-referenced-by-count":1,"title":["Sequence Automata for Researching Consensus Levels"],"prefix":"10.1007","author":[{"given":"Henryk","family":"Piech","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.B.: Network Flows. Prencice-Hall, Englewood Clifs (1993)"},{"key":"4_CR2","unstructured":"Baker, K.R., Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G.: Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constrains, TR 8028\/0, Econometric Institute, Erasmus University, Rotterdam (1980)"},{"key":"4_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/opre.26.1.111","volume":"26","author":"K.R. Baker","year":"1978","unstructured":"Baker, K.R., Schrage, L.E.: Finding an optimal sequence by dynamic programming: An extension to precedence-related tasks. Oper. Res.\u00a026, 111\u2013120 (1978)","journal-title":"Oper. Res."},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1287\/opre.17.6.941","volume":"17","author":"E. Ballas","year":"1969","unstructured":"Ballas, E.: Machine sequencing via disjunctive graphs: An implicit enumeration algorithm. Oper. Res.\u00a017, 941\u2013957 (1969)","journal-title":"Oper. Res."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Bennington, G.E., Mc Ginnis, L.F.: A critique of project planning with constrained resources. Elmaghraby, 1\u201328 (1973)","DOI":"10.1007\/978-3-642-80784-8_1"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/0166-218X(83)90012-4","volume":"5","author":"J. Blazewicz","year":"1983","unstructured":"Blazewicz, J., Lenstra, J.K., Rinnooy Kan, A.H.G.: Scheduling subject to resource constrains: Classification and complexity. Discrete Appl. Math.\u00a05, 11\u201324 (1983)","journal-title":"Discrete Appl. Math."},{"key":"4_CR7","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1137\/0205051","volume":"5","author":"D. Cheriton","year":"1976","unstructured":"Cheriton, D., Tarian, R.E.: Finding minimum spanning trees. SIAM J. Comput.\u00a05, 724\u2013742 (1976)","journal-title":"SIAM J. Comput."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/BF00288685","volume":"1","author":"E.G. Coffman","year":"1972","unstructured":"Coffman, E.G., Graham, R.L.: Optimal scheduling for processor system. Acta Inform.\u00a01, 200\u2013213 (1972)","journal-title":"Acta Inform."},{"key":"4_CR9","first-page":"215","volume":"27","author":"E.V. Denardo","year":"1979","unstructured":"Denardo, E.V., Fox, B.L.: Shortest - route methods: 1. Reaching, purring and buckeds. Oper. Res.\u00a027, 215\u2013248 (1979)","journal-title":"Oper. Res."},{"key":"4_CR10","first-page":"249","volume":"22","author":"U. Derigs","year":"1980","unstructured":"Derigs, U., Heske, A.: A computational study on some methods for solving the cardinality matching problem. Angew. Inform Jg.\u00a022, 249\u2013254 (1980)","journal-title":"Angew. Inform Jg."},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1137\/0205006","volume":"5","author":"M.L. Fredman","year":"1976","unstructured":"Fredman, M.L.: New bounds on the complexity of the shortest path problem. SIAM J. Comput.\u00a05, 83\u201389 (1976)","journal-title":"SIAM J. Comput."},{"key":"4_CR12","first-page":"221","volume":"23","author":"H. Gabow","year":"1975","unstructured":"Gabow, H.: An efficient implementation of Edmond\u2019s algorithm for maximum matching on graphs. J. AMC\u00a023, 221\u2013234 (1975)","journal-title":"J. AMC"},{"key":"4_CR13","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1287\/opre.9.6.841","volume":"9","author":"T.C. Hu","year":"1961","unstructured":"Hu, T.C.: Parallel sequencing and assembly line problems. Oper. Res.\u00a09, 841\u2013848 (1961)","journal-title":"Oper. Res."},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1002\/nav.3800030307","volume":"3","author":"J.R. Jackson","year":"1956","unstructured":"Jackson, J.R.: An extension of Johnson\u2019s results on job lot scheduling. Naval Res. Logist. Quart.\u00a03, 201\u2013203 (1956)","journal-title":"Naval Res. Logist. Quart."},{"key":"4_CR15","unstructured":"Jackson, J.R.: Scheduling a production line to minimize maximum tardiness, RR 43, Management Science Research Project, University of California, Los Angeles (1955)"},{"key":"4_CR16","volume-title":"Decision with Multiple Objectives: Preferences and value Tradeoffs","author":"R. Keeney","year":"1976","unstructured":"Keeney, R., Raiffa, H.: Decision with Multiple Objectives: Preferences and value Tradeoffs. John Wiley and Sons, NewYork (1976)"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Kerschenbaum, A., Van Slyke, R.: Computing minimum spanning trees efficiently. In: Proc. 25th, Ann. Conf. of the ACM, pp. 518\u2013527 (1972)","DOI":"10.1145\/569961.569966"},{"key":"4_CR18","volume-title":"The Traveling Salesmam Problem","author":"E.L. Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinooy Kan, A.G.H., Shmoys, D.: The Traveling Salesmam Problem. Wiley, New York (1985)"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.6.1.1","volume":"6","author":"R. McNaughton","year":"1959","unstructured":"McNaughton, R.: Scheduling with deadlines and loss functions. Management Sci.\u00a06, 1\u201312 (1959)","journal-title":"Management Sci."},{"key":"4_CR20","unstructured":"Neuman von, J.: Theory of Self - Reproducing Automata. University of Illinois Press (1966)"},{"key":"4_CR21","unstructured":"Piech, H., Ptak, A.: Use of a fuzzy strategy to create the shortest Hamiltonian cycle. In: Intern.Conf. on Fuzzy Sets and Soft Comp. in Economics and Finance, pp. 299\u2013307 (2004)"},{"key":"4_CR22","unstructured":"Piech, H.: Scheduling with applying rough sets theory. Czestochowa University of technology, Monographs\u00a0149 (2008)"},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"908","DOI":"10.1287\/opre.23.5.908","volume":"23","author":"A..H.G. Rinnoy Kan","year":"1975","unstructured":"Rinnoy Kan, A.H.G., Lageweg, B.J., Lenstra, J.K.: Minimizing total cost in one machine scheduling. Oper. Res.\u00a023, 908\u2013927 (1975)","journal-title":"Oper. Res."},{"key":"4_CR24","volume-title":"Order restricted Statistical Inference","author":"T. Robertson","year":"1998","unstructured":"Robertson, T., Wright, F.T., Dykstra, R.L.: Order restricted Statistical Inference. John Wiley and Sons, NewYork (1998)"},{"key":"4_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2500-1","volume-title":"Multicriteria Methodology for decision Aiding","author":"B. Roy","year":"1996","unstructured":"Roy, B.: Multicriteria Methodology for decision Aiding. Kluwer Academic Publishers, Dordrecht (1996)"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/321921.321934","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S.: Algorithms for scheduling independent tasks. J. ACM\u00a023, 116\u2013127 (1976)","journal-title":"J. ACM"},{"issue":"2","key":"4_CR27","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/S0305-0548(99)00095-7","volume":"28","author":"A. Sedeno-Noda","year":"2001","unstructured":"Sedeno-Noda, A., Gonzales Martin, C.: An Algorithm for the Biobjective Integer Minimum Cost Flow Problem. Computers and Operation Research\u00a028(2), 139\u2013156 (2001)","journal-title":"Computers and Operation Research"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1137\/0205005","volume":"5","author":"R. Sethi","year":"1976","unstructured":"Sethi, R.: Scheduling graphs on two processors. SIAM J. Comput.\u00a05, 73\u201382 (1976)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"4_CR29","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1016\/j.future.2005.11.002","volume":"22","author":"Z. Shi","year":"2006","unstructured":"Shi, Z., Dongarra, J.J.: Scheduling workflow applications on processors with different capabilitie. Future Generation Computer Systems\u00a022(6), 665\u2013675 (2006)","journal-title":"Future Generation Computer Systems"},{"key":"4_CR30","doi-asserted-by":"crossref","unstructured":"Sidney, J.B.: An extension of Moore\u2019s due date algorithm. Elmagraby, 393\u2013398 (1973)","DOI":"10.1007\/978-3-642-80784-8_26"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W.E. Smith","year":"1956","unstructured":"Smith, W.E.: Various optimizers for single-stage production. Naval Res. Logist. Quart.\u00a03, 59\u201366 (1956)","journal-title":"Naval Res. Logist. Quart."},{"issue":"4","key":"4_CR32","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/BF02291490","volume":"38","author":"V. Srinivasan","year":"1973","unstructured":"Srinivasan, V., Shocker, A.D.: Estimating the weights for multiple attributes in a composite criterion using pairwise judgments. Psychometrica\u00a038(4), 473\u2013493 (1973)","journal-title":"Psychometrica"},{"key":"4_CR33","unstructured":"Syslo, M.M., Deo, N., Kowalik, J.S.: Algorytmy optymalizacji dyskretnej. PWN, Warszawa (1995)"},{"key":"4_CR34","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1051\/ro\/1981150302411","volume":"15","author":"M.M. Syslo","year":"1981","unstructured":"Syslo, M.M.: Optimal constructions of event-node networks. RAIRO Rech. Oper.\u00a015, 241\u2013260 (1981)","journal-title":"RAIRO Rech. Oper."},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0041-1647(78)90102-8","volume":"12","author":"D. Vliet Van","year":"1978","unstructured":"Van Vliet, D.: Improved shortest path algorithm for transportation networks. Transportation Res.\u00a012, 7\u201320 (1978)","journal-title":"Transportation Res."},{"issue":"4","key":"4_CR36","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1016\/j.ins.2007.09.019","volume":"178","author":"X. Yang","year":"2008","unstructured":"Yang, X., Yang, J., Wu, C., Yu, D.: Dominance - based rough set approach and knowledge reductions in incomplete ordered information system. Information Sciences\u00a0178(4), 1219\u20131234 (2008)","journal-title":"Information Sciences"}],"container-title":["Lecture Notes in Computer Science","Transactions on Computational Collective Intelligence VIII"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34645-3_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:02:42Z","timestamp":1620133362000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34645-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642346446","9783642346453"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34645-3_4","relation":{},"ISSN":["0302-9743","1866-4741"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1866-4741"}],"subject":[],"published":{"date-parts":[[2012]]}}}