Scheduling: Control-Based Theory and Polynomial-Time Algorithms:
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
Boston, MA
Springer US
2000
|
| Schriftenreihe: | Applied Optimization
43 |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Beschreibung: | This book presents a first attempt to systematically collect, classify and solve various continuous-time scheduling problems. The classes of problems distinguish scheduling by the number of machines and products, production constraints and performance measures. Although such classes are usually considered to be a prerogative of only combinatorial scheduling literature, the scheduling methodology suggested in this book is based on two mathematical tools - optimal control and combinatorics. Generally considered as belonging to two totally different areas of research and application, these seemingly irreconcilable tools can be integrated in a unique solution approach with the advantages of both. This new approach provides the possibility of developing effective polynomial-time algorithms to solve the generic scheduling problems. This book is aimed at a student audience - final year undergraduates as well as master and Ph.D. students, primarily in Operations Research, Management, Industrial Engineering and Control Systems. Indeed, some of the material in the book has formed part of the content of undergraduate and graduate courses taught at the Industrial Engineering Department of Tel-Aviv University, the Logistics Department of Bar-Ilan University and the Technology Management Department of Rolon Center for Technological Education, Israel. The book is also useful for practicing engineers interested in planning, scheduling and optimization methods. Since the book addresses the theory and design of computer-based scheduling algorithms, applied mathematicians and computer software specialists engaged in developing scheduling software for industrial engineering and management problems will find that the methods developed here can be embedded very efficiently in large applications |
| Beschreibung: | 1 Online-Ressource (X, 397 p) |
| ISBN: | 9781461546757 9781461371168 |
| ISSN: | 1384-6485 |
| DOI: | 10.1007/978-1-4615-4675-7 |
Internformat
MARC
| LEADER | 00000nmm a2200000zcb4500 | ||
|---|---|---|---|
| 001 | BV042420889 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 150317s2000 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461546757 |c Online |9 978-1-4615-4675-7 | ||
| 020 | |a 9781461371168 |c Print |9 978-1-4613-7116-8 | ||
| 024 | 7 | |a 10.1007/978-1-4615-4675-7 |2 doi | |
| 035 | |a (OCoLC)864735581 | ||
| 035 | |a (DE-599)BVBBV042420889 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-384 |a DE-703 |a DE-91 |a DE-634 | ||
| 082 | 0 | |a 658.5 |2 23 | |
| 084 | |a MAT 000 |2 stub | ||
| 100 | 1 | |a Kogan, Konstantin |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Scheduling: Control-Based Theory and Polynomial-Time Algorithms |c by Konstantin Kogan, Eugene Khmelnitsky |
| 264 | 1 | |a Boston, MA |b Springer US |c 2000 | |
| 300 | |a 1 Online-Ressource (X, 397 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 490 | 0 | |a Applied Optimization |v 43 |x 1384-6485 | |
| 500 | |a This book presents a first attempt to systematically collect, classify and solve various continuous-time scheduling problems. The classes of problems distinguish scheduling by the number of machines and products, production constraints and performance measures. Although such classes are usually considered to be a prerogative of only combinatorial scheduling literature, the scheduling methodology suggested in this book is based on two mathematical tools - optimal control and combinatorics. Generally considered as belonging to two totally different areas of research and application, these seemingly irreconcilable tools can be integrated in a unique solution approach with the advantages of both. This new approach provides the possibility of developing effective polynomial-time algorithms to solve the generic scheduling problems. This book is aimed at a student audience - final year undergraduates as well as master and Ph.D. students, primarily in Operations Research, Management, Industrial Engineering and Control Systems. Indeed, some of the material in the book has formed part of the content of undergraduate and graduate courses taught at the Industrial Engineering Department of Tel-Aviv University, the Logistics Department of Bar-Ilan University and the Technology Management Department of Rolon Center for Technological Education, Israel. The book is also useful for practicing engineers interested in planning, scheduling and optimization methods. Since the book addresses the theory and design of computer-based scheduling algorithms, applied mathematicians and computer software specialists engaged in developing scheduling software for industrial engineering and management problems will find that the methods developed here can be embedded very efficiently in large applications | ||
| 650 | 4 | |a Economics | |
| 650 | 4 | |a Systems theory | |
| 650 | 4 | |a Mechanical engineering | |
| 650 | 4 | |a Computer engineering | |
| 650 | 4 | |a Economics/Management Science | |
| 650 | 4 | |a Production/Logistics/Supply Chain Management | |
| 650 | 4 | |a Electrical Engineering | |
| 650 | 4 | |a Systems Theory, Control | |
| 650 | 4 | |a Mechanical Engineering | |
| 650 | 4 | |a Management | |
| 650 | 4 | |a Wirtschaft | |
| 650 | 0 | 7 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |D s |
| 689 | 0 | |8 1\p |5 DE-604 | |
| 700 | 1 | |a Khmelnitsky, Eugene |e Sonstige |4 oth | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4615-4675-7 |x Verlag |3 Volltext |
| 912 | |a ZDB-2-SMA |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SMA_Archive | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-027856306 | ||
| 883 | 1 | |8 1\p |a cgwrk |d 20201028 |q DE-101 |u https://d-nb.info/provenance/plan#cgwrk | |
Datensatz im Suchindex
| _version_ | 1804153093344985088 |
|---|---|
| any_adam_object | |
| author | Kogan, Konstantin |
| author_facet | Kogan, Konstantin |
| author_role | aut |
| author_sort | Kogan, Konstantin |
| author_variant | k k kk |
| building | Verbundindex |
| bvnumber | BV042420889 |
| classification_tum | MAT 000 |
| collection | ZDB-2-SMA ZDB-2-BAE |
| ctrlnum | (OCoLC)864735581 (DE-599)BVBBV042420889 |
| dewey-full | 658.5 |
| dewey-hundreds | 600 - Technology (Applied sciences) |
| dewey-ones | 658 - General management |
| dewey-raw | 658.5 |
| dewey-search | 658.5 |
| dewey-sort | 3658.5 |
| dewey-tens | 650 - Management and auxiliary services |
| discipline | Mathematik Wirtschaftswissenschaften |
| doi_str_mv | 10.1007/978-1-4615-4675-7 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03694nmm a2200553zcb4500</leader><controlfield tag="001">BV042420889</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">150317s2000 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461546757</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-4615-4675-7</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461371168</subfield><subfield code="c">Print</subfield><subfield code="9">978-1-4613-7116-8</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4615-4675-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)864735581</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV042420889</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">aacr</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-384</subfield><subfield code="a">DE-703</subfield><subfield code="a">DE-91</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">658.5</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">MAT 000</subfield><subfield code="2">stub</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Kogan, Konstantin</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling: Control-Based Theory and Polynomial-Time Algorithms</subfield><subfield code="c">by Konstantin Kogan, Eugene Khmelnitsky</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Boston, MA</subfield><subfield code="b">Springer US</subfield><subfield code="c">2000</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 397 p)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">Applied Optimization</subfield><subfield code="v">43</subfield><subfield code="x">1384-6485</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">This book presents a first attempt to systematically collect, classify and solve various continuous-time scheduling problems. The classes of problems distinguish scheduling by the number of machines and products, production constraints and performance measures. Although such classes are usually considered to be a prerogative of only combinatorial scheduling literature, the scheduling methodology suggested in this book is based on two mathematical tools - optimal control and combinatorics. Generally considered as belonging to two totally different areas of research and application, these seemingly irreconcilable tools can be integrated in a unique solution approach with the advantages of both. This new approach provides the possibility of developing effective polynomial-time algorithms to solve the generic scheduling problems. This book is aimed at a student audience - final year undergraduates as well as master and Ph.D. students, primarily in Operations Research, Management, Industrial Engineering and Control Systems. Indeed, some of the material in the book has formed part of the content of undergraduate and graduate courses taught at the Industrial Engineering Department of Tel-Aviv University, the Logistics Department of Bar-Ilan University and the Technology Management Department of Rolon Center for Technological Education, Israel. The book is also useful for practicing engineers interested in planning, scheduling and optimization methods. Since the book addresses the theory and design of computer-based scheduling algorithms, applied mathematicians and computer software specialists engaged in developing scheduling software for industrial engineering and management problems will find that the methods developed here can be embedded very efficiently in large applications</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Economics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Systems theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mechanical engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Economics/Management Science</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production/Logistics/Supply Chain Management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Electrical Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Systems Theory, Control</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mechanical Engineering</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Wirtschaft</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Reihenfolgeproblem</subfield><subfield code="0">(DE-588)4242167-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="8">1\p</subfield><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Khmelnitsky, Eugene</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4615-4675-7</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SMA</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SMA_Archive</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-027856306</subfield></datafield><datafield tag="883" ind1="1" ind2=" "><subfield code="8">1\p</subfield><subfield code="a">cgwrk</subfield><subfield code="d">20201028</subfield><subfield code="q">DE-101</subfield><subfield code="u">https://d-nb.info/provenance/plan#cgwrk</subfield></datafield></record></collection> |
| id | DE-604.BV042420889 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-10T01:21:07Z |
| institution | BVB |
| isbn | 9781461546757 9781461371168 |
| issn | 1384-6485 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-027856306 |
| oclc_num | 864735581 |
| open_access_boolean | |
| owner | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| owner_facet | DE-384 DE-703 DE-91 DE-BY-TUM DE-634 |
| physical | 1 Online-Ressource (X, 397 p) |
| psigel | ZDB-2-SMA ZDB-2-BAE ZDB-2-SMA_Archive |
| publishDate | 2000 |
| publishDateSearch | 2000 |
| publishDateSort | 2000 |
| publisher | Springer US |
| record_format | marc |
| series2 | Applied Optimization |
| spelling | Kogan, Konstantin Verfasser aut Scheduling: Control-Based Theory and Polynomial-Time Algorithms by Konstantin Kogan, Eugene Khmelnitsky Boston, MA Springer US 2000 1 Online-Ressource (X, 397 p) txt rdacontent c rdamedia cr rdacarrier Applied Optimization 43 1384-6485 This book presents a first attempt to systematically collect, classify and solve various continuous-time scheduling problems. The classes of problems distinguish scheduling by the number of machines and products, production constraints and performance measures. Although such classes are usually considered to be a prerogative of only combinatorial scheduling literature, the scheduling methodology suggested in this book is based on two mathematical tools - optimal control and combinatorics. Generally considered as belonging to two totally different areas of research and application, these seemingly irreconcilable tools can be integrated in a unique solution approach with the advantages of both. This new approach provides the possibility of developing effective polynomial-time algorithms to solve the generic scheduling problems. This book is aimed at a student audience - final year undergraduates as well as master and Ph.D. students, primarily in Operations Research, Management, Industrial Engineering and Control Systems. Indeed, some of the material in the book has formed part of the content of undergraduate and graduate courses taught at the Industrial Engineering Department of Tel-Aviv University, the Logistics Department of Bar-Ilan University and the Technology Management Department of Rolon Center for Technological Education, Israel. The book is also useful for practicing engineers interested in planning, scheduling and optimization methods. Since the book addresses the theory and design of computer-based scheduling algorithms, applied mathematicians and computer software specialists engaged in developing scheduling software for industrial engineering and management problems will find that the methods developed here can be embedded very efficiently in large applications Economics Systems theory Mechanical engineering Computer engineering Economics/Management Science Production/Logistics/Supply Chain Management Electrical Engineering Systems Theory, Control Mechanical Engineering Management Wirtschaft Reihenfolgeproblem (DE-588)4242167-6 gnd rswk-swf Reihenfolgeproblem (DE-588)4242167-6 s 1\p DE-604 Khmelnitsky, Eugene Sonstige oth https://doi.org/10.1007/978-1-4615-4675-7 Verlag Volltext 1\p cgwrk 20201028 DE-101 https://d-nb.info/provenance/plan#cgwrk |
| spellingShingle | Kogan, Konstantin Scheduling: Control-Based Theory and Polynomial-Time Algorithms Economics Systems theory Mechanical engineering Computer engineering Economics/Management Science Production/Logistics/Supply Chain Management Electrical Engineering Systems Theory, Control Mechanical Engineering Management Wirtschaft Reihenfolgeproblem (DE-588)4242167-6 gnd |
| subject_GND | (DE-588)4242167-6 |
| title | Scheduling: Control-Based Theory and Polynomial-Time Algorithms |
| title_auth | Scheduling: Control-Based Theory and Polynomial-Time Algorithms |
| title_exact_search | Scheduling: Control-Based Theory and Polynomial-Time Algorithms |
| title_full | Scheduling: Control-Based Theory and Polynomial-Time Algorithms by Konstantin Kogan, Eugene Khmelnitsky |
| title_fullStr | Scheduling: Control-Based Theory and Polynomial-Time Algorithms by Konstantin Kogan, Eugene Khmelnitsky |
| title_full_unstemmed | Scheduling: Control-Based Theory and Polynomial-Time Algorithms by Konstantin Kogan, Eugene Khmelnitsky |
| title_short | Scheduling: Control-Based Theory and Polynomial-Time Algorithms |
| title_sort | scheduling control based theory and polynomial time algorithms |
| topic | Economics Systems theory Mechanical engineering Computer engineering Economics/Management Science Production/Logistics/Supply Chain Management Electrical Engineering Systems Theory, Control Mechanical Engineering Management Wirtschaft Reihenfolgeproblem (DE-588)4242167-6 gnd |
| topic_facet | Economics Systems theory Mechanical engineering Computer engineering Economics/Management Science Production/Logistics/Supply Chain Management Electrical Engineering Systems Theory, Control Mechanical Engineering Management Wirtschaft Reihenfolgeproblem |
| url | https://doi.org/10.1007/978-1-4615-4675-7 |
| work_keys_str_mv | AT kogankonstantin schedulingcontrolbasedtheoryandpolynomialtimealgorithms AT khmelnitskyeugene schedulingcontrolbasedtheoryandpolynomialtimealgorithms |