A dual-criteria flow shop scheduling with sequence-dependent setup times
Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum to...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Nailwal, Kewal Krishan [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015 |
|---|
| Rechteinformationen: |
Nutzungsrecht: © 2015 Taru Publications 2015 |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of information & optimization sciences - Delhi : Analytic Publ. Co., 1980, 36(2015), 5, Seite 485 |
|---|---|
| Übergeordnetes Werk: |
volume:36 ; year:2015 ; number:5 ; pages:485 |
| Links: |
|---|
| DOI / URN: |
10.1080/02522667.2015.1026460 |
|---|
| Katalog-ID: |
OLC1968591524 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1968591524 | ||
| 003 | DE-627 | ||
| 005 | 20220215154817.0 | ||
| 007 | tu | ||
| 008 | 160206s2015 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1080/02522667.2015.1026460 |2 doi | |
| 028 | 5 | 2 | |a PQ20160617 |
| 035 | |a (DE-627)OLC1968591524 | ||
| 035 | |a (DE-599)GBVOLC1968591524 | ||
| 035 | |a (PRQ)informaworld_taylorfrancis_10_1080_02522667_2015_10264600 | ||
| 035 | |a (KEY)0105632820150000036000500485dualcriteriaflowshopschedulingwithsequencedependen | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |a 510 |q DNB |
| 084 | |a 06.00 |2 bkl | ||
| 100 | 1 | |a Nailwal, Kewal Krishan |e verfasserin |4 aut | |
| 245 | 1 | 2 | |a A dual-criteria flow shop scheduling with sequence-dependent setup times |
| 264 | 1 | |c 2015 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm. | ||
| 540 | |a Nutzungsrecht: © 2015 Taru Publications 2015 | ||
| 650 | 4 | |a Operation time | |
| 650 | 4 | |a Scheduling | |
| 650 | 4 | |a Sequence-dependent setup time | |
| 650 | 4 | |a etc | |
| 650 | 4 | |a Breakdown interval | |
| 650 | 4 | |a Total elapsed time | |
| 650 | 4 | |a Operational cost | |
| 700 | 1 | |a Gupta, Deepak |4 oth | |
| 700 | 1 | |a Sharma, Sameer |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of information & optimization sciences |d Delhi : Analytic Publ. Co., 1980 |g 36(2015), 5, Seite 485 |w (DE-627)130417920 |w (DE-600)627464-X |w (DE-576)9130417929 |x 0252-2667 |7 nnns |
| 773 | 1 | 8 | |g volume:36 |g year:2015 |g number:5 |g pages:485 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1080/02522667.2015.1026460 |3 Volltext |
| 856 | 4 | 2 | |u http://www.tandfonline.com/doi/abs/10.1080/02522667.2015.1026460 |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-BUB | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OPC-BBI | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_70 | ||
| 936 | b | k | |a 06.00 |q AVZ |
| 951 | |a AR | ||
| 952 | |d 36 |j 2015 |e 5 |h 485 | ||
| author_variant |
k k n kk kkn |
|---|---|
| matchkey_str |
article:02522667:2015----::dacieifososhdlnwtsqecd |
| hierarchy_sort_str |
2015 |
| bklnumber |
06.00 |
| publishDate |
2015 |
| allfields |
10.1080/02522667.2015.1026460 doi PQ20160617 (DE-627)OLC1968591524 (DE-599)GBVOLC1968591524 (PRQ)informaworld_taylorfrancis_10_1080_02522667_2015_10264600 (KEY)0105632820150000036000500485dualcriteriaflowshopschedulingwithsequencedependen DE-627 ger DE-627 rakwb eng 004 510 DNB 06.00 bkl Nailwal, Kewal Krishan verfasserin aut A dual-criteria flow shop scheduling with sequence-dependent setup times 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm. Nutzungsrecht: © 2015 Taru Publications 2015 Operation time Scheduling Sequence-dependent setup time etc Breakdown interval Total elapsed time Operational cost Gupta, Deepak oth Sharma, Sameer oth Enthalten in Journal of information & optimization sciences Delhi : Analytic Publ. Co., 1980 36(2015), 5, Seite 485 (DE-627)130417920 (DE-600)627464-X (DE-576)9130417929 0252-2667 nnns volume:36 year:2015 number:5 pages:485 http://dx.doi.org/10.1080/02522667.2015.1026460 Volltext http://www.tandfonline.com/doi/abs/10.1080/02522667.2015.1026460 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-BUB SSG-OLC-MAT SSG-OPC-BBI SSG-OPC-MAT GBV_ILN_70 06.00 AVZ AR 36 2015 5 485 |
| spelling |
10.1080/02522667.2015.1026460 doi PQ20160617 (DE-627)OLC1968591524 (DE-599)GBVOLC1968591524 (PRQ)informaworld_taylorfrancis_10_1080_02522667_2015_10264600 (KEY)0105632820150000036000500485dualcriteriaflowshopschedulingwithsequencedependen DE-627 ger DE-627 rakwb eng 004 510 DNB 06.00 bkl Nailwal, Kewal Krishan verfasserin aut A dual-criteria flow shop scheduling with sequence-dependent setup times 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm. Nutzungsrecht: © 2015 Taru Publications 2015 Operation time Scheduling Sequence-dependent setup time etc Breakdown interval Total elapsed time Operational cost Gupta, Deepak oth Sharma, Sameer oth Enthalten in Journal of information & optimization sciences Delhi : Analytic Publ. Co., 1980 36(2015), 5, Seite 485 (DE-627)130417920 (DE-600)627464-X (DE-576)9130417929 0252-2667 nnns volume:36 year:2015 number:5 pages:485 http://dx.doi.org/10.1080/02522667.2015.1026460 Volltext http://www.tandfonline.com/doi/abs/10.1080/02522667.2015.1026460 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-BUB SSG-OLC-MAT SSG-OPC-BBI SSG-OPC-MAT GBV_ILN_70 06.00 AVZ AR 36 2015 5 485 |
| allfields_unstemmed |
10.1080/02522667.2015.1026460 doi PQ20160617 (DE-627)OLC1968591524 (DE-599)GBVOLC1968591524 (PRQ)informaworld_taylorfrancis_10_1080_02522667_2015_10264600 (KEY)0105632820150000036000500485dualcriteriaflowshopschedulingwithsequencedependen DE-627 ger DE-627 rakwb eng 004 510 DNB 06.00 bkl Nailwal, Kewal Krishan verfasserin aut A dual-criteria flow shop scheduling with sequence-dependent setup times 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm. Nutzungsrecht: © 2015 Taru Publications 2015 Operation time Scheduling Sequence-dependent setup time etc Breakdown interval Total elapsed time Operational cost Gupta, Deepak oth Sharma, Sameer oth Enthalten in Journal of information & optimization sciences Delhi : Analytic Publ. Co., 1980 36(2015), 5, Seite 485 (DE-627)130417920 (DE-600)627464-X (DE-576)9130417929 0252-2667 nnns volume:36 year:2015 number:5 pages:485 http://dx.doi.org/10.1080/02522667.2015.1026460 Volltext http://www.tandfonline.com/doi/abs/10.1080/02522667.2015.1026460 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-BUB SSG-OLC-MAT SSG-OPC-BBI SSG-OPC-MAT GBV_ILN_70 06.00 AVZ AR 36 2015 5 485 |
| allfieldsGer |
10.1080/02522667.2015.1026460 doi PQ20160617 (DE-627)OLC1968591524 (DE-599)GBVOLC1968591524 (PRQ)informaworld_taylorfrancis_10_1080_02522667_2015_10264600 (KEY)0105632820150000036000500485dualcriteriaflowshopschedulingwithsequencedependen DE-627 ger DE-627 rakwb eng 004 510 DNB 06.00 bkl Nailwal, Kewal Krishan verfasserin aut A dual-criteria flow shop scheduling with sequence-dependent setup times 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm. Nutzungsrecht: © 2015 Taru Publications 2015 Operation time Scheduling Sequence-dependent setup time etc Breakdown interval Total elapsed time Operational cost Gupta, Deepak oth Sharma, Sameer oth Enthalten in Journal of information & optimization sciences Delhi : Analytic Publ. Co., 1980 36(2015), 5, Seite 485 (DE-627)130417920 (DE-600)627464-X (DE-576)9130417929 0252-2667 nnns volume:36 year:2015 number:5 pages:485 http://dx.doi.org/10.1080/02522667.2015.1026460 Volltext http://www.tandfonline.com/doi/abs/10.1080/02522667.2015.1026460 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-BUB SSG-OLC-MAT SSG-OPC-BBI SSG-OPC-MAT GBV_ILN_70 06.00 AVZ AR 36 2015 5 485 |
| allfieldsSound |
10.1080/02522667.2015.1026460 doi PQ20160617 (DE-627)OLC1968591524 (DE-599)GBVOLC1968591524 (PRQ)informaworld_taylorfrancis_10_1080_02522667_2015_10264600 (KEY)0105632820150000036000500485dualcriteriaflowshopschedulingwithsequencedependen DE-627 ger DE-627 rakwb eng 004 510 DNB 06.00 bkl Nailwal, Kewal Krishan verfasserin aut A dual-criteria flow shop scheduling with sequence-dependent setup times 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm. Nutzungsrecht: © 2015 Taru Publications 2015 Operation time Scheduling Sequence-dependent setup time etc Breakdown interval Total elapsed time Operational cost Gupta, Deepak oth Sharma, Sameer oth Enthalten in Journal of information & optimization sciences Delhi : Analytic Publ. Co., 1980 36(2015), 5, Seite 485 (DE-627)130417920 (DE-600)627464-X (DE-576)9130417929 0252-2667 nnns volume:36 year:2015 number:5 pages:485 http://dx.doi.org/10.1080/02522667.2015.1026460 Volltext http://www.tandfonline.com/doi/abs/10.1080/02522667.2015.1026460 GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-BUB SSG-OLC-MAT SSG-OPC-BBI SSG-OPC-MAT GBV_ILN_70 06.00 AVZ AR 36 2015 5 485 |
| language |
English |
| source |
Enthalten in Journal of information & optimization sciences 36(2015), 5, Seite 485 volume:36 year:2015 number:5 pages:485 |
| sourceStr |
Enthalten in Journal of information & optimization sciences 36(2015), 5, Seite 485 volume:36 year:2015 number:5 pages:485 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Operation time Scheduling Sequence-dependent setup time etc Breakdown interval Total elapsed time Operational cost |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
Journal of information & optimization sciences |
| authorswithroles_txt_mv |
Nailwal, Kewal Krishan @@aut@@ Gupta, Deepak @@oth@@ Sharma, Sameer @@oth@@ |
| publishDateDaySort_date |
2015-01-01T00:00:00Z |
| hierarchy_top_id |
130417920 |
| dewey-sort |
14 |
| id |
OLC1968591524 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1968591524</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220215154817.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/02522667.2015.1026460</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1968591524</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1968591524</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)informaworld_taylorfrancis_10_1080_02522667_2015_10264600</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0105632820150000036000500485dualcriteriaflowshopschedulingwithsequencedependen</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">004</subfield><subfield code="a">510</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">06.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nailwal, Kewal Krishan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A dual-criteria flow shop scheduling with sequence-dependent setup times</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</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="520" ind1=" " ind2=" "><subfield code="a">Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2015 Taru Publications 2015</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operation time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequence-dependent setup time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">etc</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Breakdown interval</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Total elapsed time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operational cost</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gupta, Deepak</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sharma, Sameer</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of information & optimization sciences</subfield><subfield code="d">Delhi : Analytic Publ. Co., 1980</subfield><subfield code="g">36(2015), 5, Seite 485</subfield><subfield code="w">(DE-627)130417920</subfield><subfield code="w">(DE-600)627464-X</subfield><subfield code="w">(DE-576)9130417929</subfield><subfield code="x">0252-2667</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:36</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:5</subfield><subfield code="g">pages:485</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1080/02522667.2015.1026460</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.1080/02522667.2015.1026460</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-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">06.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">36</subfield><subfield code="j">2015</subfield><subfield code="e">5</subfield><subfield code="h">485</subfield></datafield></record></collection>
|
| author |
Nailwal, Kewal Krishan |
| spellingShingle |
Nailwal, Kewal Krishan ddc 004 bkl 06.00 misc Operation time misc Scheduling misc Sequence-dependent setup time misc etc misc Breakdown interval misc Total elapsed time misc Operational cost A dual-criteria flow shop scheduling with sequence-dependent setup times |
| authorStr |
Nailwal, Kewal Krishan |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)130417920 |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science 510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0252-2667 |
| topic_title |
004 510 DNB 06.00 bkl A dual-criteria flow shop scheduling with sequence-dependent setup times Operation time Scheduling Sequence-dependent setup time etc Breakdown interval Total elapsed time Operational cost |
| topic |
ddc 004 bkl 06.00 misc Operation time misc Scheduling misc Sequence-dependent setup time misc etc misc Breakdown interval misc Total elapsed time misc Operational cost |
| topic_unstemmed |
ddc 004 bkl 06.00 misc Operation time misc Scheduling misc Sequence-dependent setup time misc etc misc Breakdown interval misc Total elapsed time misc Operational cost |
| topic_browse |
ddc 004 bkl 06.00 misc Operation time misc Scheduling misc Sequence-dependent setup time misc etc misc Breakdown interval misc Total elapsed time misc Operational cost |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
d g dg s s ss |
| hierarchy_parent_title |
Journal of information & optimization sciences |
| hierarchy_parent_id |
130417920 |
| dewey-tens |
000 - Computer science, knowledge & systems 510 - Mathematics |
| hierarchy_top_title |
Journal of information & optimization sciences |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)130417920 (DE-600)627464-X (DE-576)9130417929 |
| title |
A dual-criteria flow shop scheduling with sequence-dependent setup times |
| ctrlnum |
(DE-627)OLC1968591524 (DE-599)GBVOLC1968591524 (PRQ)informaworld_taylorfrancis_10_1080_02522667_2015_10264600 (KEY)0105632820150000036000500485dualcriteriaflowshopschedulingwithsequencedependen |
| title_full |
A dual-criteria flow shop scheduling with sequence-dependent setup times |
| author_sort |
Nailwal, Kewal Krishan |
| journal |
Journal of information & optimization sciences |
| journalStr |
Journal of information & optimization sciences |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works 500 - Science |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
txt |
| container_start_page |
485 |
| author_browse |
Nailwal, Kewal Krishan |
| container_volume |
36 |
| class |
004 510 DNB 06.00 bkl |
| format_se |
Aufsätze |
| author-letter |
Nailwal, Kewal Krishan |
| doi_str_mv |
10.1080/02522667.2015.1026460 |
| dewey-full |
004 510 |
| title_sort |
dual-criteria flow shop scheduling with sequence-dependent setup times |
| title_auth |
A dual-criteria flow shop scheduling with sequence-dependent setup times |
| abstract |
Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm. |
| abstractGer |
Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm. |
| abstract_unstemmed |
Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-BUB SSG-OLC-MAT SSG-OPC-BBI SSG-OPC-MAT GBV_ILN_70 |
| container_issue |
5 |
| title_short |
A dual-criteria flow shop scheduling with sequence-dependent setup times |
| url |
http://dx.doi.org/10.1080/02522667.2015.1026460 http://www.tandfonline.com/doi/abs/10.1080/02522667.2015.1026460 |
| remote_bool |
false |
| author2 |
Gupta, Deepak Sharma, Sameer |
| author2Str |
Gupta, Deepak Sharma, Sameer |
| ppnlink |
130417920 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth |
| doi_str |
10.1080/02522667.2015.1026460 |
| up_date |
2024-07-04T03:45:24.516Z |
| _version_ |
1803618588583526400 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1968591524</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220215154817.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1080/02522667.2015.1026460</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1968591524</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1968591524</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)informaworld_taylorfrancis_10_1080_02522667_2015_10264600</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0105632820150000036000500485dualcriteriaflowshopschedulingwithsequencedependen</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">004</subfield><subfield code="a">510</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">06.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nailwal, Kewal Krishan</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A dual-criteria flow shop scheduling with sequence-dependent setup times</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</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="520" ind1=" " ind2=" "><subfield code="a">Sequence-dependent setup time is the most complicated case of setup time of jobs on machines in shop scheduling. The operational cost of machines is related to the setup time required for preparation of jobs on machines. The objective is to minimize operational cost of machines subject to minimum total elapsed time of jobs for two stage flow shop problem. The setups on both the machines for jobs are considered to be sequence-dependent. The machines having different traits processing for different jobs are attached with probabilities. In addition to this, the problem also takes the effect of breakdown interval during the operation of jobs on total elapsed time and hence on the operational cost. To solve the problem an algorithm is proposed and a numerical example is given to substantiate the algorithm.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © 2015 Taru Publications 2015</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operation time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Sequence-dependent setup time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">etc</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Breakdown interval</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Total elapsed time</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Operational cost</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Gupta, Deepak</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sharma, Sameer</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of information & optimization sciences</subfield><subfield code="d">Delhi : Analytic Publ. Co., 1980</subfield><subfield code="g">36(2015), 5, Seite 485</subfield><subfield code="w">(DE-627)130417920</subfield><subfield code="w">(DE-600)627464-X</subfield><subfield code="w">(DE-576)9130417929</subfield><subfield code="x">0252-2667</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:36</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:5</subfield><subfield code="g">pages:485</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1080/02522667.2015.1026460</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">http://www.tandfonline.com/doi/abs/10.1080/02522667.2015.1026460</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-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">06.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">36</subfield><subfield code="j">2015</subfield><subfield code="e">5</subfield><subfield code="h">485</subfield></datafield></record></collection>
|
| score |
7.3996572 |