Parallel branch-and-bound methods for the Job-shop scheduling problem:
Abstract: "Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class of NP-complete problems. The only successful approach has been Branch-and-Bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
København
1994
|
| Schriftenreihe: | Datalogisk Institut <København>: DIKU-Rapport
1994,35 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class of NP-complete problems. The only successful approach has been Branch-and-Bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions for the JSS problem, but with limited success. Even with recent methods, it is still not possible to solve problems substantially larger than 10 machines and 10 jobs. In the current study we focus on parallel methods for solving JSS problems. We implement two different parallel Branch-and-Bound algorithms for JSS on a 16-processor MEIKO Computing Surface with Intel i860 processors and perform extensive computational testing using classical publicly available benchmark problems. The code of one of the implementations is based on a similar parallel code for Quadratic Assignment Problems. Results are reported for different branching rules proposed in the literature." |
| Beschreibung: | 26 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010678613 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960325s1994 |||| 00||| engod | ||
| 035 | |a (OCoLC)38561903 | ||
| 035 | |a (DE-599)BVBBV010678613 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Perregaard, Michael |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel branch-and-bound methods for the Job-shop scheduling problem |c Michael Perregaard and Jens Clausen |
| 264 | 1 | |a København |c 1994 | |
| 300 | |a 26 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1994,35 | |
| 520 | 3 | |a Abstract: "Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class of NP-complete problems. The only successful approach has been Branch-and-Bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions for the JSS problem, but with limited success. Even with recent methods, it is still not possible to solve problems substantially larger than 10 machines and 10 jobs. In the current study we focus on parallel methods for solving JSS problems. We implement two different parallel Branch-and-Bound algorithms for JSS on a 16-processor MEIKO Computing Surface with Intel i860 processors and perform extensive computational testing using classical publicly available benchmark problems. The code of one of the implementations is based on a similar parallel code for Quadratic Assignment Problems. Results are reported for different branching rules proposed in the literature." | |
| 650 | 4 | |a Branch and bound algorithms | |
| 650 | 4 | |a NP-complete problems | |
| 650 | 4 | |a Operations research | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 700 | 1 | |a Clausen, Jens |e Verfasser |4 aut | |
| 830 | 0 | |a Datalogisk Institut <København>: DIKU-Rapport |v 1994,35 |w (DE-604)BV010011493 |9 1994,35 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007126920 | ||
Datensatz im Suchindex
| _version_ | 1804125156107354112 |
|---|---|
| any_adam_object | |
| author | Perregaard, Michael Clausen, Jens |
| author_facet | Perregaard, Michael Clausen, Jens |
| author_role | aut aut |
| author_sort | Perregaard, Michael |
| author_variant | m p mp j c jc |
| building | Verbundindex |
| bvnumber | BV010678613 |
| ctrlnum | (OCoLC)38561903 (DE-599)BVBBV010678613 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02080nam a2200337 cb4500</leader><controlfield tag="001">BV010678613</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960325s1994 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)38561903</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010678613</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Perregaard, Michael</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel branch-and-bound methods for the Job-shop scheduling problem</subfield><subfield code="c">Michael Perregaard and Jens Clausen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">København</subfield><subfield code="c">1994</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">26 S.</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">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1994,35</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class of NP-complete problems. The only successful approach has been Branch-and-Bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions for the JSS problem, but with limited success. Even with recent methods, it is still not possible to solve problems substantially larger than 10 machines and 10 jobs. In the current study we focus on parallel methods for solving JSS problems. We implement two different parallel Branch-and-Bound algorithms for JSS on a 16-processor MEIKO Computing Surface with Intel i860 processors and perform extensive computational testing using classical publicly available benchmark problems. The code of one of the implementations is based on a similar parallel code for Quadratic Assignment Problems. Results are reported for different branching rules proposed in the literature."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Branch and bound algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">NP-complete problems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operations research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Clausen, Jens</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Datalogisk Institut <København>: DIKU-Rapport</subfield><subfield code="v">1994,35</subfield><subfield code="w">(DE-604)BV010011493</subfield><subfield code="9">1994,35</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007126920</subfield></datafield></record></collection> |
| id | DE-604.BV010678613 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:57:04Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007126920 |
| oclc_num | 38561903 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 26 S. |
| publishDate | 1994 |
| publishDateSearch | 1994 |
| publishDateSort | 1994 |
| record_format | marc |
| series | Datalogisk Institut <København>: DIKU-Rapport |
| series2 | Datalogisk Institut <København>: DIKU-Rapport |
| spelling | Perregaard, Michael Verfasser aut Parallel branch-and-bound methods for the Job-shop scheduling problem Michael Perregaard and Jens Clausen København 1994 26 S. txt rdacontent n rdamedia nc rdacarrier Datalogisk Institut <København>: DIKU-Rapport 1994,35 Abstract: "Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class of NP-complete problems. The only successful approach has been Branch-and-Bound based algorithms, but such algorithms depend heavily on good bound functions. Much work has been done to identify such functions for the JSS problem, but with limited success. Even with recent methods, it is still not possible to solve problems substantially larger than 10 machines and 10 jobs. In the current study we focus on parallel methods for solving JSS problems. We implement two different parallel Branch-and-Bound algorithms for JSS on a 16-processor MEIKO Computing Surface with Intel i860 processors and perform extensive computational testing using classical publicly available benchmark problems. The code of one of the implementations is based on a similar parallel code for Quadratic Assignment Problems. Results are reported for different branching rules proposed in the literature." Branch and bound algorithms NP-complete problems Operations research Parallel processing (Electronic computers) Clausen, Jens Verfasser aut Datalogisk Institut <København>: DIKU-Rapport 1994,35 (DE-604)BV010011493 1994,35 |
| spellingShingle | Perregaard, Michael Clausen, Jens Parallel branch-and-bound methods for the Job-shop scheduling problem Datalogisk Institut <København>: DIKU-Rapport Branch and bound algorithms NP-complete problems Operations research Parallel processing (Electronic computers) |
| title | Parallel branch-and-bound methods for the Job-shop scheduling problem |
| title_auth | Parallel branch-and-bound methods for the Job-shop scheduling problem |
| title_exact_search | Parallel branch-and-bound methods for the Job-shop scheduling problem |
| title_full | Parallel branch-and-bound methods for the Job-shop scheduling problem Michael Perregaard and Jens Clausen |
| title_fullStr | Parallel branch-and-bound methods for the Job-shop scheduling problem Michael Perregaard and Jens Clausen |
| title_full_unstemmed | Parallel branch-and-bound methods for the Job-shop scheduling problem Michael Perregaard and Jens Clausen |
| title_short | Parallel branch-and-bound methods for the Job-shop scheduling problem |
| title_sort | parallel branch and bound methods for the job shop scheduling problem |
| topic | Branch and bound algorithms NP-complete problems Operations research Parallel processing (Electronic computers) |
| topic_facet | Branch and bound algorithms NP-complete problems Operations research Parallel processing (Electronic computers) |
| volume_link | (DE-604)BV010011493 |
| work_keys_str_mv | AT perregaardmichael parallelbranchandboundmethodsforthejobshopschedulingproblem AT clausenjens parallelbranchandboundmethodsforthejobshopschedulingproblem |