Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling
The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, th...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Miori, Virginia M. [verfasserIn] Segulin, Brian [author] |
|---|
| Format: |
E-Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2010 |
|---|
| Schlagwörter: |
|---|
| Umfang: |
Online-Ressource |
|---|
| Reproduktion: |
IGI Global InfoSci Journals Archive 2000 - 2012 |
|---|---|
| Übergeordnetes Werk: |
In: International journal of business intelligence research - Hershey, Pa : IGI Global, 2010, 1(2010), 2, Seite 9-20 |
| Übergeordnetes Werk: |
volume:1 ; year:2010 ; number:2 ; pages:9-20 |
| Links: |
|---|
| DOI / URN: |
10.4018/jbir.2010040102 |
|---|
| Katalog-ID: |
NLEJ244421439 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | NLEJ244421439 | ||
| 003 | DE-627 | ||
| 005 | 20240202180006.0 | ||
| 007 | cr uuu---uuuuu | ||
| 008 | 150605s2010 xx |||||o 00| ||eng c | ||
| 024 | 7 | |a 10.4018/jbir.2010040102 |2 doi | |
| 035 | |a (DE-627)NLEJ244421439 | ||
| 035 | |a (VZGNL)10.4018/jbir.2010040102 | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 100 | 1 | |a Miori, Virginia M. |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling |
| 264 | 1 | |c 2010 | |
| 300 | |a Online-Ressource | ||
| 336 | |a nicht spezifiziert |b zzz |2 rdacontent | ||
| 337 | |a nicht spezifiziert |b z |2 rdamedia | ||
| 338 | |a nicht spezifiziert |b zu |2 rdacarrier | ||
| 520 | |a The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, the authors present triplet notation applied to the production scheduling of a single production line used for milk, juice, and carnival drinks. Once production and cleaning cycles are characterized as triplets, the problem is formulated. Lagrange relaxation is applied and the final solution is generated using dynamic programming | ||
| 533 | |f IGI Global InfoSci Journals Archive 2000 - 2012 | ||
| 650 | 4 | |a Dynamic Programming | |
| 650 | 4 | |a Production Scheduling | |
| 650 | 4 | |a Pull Process | |
| 650 | 4 | |a Push Process | |
| 650 | 4 | |a Triplet | |
| 700 | 1 | |a Segulin, Brian |e author |4 aut | |
| 773 | 0 | 8 | |i In |t International journal of business intelligence research |d Hershey, Pa : IGI Global, 2010 |g 1(2010), 2, Seite 9-20 |h Online-Ressource |w (DE-627)NLEJ244419760 |w (DE-600)2566652-6 |x 1947-3605 |7 nnns |
| 773 | 1 | 8 | |g volume:1 |g year:2010 |g number:2 |g pages:9-20 |
| 856 | 4 | 0 | |u http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102 |m X:IGIG |x Verlag |z Deutschlandweit zugänglich |
| 856 | 4 | 2 | |u http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102&buylink=true |q text/html |y Abstract |z Deutschlandweit zugänglich |
| 912 | |a ZDB-1-GIS | ||
| 912 | |a GBV_NL_ARTICLE | ||
| 951 | |a AR | ||
| 952 | |d 1 |j 2010 |e 2 |h 9-20 | ||
| author_variant |
v m m vm vmm b s bs |
|---|---|
| matchkey_str |
article:19473605:2010----::plctootiltoainndnmcrgamntsnllnmlirdc |
| hierarchy_sort_str |
2010 |
| publishDate |
2010 |
| allfields |
10.4018/jbir.2010040102 doi (DE-627)NLEJ244421439 (VZGNL)10.4018/jbir.2010040102 DE-627 ger DE-627 rakwb eng Miori, Virginia M. verfasserin aut Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling 2010 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, the authors present triplet notation applied to the production scheduling of a single production line used for milk, juice, and carnival drinks. Once production and cleaning cycles are characterized as triplets, the problem is formulated. Lagrange relaxation is applied and the final solution is generated using dynamic programming IGI Global InfoSci Journals Archive 2000 - 2012 Dynamic Programming Production Scheduling Pull Process Push Process Triplet Segulin, Brian author aut In International journal of business intelligence research Hershey, Pa : IGI Global, 2010 1(2010), 2, Seite 9-20 Online-Ressource (DE-627)NLEJ244419760 (DE-600)2566652-6 1947-3605 nnns volume:1 year:2010 number:2 pages:9-20 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 1 2010 2 9-20 |
| spelling |
10.4018/jbir.2010040102 doi (DE-627)NLEJ244421439 (VZGNL)10.4018/jbir.2010040102 DE-627 ger DE-627 rakwb eng Miori, Virginia M. verfasserin aut Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling 2010 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, the authors present triplet notation applied to the production scheduling of a single production line used for milk, juice, and carnival drinks. Once production and cleaning cycles are characterized as triplets, the problem is formulated. Lagrange relaxation is applied and the final solution is generated using dynamic programming IGI Global InfoSci Journals Archive 2000 - 2012 Dynamic Programming Production Scheduling Pull Process Push Process Triplet Segulin, Brian author aut In International journal of business intelligence research Hershey, Pa : IGI Global, 2010 1(2010), 2, Seite 9-20 Online-Ressource (DE-627)NLEJ244419760 (DE-600)2566652-6 1947-3605 nnns volume:1 year:2010 number:2 pages:9-20 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 1 2010 2 9-20 |
| allfields_unstemmed |
10.4018/jbir.2010040102 doi (DE-627)NLEJ244421439 (VZGNL)10.4018/jbir.2010040102 DE-627 ger DE-627 rakwb eng Miori, Virginia M. verfasserin aut Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling 2010 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, the authors present triplet notation applied to the production scheduling of a single production line used for milk, juice, and carnival drinks. Once production and cleaning cycles are characterized as triplets, the problem is formulated. Lagrange relaxation is applied and the final solution is generated using dynamic programming IGI Global InfoSci Journals Archive 2000 - 2012 Dynamic Programming Production Scheduling Pull Process Push Process Triplet Segulin, Brian author aut In International journal of business intelligence research Hershey, Pa : IGI Global, 2010 1(2010), 2, Seite 9-20 Online-Ressource (DE-627)NLEJ244419760 (DE-600)2566652-6 1947-3605 nnns volume:1 year:2010 number:2 pages:9-20 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 1 2010 2 9-20 |
| allfieldsGer |
10.4018/jbir.2010040102 doi (DE-627)NLEJ244421439 (VZGNL)10.4018/jbir.2010040102 DE-627 ger DE-627 rakwb eng Miori, Virginia M. verfasserin aut Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling 2010 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, the authors present triplet notation applied to the production scheduling of a single production line used for milk, juice, and carnival drinks. Once production and cleaning cycles are characterized as triplets, the problem is formulated. Lagrange relaxation is applied and the final solution is generated using dynamic programming IGI Global InfoSci Journals Archive 2000 - 2012 Dynamic Programming Production Scheduling Pull Process Push Process Triplet Segulin, Brian author aut In International journal of business intelligence research Hershey, Pa : IGI Global, 2010 1(2010), 2, Seite 9-20 Online-Ressource (DE-627)NLEJ244419760 (DE-600)2566652-6 1947-3605 nnns volume:1 year:2010 number:2 pages:9-20 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 1 2010 2 9-20 |
| allfieldsSound |
10.4018/jbir.2010040102 doi (DE-627)NLEJ244421439 (VZGNL)10.4018/jbir.2010040102 DE-627 ger DE-627 rakwb eng Miori, Virginia M. verfasserin aut Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling 2010 Online-Ressource nicht spezifiziert zzz rdacontent nicht spezifiziert z rdamedia nicht spezifiziert zu rdacarrier The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, the authors present triplet notation applied to the production scheduling of a single production line used for milk, juice, and carnival drinks. Once production and cleaning cycles are characterized as triplets, the problem is formulated. Lagrange relaxation is applied and the final solution is generated using dynamic programming IGI Global InfoSci Journals Archive 2000 - 2012 Dynamic Programming Production Scheduling Pull Process Push Process Triplet Segulin, Brian author aut In International journal of business intelligence research Hershey, Pa : IGI Global, 2010 1(2010), 2, Seite 9-20 Online-Ressource (DE-627)NLEJ244419760 (DE-600)2566652-6 1947-3605 nnns volume:1 year:2010 number:2 pages:9-20 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102 X:IGIG Verlag Deutschlandweit zugänglich http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102&buylink=true text/html Abstract Deutschlandweit zugänglich ZDB-1-GIS GBV_NL_ARTICLE AR 1 2010 2 9-20 |
| language |
English |
| source |
In International journal of business intelligence research 1(2010), 2, Seite 9-20 volume:1 year:2010 number:2 pages:9-20 |
| sourceStr |
In International journal of business intelligence research 1(2010), 2, Seite 9-20 volume:1 year:2010 number:2 pages:9-20 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Dynamic Programming Production Scheduling Pull Process Push Process Triplet |
| isfreeaccess_bool |
false |
| container_title |
International journal of business intelligence research |
| authorswithroles_txt_mv |
Miori, Virginia M. @@aut@@ Segulin, Brian @@aut@@ |
| publishDateDaySort_date |
2010-01-01T00:00:00Z |
| hierarchy_top_id |
NLEJ244419760 |
| id |
NLEJ244421439 |
| 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">NLEJ244421439</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240202180006.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">150605s2010 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4018/jbir.2010040102</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ244421439</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(VZGNL)10.4018/jbir.2010040102</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="100" ind1="1" ind2=" "><subfield code="a">Miori, Virginia M.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, the authors present triplet notation applied to the production scheduling of a single production line used for milk, juice, and carnival drinks. Once production and cleaning cycles are characterized as triplets, the problem is formulated. Lagrange relaxation is applied and the final solution is generated using dynamic programming</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">IGI Global InfoSci Journals Archive 2000 - 2012</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic Programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production Scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pull Process</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Push Process</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Triplet</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Segulin, Brian</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">International journal of business intelligence research</subfield><subfield code="d">Hershey, Pa : IGI Global, 2010</subfield><subfield code="g">1(2010), 2, Seite 9-20</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ244419760</subfield><subfield code="w">(DE-600)2566652-6</subfield><subfield code="x">1947-3605</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:1</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:9-20</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102</subfield><subfield code="m">X:IGIG</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102&buylink=true</subfield><subfield code="q">text/html</subfield><subfield code="y">Abstract</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-GIS</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="d">1</subfield><subfield code="j">2010</subfield><subfield code="e">2</subfield><subfield code="h">9-20</subfield></datafield></record></collection>
|
| series2 |
IGI Global InfoSci Journals Archive 2000 - 2012 |
| author |
Miori, Virginia M. |
| spellingShingle |
Miori, Virginia M. misc Dynamic Programming misc Production Scheduling misc Pull Process misc Push Process misc Triplet Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling |
| authorStr |
Miori, Virginia M. |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)NLEJ244419760 |
| format |
electronic Article |
| delete_txt_mv |
keep |
| author_role |
aut aut |
| collection |
NL |
| remote_str |
true |
| illustrated |
Not Illustrated |
| issn |
1947-3605 |
| topic_title |
Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling Dynamic Programming Production Scheduling Pull Process Push Process Triplet |
| topic |
misc Dynamic Programming misc Production Scheduling misc Pull Process misc Push Process misc Triplet |
| topic_unstemmed |
misc Dynamic Programming misc Production Scheduling misc Pull Process misc Push Process misc Triplet |
| topic_browse |
misc Dynamic Programming misc Production Scheduling misc Pull Process misc Push Process misc Triplet |
| format_facet |
Elektronische Aufsätze Aufsätze Elektronische Ressource |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
zu |
| hierarchy_parent_title |
International journal of business intelligence research |
| hierarchy_parent_id |
NLEJ244419760 |
| hierarchy_top_title |
International journal of business intelligence research |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)NLEJ244419760 (DE-600)2566652-6 |
| title |
Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling |
| ctrlnum |
(DE-627)NLEJ244421439 (VZGNL)10.4018/jbir.2010040102 |
| title_full |
Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling |
| author_sort |
Miori, Virginia M. |
| journal |
International journal of business intelligence research |
| journalStr |
International journal of business intelligence research |
| lang_code |
eng |
| isOA_bool |
false |
| recordtype |
marc |
| publishDateSort |
2010 |
| contenttype_str_mv |
zzz |
| container_start_page |
9 |
| author_browse |
Miori, Virginia M. Segulin, Brian |
| container_volume |
1 |
| physical |
Online-Ressource |
| format_se |
Elektronische Aufsätze |
| author-letter |
Miori, Virginia M. |
| doi_str_mv |
10.4018/jbir.2010040102 |
| author2-role |
author |
| title_sort |
application of triplet notation and dynamic programming to single-line, multi-product dairy production scheduling |
| title_auth |
Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling |
| abstract |
The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, the authors present triplet notation applied to the production scheduling of a single production line used for milk, juice, and carnival drinks. Once production and cleaning cycles are characterized as triplets, the problem is formulated. Lagrange relaxation is applied and the final solution is generated using dynamic programming |
| abstractGer |
The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, the authors present triplet notation applied to the production scheduling of a single production line used for milk, juice, and carnival drinks. Once production and cleaning cycles are characterized as triplets, the problem is formulated. Lagrange relaxation is applied and the final solution is generated using dynamic programming |
| abstract_unstemmed |
The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, the authors present triplet notation applied to the production scheduling of a single production line used for milk, juice, and carnival drinks. Once production and cleaning cycles are characterized as triplets, the problem is formulated. Lagrange relaxation is applied and the final solution is generated using dynamic programming |
| collection_details |
ZDB-1-GIS GBV_NL_ARTICLE |
| container_issue |
2 |
| title_short |
Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling |
| url |
http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102 http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102&buylink=true |
| remote_bool |
true |
| author2 |
Segulin, Brian |
| author2Str |
Segulin, Brian |
| ppnlink |
NLEJ244419760 |
| mediatype_str_mv |
z |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.4018/jbir.2010040102 |
| up_date |
2024-07-06T07:50:46.923Z |
| _version_ |
1803815220071628800 |
| 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">NLEJ244421439</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20240202180006.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">150605s2010 xx |||||o 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.4018/jbir.2010040102</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)NLEJ244421439</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(VZGNL)10.4018/jbir.2010040102</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="100" ind1="1" ind2=" "><subfield code="a">Miori, Virginia M.</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Application of Triplet Notation and Dynamic Programming to Single-Line, Multi-Product Dairy Production Scheduling</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2010</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zzz</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">z</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">nicht spezifiziert</subfield><subfield code="b">zu</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The application of optimal methods for production scheduling in the dairy industry has been limited. Within supply chain terminology, dairy production was generally considered a push process but with advancements in automation, the industry is slowly transforming to a pull process. In this paper, the authors present triplet notation applied to the production scheduling of a single production line used for milk, juice, and carnival drinks. Once production and cleaning cycles are characterized as triplets, the problem is formulated. Lagrange relaxation is applied and the final solution is generated using dynamic programming</subfield></datafield><datafield tag="533" ind1=" " ind2=" "><subfield code="f">IGI Global InfoSci Journals Archive 2000 - 2012</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Dynamic Programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Production Scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Pull Process</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Push Process</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Triplet</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Segulin, Brian</subfield><subfield code="e">author</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">International journal of business intelligence research</subfield><subfield code="d">Hershey, Pa : IGI Global, 2010</subfield><subfield code="g">1(2010), 2, Seite 9-20</subfield><subfield code="h">Online-Ressource</subfield><subfield code="w">(DE-627)NLEJ244419760</subfield><subfield code="w">(DE-600)2566652-6</subfield><subfield code="x">1947-3605</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:1</subfield><subfield code="g">year:2010</subfield><subfield code="g">number:2</subfield><subfield code="g">pages:9-20</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102</subfield><subfield code="m">X:IGIG</subfield><subfield code="x">Verlag</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jbir.2010040102&buylink=true</subfield><subfield code="q">text/html</subfield><subfield code="y">Abstract</subfield><subfield code="z">Deutschlandweit zugänglich</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-1-GIS</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="d">1</subfield><subfield code="j">2010</subfield><subfield code="e">2</subfield><subfield code="h">9-20</subfield></datafield></record></collection>
|
| score |
7.3985558 |