A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem
Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and m...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Sen, Tapan [verfasserIn] Gupta, Sushil K. [verfasserIn] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2011 |
|---|
| Übergeordnetes Werk: |
Enthalten in: IIE Transactions - [Erscheinungsort nicht ermittelbar] : Proquest, 1982, 15(1983), 1 vom: 01. März, Seite 84-88 |
|---|---|
| Übergeordnetes Werk: |
number:1 ; volume:15 ; year:1983 ; month:03 ; day:01 ; pages:84-88 |
| Links: |
|---|
| DOI / URN: |
10.1080/05695558308974617 |
|---|
| Katalog-ID: |
NLEJ253089778 |
|---|
| LEADER | 01000naa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ253089778 | ||
| 003 | DE-627 | ||
| 005 | 20231206144147.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 231206s2011 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.1080/05695558308974617 |2 doi | |
| 035 | |a (DE-627)NLEJ253089778 | ||
| 035 | |a (TFO)780431053 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rda | ||
| 041 | |a eng | ||
| 100 | 1 | |a Sen, Tapan |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem |
| 264 | 1 | |c 2011 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a Computermedien |b c |2 rdamedia | ||
| 338 | |a Online-Ressource |b cr |2 rdacarrier | ||
| 520 | |a Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported. | ||
| 700 | 1 | |a Gupta, Sushil K. |e verfasserin |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t IIE Transactions |d [Erscheinungsort nicht ermittelbar] : Proquest, 1982 |g 15(1983), 1 vom: 01. März, Seite 84-88 |h Online-Ressource |w (DE-627)NLEJ253087325 |w (DE-600)2012372-3 |w (DE-576)111170230 |x 1545-8830 |7 nnns |
| 773 | 1 | 8 | |g number:1 |g volume:15 |g year:1983 |g month:03 |g day:01 |g pages:84-88 |
| 856 | 4 | 0 | |u https://www.tib.eu/de/suchen/id/tandf%3A93838b353d4c50da36401c0ab0669556c215c4ff |x Digitalisierung |z Deutschlandweit zugänglich |
| 912 | |a ZDB-1-TFO | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |e 1 |d 15 |j 1983 |c 3 |b 01 |h 84-88 | ||
| author_variant |
t s ts s k g sk skg |
|---|---|
| matchkey_str |
article:15458830:2011----::bacadonpoeueoovairtros |
| hierarchy_sort_str |
2011 |
| publishDate |
2011 |
| allfields |
10.1080/05695558308974617 doi (DE-627)NLEJ253089778 (TFO)780431053 DE-627 ger DE-627 rda eng Sen, Tapan verfasserin aut A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported. Gupta, Sushil K. verfasserin aut Enthalten in IIE Transactions [Erscheinungsort nicht ermittelbar] : Proquest, 1982 15(1983), 1 vom: 01. März, Seite 84-88 Online-Ressource (DE-627)NLEJ253087325 (DE-600)2012372-3 (DE-576)111170230 1545-8830 nnns number:1 volume:15 year:1983 month:03 day:01 pages:84-88 https://www.tib.eu/de/suchen/id/tandf%3A93838b353d4c50da36401c0ab0669556c215c4ff Digitalisierung Deutschlandweit zugänglich ZDB-1-TFO GBV_NL_ARTICLE AR 1 15 1983 3 01 84-88 |
| spelling |
10.1080/05695558308974617 doi (DE-627)NLEJ253089778 (TFO)780431053 DE-627 ger DE-627 rda eng Sen, Tapan verfasserin aut A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported. Gupta, Sushil K. verfasserin aut Enthalten in IIE Transactions [Erscheinungsort nicht ermittelbar] : Proquest, 1982 15(1983), 1 vom: 01. März, Seite 84-88 Online-Ressource (DE-627)NLEJ253087325 (DE-600)2012372-3 (DE-576)111170230 1545-8830 nnns number:1 volume:15 year:1983 month:03 day:01 pages:84-88 https://www.tib.eu/de/suchen/id/tandf%3A93838b353d4c50da36401c0ab0669556c215c4ff Digitalisierung Deutschlandweit zugänglich ZDB-1-TFO GBV_NL_ARTICLE AR 1 15 1983 3 01 84-88 |
| allfields_unstemmed |
10.1080/05695558308974617 doi (DE-627)NLEJ253089778 (TFO)780431053 DE-627 ger DE-627 rda eng Sen, Tapan verfasserin aut A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported. Gupta, Sushil K. verfasserin aut Enthalten in IIE Transactions [Erscheinungsort nicht ermittelbar] : Proquest, 1982 15(1983), 1 vom: 01. März, Seite 84-88 Online-Ressource (DE-627)NLEJ253087325 (DE-600)2012372-3 (DE-576)111170230 1545-8830 nnns number:1 volume:15 year:1983 month:03 day:01 pages:84-88 https://www.tib.eu/de/suchen/id/tandf%3A93838b353d4c50da36401c0ab0669556c215c4ff Digitalisierung Deutschlandweit zugänglich ZDB-1-TFO GBV_NL_ARTICLE AR 1 15 1983 3 01 84-88 |
| allfieldsGer |
10.1080/05695558308974617 doi (DE-627)NLEJ253089778 (TFO)780431053 DE-627 ger DE-627 rda eng Sen, Tapan verfasserin aut A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported. Gupta, Sushil K. verfasserin aut Enthalten in IIE Transactions [Erscheinungsort nicht ermittelbar] : Proquest, 1982 15(1983), 1 vom: 01. März, Seite 84-88 Online-Ressource (DE-627)NLEJ253087325 (DE-600)2012372-3 (DE-576)111170230 1545-8830 nnns number:1 volume:15 year:1983 month:03 day:01 pages:84-88 https://www.tib.eu/de/suchen/id/tandf%3A93838b353d4c50da36401c0ab0669556c215c4ff Digitalisierung Deutschlandweit zugänglich ZDB-1-TFO GBV_NL_ARTICLE AR 1 15 1983 3 01 84-88 |
| allfieldsSound |
10.1080/05695558308974617 doi (DE-627)NLEJ253089778 (TFO)780431053 DE-627 ger DE-627 rda eng Sen, Tapan verfasserin aut A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem 2011 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported. Gupta, Sushil K. verfasserin aut Enthalten in IIE Transactions [Erscheinungsort nicht ermittelbar] : Proquest, 1982 15(1983), 1 vom: 01. März, Seite 84-88 Online-Ressource (DE-627)NLEJ253087325 (DE-600)2012372-3 (DE-576)111170230 1545-8830 nnns number:1 volume:15 year:1983 month:03 day:01 pages:84-88 https://www.tib.eu/de/suchen/id/tandf%3A93838b353d4c50da36401c0ab0669556c215c4ff Digitalisierung Deutschlandweit zugänglich ZDB-1-TFO GBV_NL_ARTICLE AR 1 15 1983 3 01 84-88 |
| language |
English |
| source |
Enthalten in IIE Transactions 15(1983), 1 vom: 01. März, Seite 84-88 number:1 volume:15 year:1983 month:03 day:01 pages:84-88 |
| sourceStr |
Enthalten in IIE Transactions 15(1983), 1 vom: 01. März, Seite 84-88 number:1 volume:15 year:1983 month:03 day:01 pages:84-88 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| isfreeaccess_bool |
false |
| container_title |
IIE Transactions |
| authorswithroles_txt_mv |
Sen, Tapan @@aut@@ Gupta, Sushil K. @@aut@@ |
| publishDateDaySort_date |
1983-03-01T00:00:00Z |
| hierarchy_top_id |
NLEJ253087325 |
| id |
NLEJ253089778 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">NLEJ253089778</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231206144147.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">231206s2011 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/05695558308974617</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ253089778</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(TFO)780431053</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sen, Tapan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gupta, Sushil K.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IIE Transactions</subfield><subfield code="d">[Erscheinungsort nicht ermittelbar] : Proquest, 1982</subfield><subfield code="g">15(1983), 1 vom: 01. März, Seite 84-88</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ253087325</subfield><subfield code="w">(DE-600)2012372-3</subfield><subfield code="w">(DE-576)111170230</subfield><subfield code="x">1545-8830</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">number:1</subfield><subfield code="g">volume:15</subfield><subfield code="g">year:1983</subfield><subfield code="g">month:03</subfield><subfield code="g">day:01</subfield><subfield code="g">pages:84-88</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.tib.eu/de/suchen/id/tandf%3A93838b353d4c50da36401c0ab0669556c215c4ff</subfield><subfield code="x">Digitalisierung</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-TFO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="e">1</subfield><subfield code="d">15</subfield><subfield code="j">1983</subfield><subfield code="c">3</subfield><subfield code="b">01</subfield><subfield code="h">84-88</subfield></datafield></record></collection>
|
| author |
Sen, Tapan |
| spellingShingle |
Sen, Tapan A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem |
| authorStr |
Sen, Tapan |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ253087325 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
NL |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1545-8830 |
| topic_title |
A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
cr |
| hierarchy_parent_title |
IIE Transactions |
| hierarchy_parent_id |
NLEJ253087325 |
| hierarchy_top_title |
IIE Transactions |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ253087325 (DE-600)2012372-3 (DE-576)111170230 |
| title |
A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem |
| ctrlnum |
(DE-627)NLEJ253089778 (TFO)780431053 |
| title_full |
A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem |
| author_sort |
Sen, Tapan |
| journal |
IIE Transactions |
| journalStr |
IIE Transactions |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2011 |
| contenttype_str_mv |
txt |
| container_start_page |
84 |
| author_browse |
Sen, Tapan Gupta, Sushil K. |
| container_volume |
15 |
| format_se |
Elektronische Aufsätze |
| author-letter |
Sen, Tapan |
| doi_str_mv |
10.1080/05695558308974617 |
| author2-role |
verfasserin |
| title_sort |
a branch-and-bound procedure to solve a bicriterion scheduling problem |
| title_auth |
A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem |
| abstract |
Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported. |
| abstractGer |
Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported. |
| abstract_unstemmed |
Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported. |
| collection_details |
ZDB-1-TFO GBV_NL_ARTICLE |
| container_issue |
1 |
| title_short |
A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem |
| url |
https://www.tib.eu/de/suchen/id/tandf%3A93838b353d4c50da36401c0ab0669556c215c4ff |
| remote_bool |
true |
| author2 |
Gupta, Sushil K. |
| author2Str |
Gupta, Sushil K. |
| ppnlink |
NLEJ253087325 |
| mediatype_str_mv |
c |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1080/05695558308974617 |
| up_date |
2024-07-05T22:51:48.478Z |
| _version_ |
1803781310752227328 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000naa a22002652 4500</leader><controlfield tag="001">NLEJ253089778</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20231206144147.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">231206s2011 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/05695558308974617</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ253089778</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(TFO)780431053</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Sen, Tapan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A Branch-and-Bound Procedure to Solve a Bicriterion Scheduling Problem</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2011</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Most scheduling research is done with one criterion; however, the real-world situations demand consideration of multicriterion problems because there are generally many costs associated with scheduling decisions. This paper considers the problem of minimizing a linear combination of flow times and max-mum tardiness of a given number of jobs on a single machine and presents a branch-and-bound technique to arrive at an optimal solution. The computational results are also reported.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gupta, Sushil K.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">IIE Transactions</subfield><subfield code="d">[Erscheinungsort nicht ermittelbar] : Proquest, 1982</subfield><subfield code="g">15(1983), 1 vom: 01. März, Seite 84-88</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ253087325</subfield><subfield code="w">(DE-600)2012372-3</subfield><subfield code="w">(DE-576)111170230</subfield><subfield code="x">1545-8830</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">number:1</subfield><subfield code="g">volume:15</subfield><subfield code="g">year:1983</subfield><subfield code="g">month:03</subfield><subfield code="g">day:01</subfield><subfield code="g">pages:84-88</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://www.tib.eu/de/suchen/id/tandf%3A93838b353d4c50da36401c0ab0669556c215c4ff</subfield><subfield code="x">Digitalisierung</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-TFO</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_NL_ARTICLE</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="e">1</subfield><subfield code="d">15</subfield><subfield code="j">1983</subfield><subfield code="c">3</subfield><subfield code="b">01</subfield><subfield code="h">84-88</subfield></datafield></record></collection>
|
| score |
7.3999805 |