Learning-based scheduling in a job shop
Abstract A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no rule exists that overrules the rest in all the possible stat...
Ausführliche Beschreibung
Autor*in: |
Priore, P. [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
1999 |
---|
Schlagwörter: |
---|
Anmerkung: |
© Springer 1999 |
---|
Übergeordnetes Werk: |
Enthalten in: Elektrotechnik und Informationstechnik - Springer-Verlag, 1988, 116(1999), 6 vom: Juni, Seite 370-375 |
---|---|
Übergeordnetes Werk: |
volume:116 ; year:1999 ; number:6 ; month:06 ; pages:370-375 |
Links: |
---|
DOI / URN: |
10.1007/BF03159198 |
---|
Katalog-ID: |
OLC2065314567 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | OLC2065314567 | ||
003 | DE-627 | ||
005 | 20230502112320.0 | ||
007 | tu | ||
008 | 200820s1999 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1007/BF03159198 |2 doi | |
035 | |a (DE-627)OLC2065314567 | ||
035 | |a (DE-He213)BF03159198-p | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 620 |a 004 |a 070 |q VZ |
100 | 1 | |a Priore, P. |e verfasserin |4 aut | |
245 | 1 | 0 | |a Learning-based scheduling in a job shop |
264 | 1 | |c 1999 | |
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 1999 | ||
520 | |a Abstract A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would therefore be interesting to use the most appropriate dispatching rule at each moment. To achieve this goal, a scheduling approach which uses machine learning is presented in this paper. By means of this technique, by analysing the previous performance of the system (training examples), a set of heuristic rules are generated that can be used to decide which is the most appropriate dispatching rule at each moment in time. This approach is applied to a job shop configuration. The results demonstrate that this approach produces an improvement in the performance of the system when compared to the traditional method of using dispatching rules. | ||
650 | 4 | |a learning-based scheduling | |
650 | 4 | |a job shop systems | |
650 | 4 | |a machine learning | |
700 | 1 | |a de la Fuente, D. |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Elektrotechnik und Informationstechnik |d Springer-Verlag, 1988 |g 116(1999), 6 vom: Juni, Seite 370-375 |h 30 cm |w (DE-627)129622184 |w (DE-600)246725-2 |w (DE-576)015132323 |x 0932-383X |7 nnns |
773 | 1 | 8 | |g volume:116 |g year:1999 |g number:6 |g month:06 |g pages:370-375 |
856 | 4 | 1 | |u https://doi.org/10.1007/BF03159198 |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-TEC | ||
912 | |a SSG-OLC-MAT | ||
912 | |a GBV_ILN_11 | ||
912 | |a GBV_ILN_20 | ||
912 | |a GBV_ILN_21 | ||
912 | |a GBV_ILN_32 | ||
912 | |a GBV_ILN_34 | ||
912 | |a GBV_ILN_62 | ||
912 | |a GBV_ILN_70 | ||
912 | |a GBV_ILN_100 | ||
912 | |a GBV_ILN_105 | ||
912 | |a GBV_ILN_267 | ||
912 | |a GBV_ILN_2006 | ||
912 | |a GBV_ILN_2014 | ||
912 | |a GBV_ILN_2015 | ||
912 | |a GBV_ILN_2016 | ||
912 | |a GBV_ILN_2020 | ||
912 | |a GBV_ILN_2048 | ||
912 | |a GBV_ILN_2050 | ||
912 | |a GBV_ILN_2061 | ||
912 | |a GBV_ILN_2064 | ||
912 | |a GBV_ILN_4036 | ||
912 | |a GBV_ILN_4046 | ||
912 | |a GBV_ILN_4266 | ||
912 | |a GBV_ILN_4307 | ||
912 | |a GBV_ILN_4314 | ||
912 | |a GBV_ILN_4316 | ||
912 | |a GBV_ILN_4317 | ||
912 | |a GBV_ILN_4319 | ||
912 | |a GBV_ILN_4328 | ||
951 | |a AR | ||
952 | |d 116 |j 1999 |e 6 |c 06 |h 370-375 |
author_variant |
p p pp l f d d lfd lfdd |
---|---|
matchkey_str |
article:0932383X:1999----::erigaeshdlni |
hierarchy_sort_str |
1999 |
publishDate |
1999 |
allfields |
10.1007/BF03159198 doi (DE-627)OLC2065314567 (DE-He213)BF03159198-p DE-627 ger DE-627 rakwb eng 620 004 070 VZ Priore, P. verfasserin aut Learning-based scheduling in a job shop 1999 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer 1999 Abstract A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would therefore be interesting to use the most appropriate dispatching rule at each moment. To achieve this goal, a scheduling approach which uses machine learning is presented in this paper. By means of this technique, by analysing the previous performance of the system (training examples), a set of heuristic rules are generated that can be used to decide which is the most appropriate dispatching rule at each moment in time. This approach is applied to a job shop configuration. The results demonstrate that this approach produces an improvement in the performance of the system when compared to the traditional method of using dispatching rules. learning-based scheduling job shop systems machine learning de la Fuente, D. aut Enthalten in Elektrotechnik und Informationstechnik Springer-Verlag, 1988 116(1999), 6 vom: Juni, Seite 370-375 30 cm (DE-627)129622184 (DE-600)246725-2 (DE-576)015132323 0932-383X nnns volume:116 year:1999 number:6 month:06 pages:370-375 https://doi.org/10.1007/BF03159198 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_32 GBV_ILN_34 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2016 GBV_ILN_2020 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4316 GBV_ILN_4317 GBV_ILN_4319 GBV_ILN_4328 AR 116 1999 6 06 370-375 |
spelling |
10.1007/BF03159198 doi (DE-627)OLC2065314567 (DE-He213)BF03159198-p DE-627 ger DE-627 rakwb eng 620 004 070 VZ Priore, P. verfasserin aut Learning-based scheduling in a job shop 1999 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer 1999 Abstract A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would therefore be interesting to use the most appropriate dispatching rule at each moment. To achieve this goal, a scheduling approach which uses machine learning is presented in this paper. By means of this technique, by analysing the previous performance of the system (training examples), a set of heuristic rules are generated that can be used to decide which is the most appropriate dispatching rule at each moment in time. This approach is applied to a job shop configuration. The results demonstrate that this approach produces an improvement in the performance of the system when compared to the traditional method of using dispatching rules. learning-based scheduling job shop systems machine learning de la Fuente, D. aut Enthalten in Elektrotechnik und Informationstechnik Springer-Verlag, 1988 116(1999), 6 vom: Juni, Seite 370-375 30 cm (DE-627)129622184 (DE-600)246725-2 (DE-576)015132323 0932-383X nnns volume:116 year:1999 number:6 month:06 pages:370-375 https://doi.org/10.1007/BF03159198 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_32 GBV_ILN_34 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2016 GBV_ILN_2020 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4316 GBV_ILN_4317 GBV_ILN_4319 GBV_ILN_4328 AR 116 1999 6 06 370-375 |
allfields_unstemmed |
10.1007/BF03159198 doi (DE-627)OLC2065314567 (DE-He213)BF03159198-p DE-627 ger DE-627 rakwb eng 620 004 070 VZ Priore, P. verfasserin aut Learning-based scheduling in a job shop 1999 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer 1999 Abstract A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would therefore be interesting to use the most appropriate dispatching rule at each moment. To achieve this goal, a scheduling approach which uses machine learning is presented in this paper. By means of this technique, by analysing the previous performance of the system (training examples), a set of heuristic rules are generated that can be used to decide which is the most appropriate dispatching rule at each moment in time. This approach is applied to a job shop configuration. The results demonstrate that this approach produces an improvement in the performance of the system when compared to the traditional method of using dispatching rules. learning-based scheduling job shop systems machine learning de la Fuente, D. aut Enthalten in Elektrotechnik und Informationstechnik Springer-Verlag, 1988 116(1999), 6 vom: Juni, Seite 370-375 30 cm (DE-627)129622184 (DE-600)246725-2 (DE-576)015132323 0932-383X nnns volume:116 year:1999 number:6 month:06 pages:370-375 https://doi.org/10.1007/BF03159198 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_32 GBV_ILN_34 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2016 GBV_ILN_2020 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4316 GBV_ILN_4317 GBV_ILN_4319 GBV_ILN_4328 AR 116 1999 6 06 370-375 |
allfieldsGer |
10.1007/BF03159198 doi (DE-627)OLC2065314567 (DE-He213)BF03159198-p DE-627 ger DE-627 rakwb eng 620 004 070 VZ Priore, P. verfasserin aut Learning-based scheduling in a job shop 1999 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer 1999 Abstract A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would therefore be interesting to use the most appropriate dispatching rule at each moment. To achieve this goal, a scheduling approach which uses machine learning is presented in this paper. By means of this technique, by analysing the previous performance of the system (training examples), a set of heuristic rules are generated that can be used to decide which is the most appropriate dispatching rule at each moment in time. This approach is applied to a job shop configuration. The results demonstrate that this approach produces an improvement in the performance of the system when compared to the traditional method of using dispatching rules. learning-based scheduling job shop systems machine learning de la Fuente, D. aut Enthalten in Elektrotechnik und Informationstechnik Springer-Verlag, 1988 116(1999), 6 vom: Juni, Seite 370-375 30 cm (DE-627)129622184 (DE-600)246725-2 (DE-576)015132323 0932-383X nnns volume:116 year:1999 number:6 month:06 pages:370-375 https://doi.org/10.1007/BF03159198 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_32 GBV_ILN_34 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2016 GBV_ILN_2020 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4316 GBV_ILN_4317 GBV_ILN_4319 GBV_ILN_4328 AR 116 1999 6 06 370-375 |
allfieldsSound |
10.1007/BF03159198 doi (DE-627)OLC2065314567 (DE-He213)BF03159198-p DE-627 ger DE-627 rakwb eng 620 004 070 VZ Priore, P. verfasserin aut Learning-based scheduling in a job shop 1999 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer 1999 Abstract A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would therefore be interesting to use the most appropriate dispatching rule at each moment. To achieve this goal, a scheduling approach which uses machine learning is presented in this paper. By means of this technique, by analysing the previous performance of the system (training examples), a set of heuristic rules are generated that can be used to decide which is the most appropriate dispatching rule at each moment in time. This approach is applied to a job shop configuration. The results demonstrate that this approach produces an improvement in the performance of the system when compared to the traditional method of using dispatching rules. learning-based scheduling job shop systems machine learning de la Fuente, D. aut Enthalten in Elektrotechnik und Informationstechnik Springer-Verlag, 1988 116(1999), 6 vom: Juni, Seite 370-375 30 cm (DE-627)129622184 (DE-600)246725-2 (DE-576)015132323 0932-383X nnns volume:116 year:1999 number:6 month:06 pages:370-375 https://doi.org/10.1007/BF03159198 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_32 GBV_ILN_34 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2016 GBV_ILN_2020 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4316 GBV_ILN_4317 GBV_ILN_4319 GBV_ILN_4328 AR 116 1999 6 06 370-375 |
language |
English |
source |
Enthalten in Elektrotechnik und Informationstechnik 116(1999), 6 vom: Juni, Seite 370-375 volume:116 year:1999 number:6 month:06 pages:370-375 |
sourceStr |
Enthalten in Elektrotechnik und Informationstechnik 116(1999), 6 vom: Juni, Seite 370-375 volume:116 year:1999 number:6 month:06 pages:370-375 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
learning-based scheduling job shop systems machine learning |
dewey-raw |
620 |
isfreeaccess_bool |
false |
container_title |
Elektrotechnik und Informationstechnik |
authorswithroles_txt_mv |
Priore, P. @@aut@@ de la Fuente, D. @@aut@@ |
publishDateDaySort_date |
1999-06-01T00:00:00Z |
hierarchy_top_id |
129622184 |
dewey-sort |
3620 |
id |
OLC2065314567 |
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">OLC2065314567</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502112320.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s1999 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF03159198</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2065314567</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF03159198-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">620</subfield><subfield code="a">004</subfield><subfield code="a">070</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Priore, P.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Learning-based scheduling in a job shop</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1999</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 1999</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would therefore be interesting to use the most appropriate dispatching rule at each moment. To achieve this goal, a scheduling approach which uses machine learning is presented in this paper. By means of this technique, by analysing the previous performance of the system (training examples), a set of heuristic rules are generated that can be used to decide which is the most appropriate dispatching rule at each moment in time. This approach is applied to a job shop configuration. The results demonstrate that this approach produces an improvement in the performance of the system when compared to the traditional method of using dispatching rules.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">learning-based scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">job shop systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">machine learning</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">de la Fuente, D.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Elektrotechnik und Informationstechnik</subfield><subfield code="d">Springer-Verlag, 1988</subfield><subfield code="g">116(1999), 6 vom: Juni, Seite 370-375</subfield><subfield code="h">30 cm</subfield><subfield code="w">(DE-627)129622184</subfield><subfield code="w">(DE-600)246725-2</subfield><subfield code="w">(DE-576)015132323</subfield><subfield code="x">0932-383X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:116</subfield><subfield code="g">year:1999</subfield><subfield code="g">number:6</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:370-375</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF03159198</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">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</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_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_34</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</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_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</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_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2016</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4316</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4328</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">116</subfield><subfield code="j">1999</subfield><subfield code="e">6</subfield><subfield code="c">06</subfield><subfield code="h">370-375</subfield></datafield></record></collection>
|
author |
Priore, P. |
spellingShingle |
Priore, P. ddc 620 misc learning-based scheduling misc job shop systems misc machine learning Learning-based scheduling in a job shop |
authorStr |
Priore, P. |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)129622184 |
format |
Article |
dewey-ones |
620 - Engineering & allied operations 004 - Data processing & computer science 070 - News media, journalism & publishing |
delete_txt_mv |
keep |
author_role |
aut aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
0932-383X |
topic_title |
620 004 070 VZ Learning-based scheduling in a job shop learning-based scheduling job shop systems machine learning |
topic |
ddc 620 misc learning-based scheduling misc job shop systems misc machine learning |
topic_unstemmed |
ddc 620 misc learning-based scheduling misc job shop systems misc machine learning |
topic_browse |
ddc 620 misc learning-based scheduling misc job shop systems misc machine learning |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
hierarchy_parent_title |
Elektrotechnik und Informationstechnik |
hierarchy_parent_id |
129622184 |
dewey-tens |
620 - Engineering 000 - Computer science, knowledge & systems 070 - News media, journalism & publishing |
hierarchy_top_title |
Elektrotechnik und Informationstechnik |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)129622184 (DE-600)246725-2 (DE-576)015132323 |
title |
Learning-based scheduling in a job shop |
ctrlnum |
(DE-627)OLC2065314567 (DE-He213)BF03159198-p |
title_full |
Learning-based scheduling in a job shop |
author_sort |
Priore, P. |
journal |
Elektrotechnik und Informationstechnik |
journalStr |
Elektrotechnik und Informationstechnik |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
600 - Technology 000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
1999 |
contenttype_str_mv |
txt |
container_start_page |
370 |
author_browse |
Priore, P. de la Fuente, D. |
container_volume |
116 |
class |
620 004 070 VZ |
format_se |
Aufsätze |
author-letter |
Priore, P. |
doi_str_mv |
10.1007/BF03159198 |
dewey-full |
620 004 070 |
title_sort |
learning-based scheduling in a job shop |
title_auth |
Learning-based scheduling in a job shop |
abstract |
Abstract A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would therefore be interesting to use the most appropriate dispatching rule at each moment. To achieve this goal, a scheduling approach which uses machine learning is presented in this paper. By means of this technique, by analysing the previous performance of the system (training examples), a set of heuristic rules are generated that can be used to decide which is the most appropriate dispatching rule at each moment in time. This approach is applied to a job shop configuration. The results demonstrate that this approach produces an improvement in the performance of the system when compared to the traditional method of using dispatching rules. © Springer 1999 |
abstractGer |
Abstract A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would therefore be interesting to use the most appropriate dispatching rule at each moment. To achieve this goal, a scheduling approach which uses machine learning is presented in this paper. By means of this technique, by analysing the previous performance of the system (training examples), a set of heuristic rules are generated that can be used to decide which is the most appropriate dispatching rule at each moment in time. This approach is applied to a job shop configuration. The results demonstrate that this approach produces an improvement in the performance of the system when compared to the traditional method of using dispatching rules. © Springer 1999 |
abstract_unstemmed |
Abstract A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would therefore be interesting to use the most appropriate dispatching rule at each moment. To achieve this goal, a scheduling approach which uses machine learning is presented in this paper. By means of this technique, by analysing the previous performance of the system (training examples), a set of heuristic rules are generated that can be used to decide which is the most appropriate dispatching rule at each moment in time. This approach is applied to a job shop configuration. The results demonstrate that this approach produces an improvement in the performance of the system when compared to the traditional method of using dispatching rules. © Springer 1999 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_11 GBV_ILN_20 GBV_ILN_21 GBV_ILN_32 GBV_ILN_34 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_105 GBV_ILN_267 GBV_ILN_2006 GBV_ILN_2014 GBV_ILN_2015 GBV_ILN_2016 GBV_ILN_2020 GBV_ILN_2048 GBV_ILN_2050 GBV_ILN_2061 GBV_ILN_2064 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4266 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4316 GBV_ILN_4317 GBV_ILN_4319 GBV_ILN_4328 |
container_issue |
6 |
title_short |
Learning-based scheduling in a job shop |
url |
https://doi.org/10.1007/BF03159198 |
remote_bool |
false |
author2 |
de la Fuente, D. |
author2Str |
de la Fuente, D. |
ppnlink |
129622184 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/BF03159198 |
up_date |
2024-07-04T01:57:38.840Z |
_version_ |
1803611808821411840 |
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">OLC2065314567</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502112320.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s1999 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF03159198</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2065314567</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF03159198-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">620</subfield><subfield code="a">004</subfield><subfield code="a">070</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Priore, P.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Learning-based scheduling in a job shop</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1999</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 1999</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract A common way of dynamically scheduling jobs in a manufacturing system is by means of dispatching rules. The problem of this method is that the performance of these rules depends on the state the system is in at each moment, and no rule exists that overrules the rest in all the possible states that the system may be in. The system’s state is defined by a set of control attributes. It would therefore be interesting to use the most appropriate dispatching rule at each moment. To achieve this goal, a scheduling approach which uses machine learning is presented in this paper. By means of this technique, by analysing the previous performance of the system (training examples), a set of heuristic rules are generated that can be used to decide which is the most appropriate dispatching rule at each moment in time. This approach is applied to a job shop configuration. The results demonstrate that this approach produces an improvement in the performance of the system when compared to the traditional method of using dispatching rules.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">learning-based scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">job shop systems</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">machine learning</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">de la Fuente, D.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Elektrotechnik und Informationstechnik</subfield><subfield code="d">Springer-Verlag, 1988</subfield><subfield code="g">116(1999), 6 vom: Juni, Seite 370-375</subfield><subfield code="h">30 cm</subfield><subfield code="w">(DE-627)129622184</subfield><subfield code="w">(DE-600)246725-2</subfield><subfield code="w">(DE-576)015132323</subfield><subfield code="x">0932-383X</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:116</subfield><subfield code="g">year:1999</subfield><subfield code="g">number:6</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:370-375</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF03159198</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">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</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_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_34</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</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_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</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_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2016</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2048</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2050</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2061</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2064</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4316</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4319</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4328</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">116</subfield><subfield code="j">1999</subfield><subfield code="e">6</subfield><subfield code="c">06</subfield><subfield code="h">370-375</subfield></datafield></record></collection>
|
score |
7.398615 |