Decomposition Methods for Complex Factory Scheduling Problems:
The factory scheduling problem, that of allocating machines to competing jobs in manufacturing facilities to optimize or at least improve system performance, is encountered in many different manufacturing environments. Given the competitive pressures faced by many companies in today's rapidly c...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | English |
| Veröffentlicht: |
New York, NY
Springer US
1997
|
| Ausgabe: | 1st ed. 1997 |
| Schlagworte: | |
| Online-Zugang: | BTU01 Volltext |
| Zusammenfassung: | The factory scheduling problem, that of allocating machines to competing jobs in manufacturing facilities to optimize or at least improve system performance, is encountered in many different manufacturing environments. Given the competitive pressures faced by many companies in today's rapidly changing global markets, improved factory scheduling should contribute to a flrm's success. However, even though an extensive body of research on scheduling models has been in existence for at least the last three decades, most of the techniques currently in use in industry are relatively simplistic, and have not made use of this body of knowledge. In this book we describe a systematic, long-term research effort aimed at developing effective scheduling algorithms for complex manufacturing facilities. We focus on a speciflc industrial context, that of semiconductor manufacturing, and try to combine knowledge of the physical production system with the methods and results of scheduling research to develop effective approximate solution procedures for these problems. The class of methods we suggest, decomposition methods, constitute a broad family of heuristic approaches to large, NP-hard scheduling problems which can be applied in other environments in addition to those studied in this book |
| Beschreibung: | 1 Online-Ressource (X, 215 p) |
| ISBN: | 9781461563297 |
| DOI: | 10.1007/978-1-4615-6329-7 |
Internformat
MARC
| LEADER | 00000nmm a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV046873304 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 200828s1997 |||| o||u| ||||||eng d | ||
| 020 | |a 9781461563297 |9 978-1-4615-6329-7 | ||
| 024 | 7 | |a 10.1007/978-1-4615-6329-7 |2 doi | |
| 035 | |a (ZDB-2-SBE)978-1-4615-6329-7 | ||
| 035 | |a (OCoLC)903194911 | ||
| 035 | |a (DE-599)BVBBV046873304 | ||
| 040 | |a DE-604 |b ger |e aacr | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-634 | ||
| 082 | 0 | |a 658.5 |2 23 | |
| 084 | |a QH 400 |0 (DE-625)141571: |2 rvk | ||
| 084 | |a SK 970 |0 (DE-625)143276: |2 rvk | ||
| 100 | 1 | |a Ovacik, Irfan M. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Decomposition Methods for Complex Factory Scheduling Problems |c by Irfan M. Ovacik, Reha Uzsoy |
| 250 | |a 1st ed. 1997 | ||
| 264 | 1 | |a New York, NY |b Springer US |c 1997 | |
| 300 | |a 1 Online-Ressource (X, 215 p) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 520 | |a The factory scheduling problem, that of allocating machines to competing jobs in manufacturing facilities to optimize or at least improve system performance, is encountered in many different manufacturing environments. Given the competitive pressures faced by many companies in today's rapidly changing global markets, improved factory scheduling should contribute to a flrm's success. However, even though an extensive body of research on scheduling models has been in existence for at least the last three decades, most of the techniques currently in use in industry are relatively simplistic, and have not made use of this body of knowledge. In this book we describe a systematic, long-term research effort aimed at developing effective scheduling algorithms for complex manufacturing facilities. We focus on a speciflc industrial context, that of semiconductor manufacturing, and try to combine knowledge of the physical production system with the methods and results of scheduling research to develop effective approximate solution procedures for these problems. The class of methods we suggest, decomposition methods, constitute a broad family of heuristic approaches to large, NP-hard scheduling problems which can be applied in other environments in addition to those studied in this book | ||
| 650 | 4 | |a Operations Management | |
| 650 | 4 | |a Operations Research/Decision Theory | |
| 650 | 4 | |a Mathematical Modeling and Industrial Mathematics | |
| 650 | 4 | |a Production management | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Decision making | |
| 650 | 4 | |a Mathematical models | |
| 650 | 0 | 7 | |a Dekomposition |0 (DE-588)4149030-7 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Halbleiterindustrie |0 (DE-588)4158803-4 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Fertigungsplanung |0 (DE-588)4113545-3 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Operations Research |0 (DE-588)4043586-6 |2 gnd |9 rswk-swf |
| 650 | 0 | 7 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |2 gnd |9 rswk-swf |
| 689 | 0 | 0 | |a Halbleiterindustrie |0 (DE-588)4158803-4 |D s |
| 689 | 0 | 1 | |a Fertigungsplanung |0 (DE-588)4113545-3 |D s |
| 689 | 0 | 2 | |a Reihenfolgeproblem |0 (DE-588)4242167-6 |D s |
| 689 | 0 | 3 | |a Dekomposition |0 (DE-588)4149030-7 |D s |
| 689 | 0 | |5 DE-604 | |
| 689 | 1 | 0 | |a Operations Research |0 (DE-588)4043586-6 |D s |
| 689 | 1 | 1 | |a Dekomposition |0 (DE-588)4149030-7 |D s |
| 689 | 1 | |5 DE-604 | |
| 700 | 1 | |a Uzsoy, Reha |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9780792398356 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461379065 |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781461563303 |
| 856 | 4 | 0 | |u https://doi.org/10.1007/978-1-4615-6329-7 |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-2-SBE |a ZDB-2-BAE | ||
| 940 | 1 | |q ZDB-2-SBE_Archiv | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-032283436 | ||
| 966 | e | |u https://doi.org/10.1007/978-1-4615-6329-7 |l BTU01 |p ZDB-2-SBE |q ZDB-2-SBE_Archiv |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1804181723294990336 |
|---|---|
| adam_txt | |
| any_adam_object | |
| any_adam_object_boolean | |
| author | Ovacik, Irfan M. Uzsoy, Reha |
| author_facet | Ovacik, Irfan M. Uzsoy, Reha |
| author_role | aut aut |
| author_sort | Ovacik, Irfan M. |
| author_variant | i m o im imo r u ru |
| building | Verbundindex |
| bvnumber | BV046873304 |
| classification_rvk | QH 400 SK 970 |
| collection | ZDB-2-SBE ZDB-2-BAE |
| ctrlnum | (ZDB-2-SBE)978-1-4615-6329-7 (OCoLC)903194911 (DE-599)BVBBV046873304 |
| 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 |
| discipline_str_mv | Mathematik Wirtschaftswissenschaften |
| doi_str_mv | 10.1007/978-1-4615-6329-7 |
| edition | 1st ed. 1997 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>03857nmm a2200673zc 4500</leader><controlfield tag="001">BV046873304</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">200828s1997 |||| o||u| ||||||eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781461563297</subfield><subfield code="9">978-1-4615-6329-7</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/978-1-4615-6329-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-2-SBE)978-1-4615-6329-7</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)903194911</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV046873304</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-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">QH 400</subfield><subfield code="0">(DE-625)141571:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">SK 970</subfield><subfield code="0">(DE-625)143276:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ovacik, Irfan M.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Decomposition Methods for Complex Factory Scheduling Problems</subfield><subfield code="c">by Irfan M. Ovacik, Reha Uzsoy</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed. 1997</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">New York, NY</subfield><subfield code="b">Springer US</subfield><subfield code="c">1997</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (X, 215 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="520" ind1=" " ind2=" "><subfield code="a">The factory scheduling problem, that of allocating machines to competing jobs in manufacturing facilities to optimize or at least improve system performance, is encountered in many different manufacturing environments. Given the competitive pressures faced by many companies in today's rapidly changing global markets, improved factory scheduling should contribute to a flrm's success. However, even though an extensive body of research on scheduling models has been in existence for at least the last three decades, most of the techniques currently in use in industry are relatively simplistic, and have not made use of this body of knowledge. In this book we describe a systematic, long-term research effort aimed at developing effective scheduling algorithms for complex manufacturing facilities. We focus on a speciflc industrial context, that of semiconductor manufacturing, and try to combine knowledge of the physical production system with the methods and results of scheduling research to develop effective approximate solution procedures for these problems. The class of methods we suggest, decomposition methods, constitute a broad family of heuristic approaches to large, NP-hard scheduling problems which can be applied in other environments in addition to those studied in this book</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations Management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations Research/Decision Theory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical Modeling and Industrial Mathematics</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Decision making</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Mathematical models</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Halbleiterindustrie</subfield><subfield code="0">(DE-588)4158803-4</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Fertigungsplanung</subfield><subfield code="0">(DE-588)4113545-3</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</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">Halbleiterindustrie</subfield><subfield code="0">(DE-588)4158803-4</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Fertigungsplanung</subfield><subfield code="0">(DE-588)4113545-3</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="2"><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="3"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="689" ind1="1" ind2="0"><subfield code="a">Operations Research</subfield><subfield code="0">(DE-588)4043586-6</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2="1"><subfield code="a">Dekomposition</subfield><subfield code="0">(DE-588)4149030-7</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="1" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Uzsoy, Reha</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9780792398356</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781461379065</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781461563303</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1007/978-1-4615-6329-7</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-2-SBE</subfield><subfield code="a">ZDB-2-BAE</subfield></datafield><datafield tag="940" ind1="1" ind2=" "><subfield code="q">ZDB-2-SBE_Archiv</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032283436</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1007/978-1-4615-6329-7</subfield><subfield code="l">BTU01</subfield><subfield code="p">ZDB-2-SBE</subfield><subfield code="q">ZDB-2-SBE_Archiv</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV046873304 |
| illustrated | Not Illustrated |
| index_date | 2024-07-03T15:15:39Z |
| indexdate | 2024-07-10T08:56:11Z |
| institution | BVB |
| isbn | 9781461563297 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032283436 |
| oclc_num | 903194911 |
| open_access_boolean | |
| owner | DE-634 |
| owner_facet | DE-634 |
| physical | 1 Online-Ressource (X, 215 p) |
| psigel | ZDB-2-SBE ZDB-2-BAE ZDB-2-SBE_Archiv ZDB-2-SBE ZDB-2-SBE_Archiv |
| publishDate | 1997 |
| publishDateSearch | 1997 |
| publishDateSort | 1997 |
| publisher | Springer US |
| record_format | marc |
| spelling | Ovacik, Irfan M. Verfasser aut Decomposition Methods for Complex Factory Scheduling Problems by Irfan M. Ovacik, Reha Uzsoy 1st ed. 1997 New York, NY Springer US 1997 1 Online-Ressource (X, 215 p) txt rdacontent c rdamedia cr rdacarrier The factory scheduling problem, that of allocating machines to competing jobs in manufacturing facilities to optimize or at least improve system performance, is encountered in many different manufacturing environments. Given the competitive pressures faced by many companies in today's rapidly changing global markets, improved factory scheduling should contribute to a flrm's success. However, even though an extensive body of research on scheduling models has been in existence for at least the last three decades, most of the techniques currently in use in industry are relatively simplistic, and have not made use of this body of knowledge. In this book we describe a systematic, long-term research effort aimed at developing effective scheduling algorithms for complex manufacturing facilities. We focus on a speciflc industrial context, that of semiconductor manufacturing, and try to combine knowledge of the physical production system with the methods and results of scheduling research to develop effective approximate solution procedures for these problems. The class of methods we suggest, decomposition methods, constitute a broad family of heuristic approaches to large, NP-hard scheduling problems which can be applied in other environments in addition to those studied in this book Operations Management Operations Research/Decision Theory Mathematical Modeling and Industrial Mathematics Production management Operations research Decision making Mathematical models Dekomposition (DE-588)4149030-7 gnd rswk-swf Halbleiterindustrie (DE-588)4158803-4 gnd rswk-swf Fertigungsplanung (DE-588)4113545-3 gnd rswk-swf Operations Research (DE-588)4043586-6 gnd rswk-swf Reihenfolgeproblem (DE-588)4242167-6 gnd rswk-swf Halbleiterindustrie (DE-588)4158803-4 s Fertigungsplanung (DE-588)4113545-3 s Reihenfolgeproblem (DE-588)4242167-6 s Dekomposition (DE-588)4149030-7 s DE-604 Operations Research (DE-588)4043586-6 s Uzsoy, Reha aut Erscheint auch als Druck-Ausgabe 9780792398356 Erscheint auch als Druck-Ausgabe 9781461379065 Erscheint auch als Druck-Ausgabe 9781461563303 https://doi.org/10.1007/978-1-4615-6329-7 Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Ovacik, Irfan M. Uzsoy, Reha Decomposition Methods for Complex Factory Scheduling Problems Operations Management Operations Research/Decision Theory Mathematical Modeling and Industrial Mathematics Production management Operations research Decision making Mathematical models Dekomposition (DE-588)4149030-7 gnd Halbleiterindustrie (DE-588)4158803-4 gnd Fertigungsplanung (DE-588)4113545-3 gnd Operations Research (DE-588)4043586-6 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd |
| subject_GND | (DE-588)4149030-7 (DE-588)4158803-4 (DE-588)4113545-3 (DE-588)4043586-6 (DE-588)4242167-6 |
| title | Decomposition Methods for Complex Factory Scheduling Problems |
| title_auth | Decomposition Methods for Complex Factory Scheduling Problems |
| title_exact_search | Decomposition Methods for Complex Factory Scheduling Problems |
| title_exact_search_txtP | Decomposition Methods for Complex Factory Scheduling Problems |
| title_full | Decomposition Methods for Complex Factory Scheduling Problems by Irfan M. Ovacik, Reha Uzsoy |
| title_fullStr | Decomposition Methods for Complex Factory Scheduling Problems by Irfan M. Ovacik, Reha Uzsoy |
| title_full_unstemmed | Decomposition Methods for Complex Factory Scheduling Problems by Irfan M. Ovacik, Reha Uzsoy |
| title_short | Decomposition Methods for Complex Factory Scheduling Problems |
| title_sort | decomposition methods for complex factory scheduling problems |
| topic | Operations Management Operations Research/Decision Theory Mathematical Modeling and Industrial Mathematics Production management Operations research Decision making Mathematical models Dekomposition (DE-588)4149030-7 gnd Halbleiterindustrie (DE-588)4158803-4 gnd Fertigungsplanung (DE-588)4113545-3 gnd Operations Research (DE-588)4043586-6 gnd Reihenfolgeproblem (DE-588)4242167-6 gnd |
| topic_facet | Operations Management Operations Research/Decision Theory Mathematical Modeling and Industrial Mathematics Production management Operations research Decision making Mathematical models Dekomposition Halbleiterindustrie Fertigungsplanung Operations Research Reihenfolgeproblem |
| url | https://doi.org/10.1007/978-1-4615-6329-7 |
| work_keys_str_mv | AT ovacikirfanm decompositionmethodsforcomplexfactoryschedulingproblems AT uzsoyreha decompositionmethodsforcomplexfactoryschedulingproblems |