@article{frangioni_multi-exchange_2004,
	title = {A {Multi}-{Exchange} {Neighborhood} for {Minimum} {Makespan} {Parallel} {Machine} {Scheduling} {Problems}},
	volume = {8},
	issn = {1382-6905, 1573-2886},
	url = {http://link.springer.com/article/10.1023/B%3AJOCO.0000031420.05971.29},
	doi = {10.1023/B:JOCO.0000031420.05971.29},
	language = {en},
	urldate = {2014-05-17TZ},
	journal = {Journal of Combinatorial Optimization},
	author = {Frangioni, A. and Necciari, E. and Scutellà, M. G.},
	year = {2004},
	keywords = {Convex and Discrete Geometry, Mathematical Modeling and Industrial Mathematics, Operation Research/Decision Theory, Theory of Computation, approximations/heuristic: multi-exchange neighborhood, combinatorics, flow algorithms: disjoint cycle computation, networks/graphs, optimization, production/scheduling},
	pages = {195--220}
}

{"_id":"J7fFvF8MJQWTyJFri","bibbaseid":"frangioni-necciari-scutell-amultiexchangeneighborhoodforminimummakespanparallelmachineschedulingproblems-2004","downloads":0,"creationDate":"2016-12-19T20:50:58.351Z","title":"A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems","author_short":["Frangioni, A.","Necciari, E.","Scutellà, M. G."],"year":2004,"bibtype":"article","biburl":"http://bibbase.org/zotero/verschae","bibdata":{"bibtype":"article","type":"article","title":"A Multi-Exchange Neighborhood for Minimum Makespan Parallel Machine Scheduling Problems","volume":"8","issn":"1382-6905, 1573-2886","url":"http://link.springer.com/article/10.1023/B%3AJOCO.0000031420.05971.29","doi":"10.1023/B:JOCO.0000031420.05971.29","language":"en","urldate":"2014-05-17TZ","journal":"Journal of Combinatorial Optimization","author":[{"propositions":[],"lastnames":["Frangioni"],"firstnames":["A."],"suffixes":[]},{"propositions":[],"lastnames":["Necciari"],"firstnames":["E."],"suffixes":[]},{"propositions":[],"lastnames":["Scutellà"],"firstnames":["M.","G."],"suffixes":[]}],"year":"2004","keywords":"Convex and Discrete Geometry, Mathematical Modeling and Industrial Mathematics, Operation Research/Decision Theory, Theory of Computation, approximations/heuristic: multi-exchange neighborhood, combinatorics, flow algorithms: disjoint cycle computation, networks/graphs, optimization, production/scheduling","pages":"195--220","bibtex":"@article{frangioni_multi-exchange_2004,\n\ttitle = {A {Multi}-{Exchange} {Neighborhood} for {Minimum} {Makespan} {Parallel} {Machine} {Scheduling} {Problems}},\n\tvolume = {8},\n\tissn = {1382-6905, 1573-2886},\n\turl = {http://link.springer.com/article/10.1023/B%3AJOCO.0000031420.05971.29},\n\tdoi = {10.1023/B:JOCO.0000031420.05971.29},\n\tlanguage = {en},\n\turldate = {2014-05-17TZ},\n\tjournal = {Journal of Combinatorial Optimization},\n\tauthor = {Frangioni, A. and Necciari, E. and Scutellà, M. G.},\n\tyear = {2004},\n\tkeywords = {Convex and Discrete Geometry, Mathematical Modeling and Industrial Mathematics, Operation Research/Decision Theory, Theory of Computation, approximations/heuristic: multi-exchange neighborhood, combinatorics, flow algorithms: disjoint cycle computation, networks/graphs, optimization, production/scheduling},\n\tpages = {195--220}\n}\n\n","author_short":["Frangioni, A.","Necciari, E.","Scutellà, M. G."],"key":"frangioni_multi-exchange_2004","id":"frangioni_multi-exchange_2004","bibbaseid":"frangioni-necciari-scutell-amultiexchangeneighborhoodforminimummakespanparallelmachineschedulingproblems-2004","role":"author","urls":{"Paper":"http://link.springer.com/article/10.1023/B%3AJOCO.0000031420.05971.29"},"keyword":["Convex and Discrete Geometry","Mathematical Modeling and Industrial Mathematics","Operation Research/Decision Theory","Theory of Computation","approximations/heuristic: multi-exchange neighborhood","combinatorics","flow algorithms: disjoint cycle computation","networks/graphs","optimization","production/scheduling"],"downloads":0,"html":""},"search_terms":["multi","exchange","neighborhood","minimum","makespan","parallel","machine","scheduling","problems","frangioni","necciari","scutellà"],"keywords":["convex and discrete geometry","mathematical modeling and industrial mathematics","operation research/decision theory","theory of computation","approximations/heuristic: multi-exchange neighborhood","combinatorics","flow algorithms: disjoint cycle computation","networks/graphs","optimization","production/scheduling"],"authorIDs":[],"dataSources":["TJDe75XCoX4GYYsBX"]}