Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times
Abstract A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only de...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ruiz, Rubén [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2011 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© Springer-Verlag London Limited 2011 |
|---|
| Übergeordnetes Werk: |
Enthalten in: The international journal of advanced manufacturing technology - Springer-Verlag, 1985, 57(2011), 5-8 vom: 06. Mai, Seite 777-794 |
|---|---|
| Übergeordnetes Werk: |
volume:57 ; year:2011 ; number:5-8 ; day:06 ; month:05 ; pages:777-794 |
| Links: |
|---|
| DOI / URN: |
10.1007/s00170-011-3318-2 |
|---|
| Katalog-ID: |
OLC2026037639 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2026037639 | ||
| 003 | DE-627 | ||
| 005 | 20230323115937.0 | ||
| 007 | tu | ||
| 008 | 200820s2011 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s00170-011-3318-2 |2 doi | |
| 035 | |a (DE-627)OLC2026037639 | ||
| 035 | |a (DE-He213)s00170-011-3318-2-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 670 |q VZ |
| 100 | 1 | |a Ruiz, Rubén |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times |
| 264 | 1 | |c 2011 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 500 | |a © Springer-Verlag London Limited 2011 | ||
| 520 | |a Abstract A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed. | ||
| 650 | 4 | |a Scheduling | |
| 650 | 4 | |a Unrelated parallel machines | |
| 650 | 4 | |a Sequence-dependent setups | |
| 650 | 4 | |a Total completion time | |
| 650 | 4 | |a Resources | |
| 700 | 1 | |a Andrés-Romano, Carlos |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t The international journal of advanced manufacturing technology |d Springer-Verlag, 1985 |g 57(2011), 5-8 vom: 06. Mai, Seite 777-794 |w (DE-627)129185299 |w (DE-600)52651-4 |w (DE-576)014456192 |x 0268-3768 |7 nnns |
| 773 | 1 | 8 | |g volume:57 |g year:2011 |g number:5-8 |g day:06 |g month:05 |g pages:777-794 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s00170-011-3318-2 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-TEC | ||
| 912 | |a GBV_ILN_20 | ||
| 912 | |a GBV_ILN_21 | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_150 | ||
| 912 | |a GBV_ILN_2006 | ||
| 912 | |a GBV_ILN_2018 | ||
| 912 | |a GBV_ILN_2241 | ||
| 912 | |a GBV_ILN_2333 | ||
| 912 | |a GBV_ILN_4046 | ||
| 951 | |a AR | ||
| 952 | |d 57 |j 2011 |e 5-8 |b 06 |c 05 |h 777-794 | ||
| author_variant |
r r rr c a r car |
|---|---|
| matchkey_str |
article:02683768:2011----::ceuigneaeprlemciewtrsucasgalsqe |
| hierarchy_sort_str |
2011 |
| publishDate |
2011 |
| allfields |
10.1007/s00170-011-3318-2 doi (DE-627)OLC2026037639 (DE-He213)s00170-011-3318-2-p DE-627 ger DE-627 rakwb eng 670 VZ Ruiz, Rubén verfasserin aut Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag London Limited 2011 Abstract A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed. Scheduling Unrelated parallel machines Sequence-dependent setups Total completion time Resources Andrés-Romano, Carlos aut Enthalten in The international journal of advanced manufacturing technology Springer-Verlag, 1985 57(2011), 5-8 vom: 06. Mai, Seite 777-794 (DE-627)129185299 (DE-600)52651-4 (DE-576)014456192 0268-3768 nnns volume:57 year:2011 number:5-8 day:06 month:05 pages:777-794 https://doi.org/10.1007/s00170-011-3318-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC GBV_ILN_20 GBV_ILN_21 GBV_ILN_70 GBV_ILN_150 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2241 GBV_ILN_2333 GBV_ILN_4046 AR 57 2011 5-8 06 05 777-794 |
| spelling |
10.1007/s00170-011-3318-2 doi (DE-627)OLC2026037639 (DE-He213)s00170-011-3318-2-p DE-627 ger DE-627 rakwb eng 670 VZ Ruiz, Rubén verfasserin aut Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag London Limited 2011 Abstract A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed. Scheduling Unrelated parallel machines Sequence-dependent setups Total completion time Resources Andrés-Romano, Carlos aut Enthalten in The international journal of advanced manufacturing technology Springer-Verlag, 1985 57(2011), 5-8 vom: 06. Mai, Seite 777-794 (DE-627)129185299 (DE-600)52651-4 (DE-576)014456192 0268-3768 nnns volume:57 year:2011 number:5-8 day:06 month:05 pages:777-794 https://doi.org/10.1007/s00170-011-3318-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC GBV_ILN_20 GBV_ILN_21 GBV_ILN_70 GBV_ILN_150 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2241 GBV_ILN_2333 GBV_ILN_4046 AR 57 2011 5-8 06 05 777-794 |
| allfields_unstemmed |
10.1007/s00170-011-3318-2 doi (DE-627)OLC2026037639 (DE-He213)s00170-011-3318-2-p DE-627 ger DE-627 rakwb eng 670 VZ Ruiz, Rubén verfasserin aut Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag London Limited 2011 Abstract A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed. Scheduling Unrelated parallel machines Sequence-dependent setups Total completion time Resources Andrés-Romano, Carlos aut Enthalten in The international journal of advanced manufacturing technology Springer-Verlag, 1985 57(2011), 5-8 vom: 06. Mai, Seite 777-794 (DE-627)129185299 (DE-600)52651-4 (DE-576)014456192 0268-3768 nnns volume:57 year:2011 number:5-8 day:06 month:05 pages:777-794 https://doi.org/10.1007/s00170-011-3318-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC GBV_ILN_20 GBV_ILN_21 GBV_ILN_70 GBV_ILN_150 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2241 GBV_ILN_2333 GBV_ILN_4046 AR 57 2011 5-8 06 05 777-794 |
| allfieldsGer |
10.1007/s00170-011-3318-2 doi (DE-627)OLC2026037639 (DE-He213)s00170-011-3318-2-p DE-627 ger DE-627 rakwb eng 670 VZ Ruiz, Rubén verfasserin aut Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag London Limited 2011 Abstract A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed. Scheduling Unrelated parallel machines Sequence-dependent setups Total completion time Resources Andrés-Romano, Carlos aut Enthalten in The international journal of advanced manufacturing technology Springer-Verlag, 1985 57(2011), 5-8 vom: 06. Mai, Seite 777-794 (DE-627)129185299 (DE-600)52651-4 (DE-576)014456192 0268-3768 nnns volume:57 year:2011 number:5-8 day:06 month:05 pages:777-794 https://doi.org/10.1007/s00170-011-3318-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC GBV_ILN_20 GBV_ILN_21 GBV_ILN_70 GBV_ILN_150 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2241 GBV_ILN_2333 GBV_ILN_4046 AR 57 2011 5-8 06 05 777-794 |
| allfieldsSound |
10.1007/s00170-011-3318-2 doi (DE-627)OLC2026037639 (DE-He213)s00170-011-3318-2-p DE-627 ger DE-627 rakwb eng 670 VZ Ruiz, Rubén verfasserin aut Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times 2011 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer-Verlag London Limited 2011 Abstract A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed. Scheduling Unrelated parallel machines Sequence-dependent setups Total completion time Resources Andrés-Romano, Carlos aut Enthalten in The international journal of advanced manufacturing technology Springer-Verlag, 1985 57(2011), 5-8 vom: 06. Mai, Seite 777-794 (DE-627)129185299 (DE-600)52651-4 (DE-576)014456192 0268-3768 nnns volume:57 year:2011 number:5-8 day:06 month:05 pages:777-794 https://doi.org/10.1007/s00170-011-3318-2 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC GBV_ILN_20 GBV_ILN_21 GBV_ILN_70 GBV_ILN_150 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2241 GBV_ILN_2333 GBV_ILN_4046 AR 57 2011 5-8 06 05 777-794 |
| language |
English |
| source |
Enthalten in The international journal of advanced manufacturing technology 57(2011), 5-8 vom: 06. Mai, Seite 777-794 volume:57 year:2011 number:5-8 day:06 month:05 pages:777-794 |
| sourceStr |
Enthalten in The international journal of advanced manufacturing technology 57(2011), 5-8 vom: 06. Mai, Seite 777-794 volume:57 year:2011 number:5-8 day:06 month:05 pages:777-794 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Scheduling Unrelated parallel machines Sequence-dependent setups Total completion time Resources |
| dewey-raw |
670 |
| isfreeaccess_bool |
false |
| container_title |
The international journal of advanced manufacturing technology |
| authorswithroles_txt_mv |
Ruiz, Rubén @@aut@@ Andrés-Romano, Carlos @@aut@@ |
| publishDateDaySort_date |
2011-05-06T00:00:00Z |
| hierarchy_top_id |
129185299 |
| dewey-sort |
3670 |
| id |
OLC2026037639 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2026037639</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323115937.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00170-011-3318-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2026037639</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00170-011-3318-2-p</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">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">670</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ruiz, Rubén</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times</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">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag London Limited 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Unrelated parallel machines</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequence-dependent setups</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Total completion time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Resources</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Andrés-Romano, Carlos</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The international journal of advanced manufacturing technology</subfield><subfield code="d">Springer-Verlag, 1985</subfield><subfield code="g">57(2011), 5-8 vom: 06. Mai, Seite 777-794</subfield><subfield code="w">(DE-627)129185299</subfield><subfield code="w">(DE-600)52651-4</subfield><subfield code="w">(DE-576)014456192</subfield><subfield code="x">0268-3768</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:57</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:5-8</subfield><subfield code="g">day:06</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:777-794</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00170-011-3318-2</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2241</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">57</subfield><subfield code="j">2011</subfield><subfield code="e">5-8</subfield><subfield code="b">06</subfield><subfield code="c">05</subfield><subfield code="h">777-794</subfield></datafield></record></collection>
|
| author |
Ruiz, Rubén |
| spellingShingle |
Ruiz, Rubén ddc 670 misc Scheduling misc Unrelated parallel machines misc Sequence-dependent setups misc Total completion time misc Resources Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times |
| authorStr |
Ruiz, Rubén |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)129185299 |
| format |
Article |
| dewey-ones |
670 - Manufacturing |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0268-3768 |
| topic_title |
670 VZ Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times Scheduling Unrelated parallel machines Sequence-dependent setups Total completion time Resources |
| topic |
ddc 670 misc Scheduling misc Unrelated parallel machines misc Sequence-dependent setups misc Total completion time misc Resources |
| topic_unstemmed |
ddc 670 misc Scheduling misc Unrelated parallel machines misc Sequence-dependent setups misc Total completion time misc Resources |
| topic_browse |
ddc 670 misc Scheduling misc Unrelated parallel machines misc Sequence-dependent setups misc Total completion time misc Resources |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
The international journal of advanced manufacturing technology |
| hierarchy_parent_id |
129185299 |
| dewey-tens |
670 - Manufacturing |
| hierarchy_top_title |
The international journal of advanced manufacturing technology |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)129185299 (DE-600)52651-4 (DE-576)014456192 |
| title |
Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times |
| ctrlnum |
(DE-627)OLC2026037639 (DE-He213)s00170-011-3318-2-p |
| title_full |
Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times |
| author_sort |
Ruiz, Rubén |
| journal |
The international journal of advanced manufacturing technology |
| journalStr |
The international journal of advanced manufacturing technology |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
600 - Technology |
| recordtype |
marc |
| publishDateSort |
2011 |
| contenttype_str_mv |
txt |
| container_start_page |
777 |
| author_browse |
Ruiz, Rubén Andrés-Romano, Carlos |
| container_volume |
57 |
| class |
670 VZ |
| format_se |
Aufsätze |
| author-letter |
Ruiz, Rubén |
| doi_str_mv |
10.1007/s00170-011-3318-2 |
| dewey-full |
670 |
| title_sort |
scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times |
| title_auth |
Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times |
| abstract |
Abstract A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed. © Springer-Verlag London Limited 2011 |
| abstractGer |
Abstract A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed. © Springer-Verlag London Limited 2011 |
| abstract_unstemmed |
Abstract A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed. © Springer-Verlag London Limited 2011 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC GBV_ILN_20 GBV_ILN_21 GBV_ILN_70 GBV_ILN_150 GBV_ILN_2006 GBV_ILN_2018 GBV_ILN_2241 GBV_ILN_2333 GBV_ILN_4046 |
| container_issue |
5-8 |
| title_short |
Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times |
| url |
https://doi.org/10.1007/s00170-011-3318-2 |
| remote_bool |
false |
| author2 |
Andrés-Romano, Carlos |
| author2Str |
Andrés-Romano, Carlos |
| ppnlink |
129185299 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s00170-011-3318-2 |
| up_date |
2024-07-04T02:57:23.885Z |
| _version_ |
1803615568022994944 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2026037639</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230323115937.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2011 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s00170-011-3318-2</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2026037639</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s00170-011-3318-2-p</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">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">670</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ruiz, Rubén</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times</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">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer-Verlag London Limited 2011</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract A novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The new characteristic is that the amount of setup time does not only depend on the machine and job sequence but also on the amount of resources assigned, which can vary between a minimum and a maximum. The aim is to give solution to real problems arising in several industries where frequent setup operations in production lines have to be carried out. These operations are indeed setups whose length can be reduced or extended according to the amount of resources assigned to them. The objective function considered is a linear combination of total completion time and the total amount of resources assigned. We present a mixed integer program (MIP) model and some fast dispatching heuristics. We carry out careful and comprehensive statistical analyses to study what characteristics of the problem affect the MIP model performance. We also study the effectiveness of the different heuristics proposed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Unrelated parallel machines</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequence-dependent setups</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Total completion time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Resources</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Andrés-Romano, Carlos</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">The international journal of advanced manufacturing technology</subfield><subfield code="d">Springer-Verlag, 1985</subfield><subfield code="g">57(2011), 5-8 vom: 06. Mai, Seite 777-794</subfield><subfield code="w">(DE-627)129185299</subfield><subfield code="w">(DE-600)52651-4</subfield><subfield code="w">(DE-576)014456192</subfield><subfield code="x">0268-3768</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:57</subfield><subfield code="g">year:2011</subfield><subfield code="g">number:5-8</subfield><subfield code="g">day:06</subfield><subfield code="g">month:05</subfield><subfield code="g">pages:777-794</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s00170-011-3318-2</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_21</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_150</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2006</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2241</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2333</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">57</subfield><subfield code="j">2011</subfield><subfield code="e">5-8</subfield><subfield code="b">06</subfield><subfield code="c">05</subfield><subfield code="h">777-794</subfield></datafield></record></collection>
|
| score |
7.399617 |