{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T03:31:01Z","timestamp":1725593461012},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642219993"},{"type":"electronic","value":"9783642220005"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22000-5_27","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T05:21:59Z","timestamp":1309152119000},"page":"251-260","source":"Crossref","is-referenced-by-count":0,"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":"27_CR1","volume-title":"Network Flows","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.B.: Network Flows. Prencice-Hall, Englewood Clifs (1993)"},{"key":"27_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":"27_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":"27_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":"27_CR5","doi-asserted-by":"crossref","unstructured":"Bennington, G.E., Mc Ginnis, L.F.: A critique of project planning with constrained resources. Elmaghraby, 1-28 (1973)","DOI":"10.1007\/978-3-642-80784-8_1"},{"key":"27_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":"27_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":"27_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":"27_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":"27_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":"27_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":"27_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":"27_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":"27_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":"27_CR15","volume-title":"Scheduling a production line to minimize maximum tardiness, RR 43, Management Science Research Project","author":"J.R. Jackson","year":"1955","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":"27_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":"27_CR17","doi-asserted-by":"crossref","unstructured":"Kerschenbaum, A., Van Slyke, R.: Computing minimum spanning trees efficiently w. In: Proc. 25-th, Ann. Conf. of the ACM, pp. 518\u2013527 (1972)","DOI":"10.1145\/800193.569966"},{"key":"27_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":"27_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":"27_CR20","unstructured":"Neuman von, J.: Theory of Self - Reproducing Automata. University of Illinois Press, US (1966)"},{"key":"27_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":"27_CR22","unstructured":"Piech, H.: Scheduling with applying rough sets theory. Czestochowa University of technology, Monographs 149 (2008)"},{"key":"27_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":"27_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":"27_CR25","doi-asserted-by":"publisher","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":"27_CR26","first-page":"29","volume-title":"Task oriented domains: Designing Convention for Automated Negotiation among Computers","author":"J. Rosenschein","year":"1994","unstructured":"Rosenschein, J., Zlotkin, G.: Task oriented domains: Designing Convention for Automated Negotiation among Computers, pp. 29\u201352. MIT Press, Cambridge (1994)"},{"key":"27_CR27","first-page":"54","volume-title":"The strategy of Conflict","author":"T. Schelling","year":"1963","unstructured":"Schelling, T.: The strategy of Conflict, pp. 54\u201380. Oxford University Press, New York (1963)"},{"key":"27_CR28","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3487.001.0001","volume-title":"Heterogeneous Agent Systems","author":"V.S. Subrahmanian","year":"2000","unstructured":"Subrahmanian, V.S., Bonatti, P., Dix, J.: Heterogeneous Agent Systems. MIT Press, Cambridge (2000)"},{"key":"27_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/BFb0057662","volume-title":"Mobile Agents","author":"M.T. Tu","year":"1998","unstructured":"Tu, M.T., Griffel, F., Merz, M., Lamersdorf, W.: A Plug-in Architecture Providing Dynamic Negotiation Capabilities for Mobile Agents. In: Rothermel, K., Hohl, F. (eds.) MA 1998. LNCS, vol.\u00a01477, pp. 222\u2013236. Springer, Heidelberg (1998)"},{"key":"27_CR30","unstructured":"Vasudevan, S., Kurose, J., Towsley, D.: Design and Analysis of a Leader Election. In: 12-th IEEE International Conference of Network Protocols, ICNP, Los Alamitos, pp. 350\u2013360 (2004)"},{"key":"27_CR31","volume-title":"An Introduction to Multiagent Systems","author":"M. Wooldridge","year":"2002","unstructured":"Wooldridge, M.: An Introduction to Multiagent Systems. John Wiley and Sons, Chichester (2002)"},{"key":"27_CR32","unstructured":"Zeleznikow, J., Bellucci, E.: Family - Winner: Integrating game theory and heuristic to provide negotiation support. In: 16-th International Conference on Legal Knowledge Based System, Amsterdam, pp. 21\u201330 (2003)"},{"key":"27_CR33","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s10796-005-4807-3","volume":"7","author":"C.N. Ziegler","year":"2005","unstructured":"Ziegler, C.N., Lausen, G.: Propagation models for trust and distrust in social networks. Information System Frontiers\u00a07, 337\u2013358 (2005)","journal-title":"Information System Frontiers"}],"container-title":["Lecture Notes in Computer Science","Agent and Multi-Agent Systems: Technologies and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22000-5_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,20]],"date-time":"2020-06-20T20:59:07Z","timestamp":1592686747000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22000-5_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642219993","9783642220005"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22000-5_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}