Single-machine multitasking scheduling with job efficiency promotion
Abstract Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the primary task is assumed to be interrupted by every waiting task. In this paper we ta...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Ji, Min [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2022 |
|---|
| Schlagwörter: |
|---|
| Anmerkung: |
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 |
|---|
| Übergeordnetes Werk: |
Enthalten in: Journal of combinatorial optimization - Springer US, 1997, 44(2022), 1 vom: 18. Jan., Seite 446-479 |
|---|---|
| Übergeordnetes Werk: |
volume:44 ; year:2022 ; number:1 ; day:18 ; month:01 ; pages:446-479 |
| Links: |
|---|
| DOI / URN: |
10.1007/s10878-021-00822-1 |
|---|
| Katalog-ID: |
OLC2079251031 |
|---|
| LEADER | 01000caa a22002652 4500 | ||
|---|---|---|---|
| 001 | OLC2079251031 | ||
| 003 | DE-627 | ||
| 005 | 20230506050300.0 | ||
| 007 | tu | ||
| 008 | 221220s2022 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1007/s10878-021-00822-1 |2 doi | |
| 035 | |a (DE-627)OLC2079251031 | ||
| 035 | |a (DE-He213)s10878-021-00822-1-p | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 510 |q VZ |
| 084 | |a 3,2 |2 ssgn | ||
| 100 | 1 | |a Ji, Min |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Single-machine multitasking scheduling with job efficiency promotion |
| 264 | 1 | |c 2022 | |
| 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 © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 | ||
| 520 | |a Abstract Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the primary task is assumed to be interrupted by every waiting task. In this paper we take into account job efficiency promotion that helps reduce the actual interruption time. We propose two functions to model job efficiency promotion based on the job positions in a given schedule. The objective is to minimize the makespan, total completion time, and total absolute difference in completion times. We show that the problem is polynomially solvable for each objective. We also provide efficient solutions for some special cases. | ||
| 650 | 4 | |a Scheduling | |
| 650 | 4 | |a Multitasking scheduling | |
| 650 | 4 | |a Human multitasking | |
| 650 | 4 | |a Efficiency promotion | |
| 650 | 4 | |a Single machine | |
| 650 | 4 | |a Optimization | |
| 700 | 1 | |a Zhang, Yingchun |4 aut | |
| 700 | 1 | |a Zhang, Yuan |4 aut | |
| 700 | 1 | |a Cheng, T. C. E. |4 aut | |
| 700 | 1 | |a Jiang, Yiwei |4 aut | |
| 773 | 0 | 8 | |i Enthalten in |t Journal of combinatorial optimization |d Springer US, 1997 |g 44(2022), 1 vom: 18. Jan., Seite 446-479 |w (DE-627)216539323 |w (DE-600)1339574-9 |w (DE-576)094421935 |x 1382-6905 |7 nnns |
| 773 | 1 | 8 | |g volume:44 |g year:2022 |g number:1 |g day:18 |g month:01 |g pages:446-479 |
| 856 | 4 | 1 | |u https://doi.org/10.1007/s10878-021-00822-1 |z lizenzpflichtig |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-WIW | ||
| 912 | |a SSG-OPC-MAT | ||
| 912 | |a GBV_ILN_2108 | ||
| 951 | |a AR | ||
| 952 | |d 44 |j 2022 |e 1 |b 18 |c 01 |h 446-479 | ||
| author_variant |
m j mj y z yz y z yz t c e c tce tcec y j yj |
|---|---|
| matchkey_str |
article:13826905:2022----::igeahnmliaknshdlnwtjbf |
| hierarchy_sort_str |
2022 |
| publishDate |
2022 |
| allfields |
10.1007/s10878-021-00822-1 doi (DE-627)OLC2079251031 (DE-He213)s10878-021-00822-1-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Ji, Min verfasserin aut Single-machine multitasking scheduling with job efficiency promotion 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 Abstract Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the primary task is assumed to be interrupted by every waiting task. In this paper we take into account job efficiency promotion that helps reduce the actual interruption time. We propose two functions to model job efficiency promotion based on the job positions in a given schedule. The objective is to minimize the makespan, total completion time, and total absolute difference in completion times. We show that the problem is polynomially solvable for each objective. We also provide efficient solutions for some special cases. Scheduling Multitasking scheduling Human multitasking Efficiency promotion Single machine Optimization Zhang, Yingchun aut Zhang, Yuan aut Cheng, T. C. E. aut Jiang, Yiwei aut Enthalten in Journal of combinatorial optimization Springer US, 1997 44(2022), 1 vom: 18. Jan., Seite 446-479 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:44 year:2022 number:1 day:18 month:01 pages:446-479 https://doi.org/10.1007/s10878-021-00822-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_2108 AR 44 2022 1 18 01 446-479 |
| spelling |
10.1007/s10878-021-00822-1 doi (DE-627)OLC2079251031 (DE-He213)s10878-021-00822-1-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Ji, Min verfasserin aut Single-machine multitasking scheduling with job efficiency promotion 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 Abstract Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the primary task is assumed to be interrupted by every waiting task. In this paper we take into account job efficiency promotion that helps reduce the actual interruption time. We propose two functions to model job efficiency promotion based on the job positions in a given schedule. The objective is to minimize the makespan, total completion time, and total absolute difference in completion times. We show that the problem is polynomially solvable for each objective. We also provide efficient solutions for some special cases. Scheduling Multitasking scheduling Human multitasking Efficiency promotion Single machine Optimization Zhang, Yingchun aut Zhang, Yuan aut Cheng, T. C. E. aut Jiang, Yiwei aut Enthalten in Journal of combinatorial optimization Springer US, 1997 44(2022), 1 vom: 18. Jan., Seite 446-479 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:44 year:2022 number:1 day:18 month:01 pages:446-479 https://doi.org/10.1007/s10878-021-00822-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_2108 AR 44 2022 1 18 01 446-479 |
| allfields_unstemmed |
10.1007/s10878-021-00822-1 doi (DE-627)OLC2079251031 (DE-He213)s10878-021-00822-1-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Ji, Min verfasserin aut Single-machine multitasking scheduling with job efficiency promotion 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 Abstract Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the primary task is assumed to be interrupted by every waiting task. In this paper we take into account job efficiency promotion that helps reduce the actual interruption time. We propose two functions to model job efficiency promotion based on the job positions in a given schedule. The objective is to minimize the makespan, total completion time, and total absolute difference in completion times. We show that the problem is polynomially solvable for each objective. We also provide efficient solutions for some special cases. Scheduling Multitasking scheduling Human multitasking Efficiency promotion Single machine Optimization Zhang, Yingchun aut Zhang, Yuan aut Cheng, T. C. E. aut Jiang, Yiwei aut Enthalten in Journal of combinatorial optimization Springer US, 1997 44(2022), 1 vom: 18. Jan., Seite 446-479 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:44 year:2022 number:1 day:18 month:01 pages:446-479 https://doi.org/10.1007/s10878-021-00822-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_2108 AR 44 2022 1 18 01 446-479 |
| allfieldsGer |
10.1007/s10878-021-00822-1 doi (DE-627)OLC2079251031 (DE-He213)s10878-021-00822-1-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Ji, Min verfasserin aut Single-machine multitasking scheduling with job efficiency promotion 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 Abstract Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the primary task is assumed to be interrupted by every waiting task. In this paper we take into account job efficiency promotion that helps reduce the actual interruption time. We propose two functions to model job efficiency promotion based on the job positions in a given schedule. The objective is to minimize the makespan, total completion time, and total absolute difference in completion times. We show that the problem is polynomially solvable for each objective. We also provide efficient solutions for some special cases. Scheduling Multitasking scheduling Human multitasking Efficiency promotion Single machine Optimization Zhang, Yingchun aut Zhang, Yuan aut Cheng, T. C. E. aut Jiang, Yiwei aut Enthalten in Journal of combinatorial optimization Springer US, 1997 44(2022), 1 vom: 18. Jan., Seite 446-479 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:44 year:2022 number:1 day:18 month:01 pages:446-479 https://doi.org/10.1007/s10878-021-00822-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_2108 AR 44 2022 1 18 01 446-479 |
| allfieldsSound |
10.1007/s10878-021-00822-1 doi (DE-627)OLC2079251031 (DE-He213)s10878-021-00822-1-p DE-627 ger DE-627 rakwb eng 510 VZ 3,2 ssgn Ji, Min verfasserin aut Single-machine multitasking scheduling with job efficiency promotion 2022 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 Abstract Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the primary task is assumed to be interrupted by every waiting task. In this paper we take into account job efficiency promotion that helps reduce the actual interruption time. We propose two functions to model job efficiency promotion based on the job positions in a given schedule. The objective is to minimize the makespan, total completion time, and total absolute difference in completion times. We show that the problem is polynomially solvable for each objective. We also provide efficient solutions for some special cases. Scheduling Multitasking scheduling Human multitasking Efficiency promotion Single machine Optimization Zhang, Yingchun aut Zhang, Yuan aut Cheng, T. C. E. aut Jiang, Yiwei aut Enthalten in Journal of combinatorial optimization Springer US, 1997 44(2022), 1 vom: 18. Jan., Seite 446-479 (DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 1382-6905 nnns volume:44 year:2022 number:1 day:18 month:01 pages:446-479 https://doi.org/10.1007/s10878-021-00822-1 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_2108 AR 44 2022 1 18 01 446-479 |
| language |
English |
| source |
Enthalten in Journal of combinatorial optimization 44(2022), 1 vom: 18. Jan., Seite 446-479 volume:44 year:2022 number:1 day:18 month:01 pages:446-479 |
| sourceStr |
Enthalten in Journal of combinatorial optimization 44(2022), 1 vom: 18. Jan., Seite 446-479 volume:44 year:2022 number:1 day:18 month:01 pages:446-479 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Scheduling Multitasking scheduling Human multitasking Efficiency promotion Single machine Optimization |
| dewey-raw |
510 |
| isfreeaccess_bool |
false |
| container_title |
Journal of combinatorial optimization |
| authorswithroles_txt_mv |
Ji, Min @@aut@@ Zhang, Yingchun @@aut@@ Zhang, Yuan @@aut@@ Cheng, T. C. E. @@aut@@ Jiang, Yiwei @@aut@@ |
| publishDateDaySort_date |
2022-01-18T00:00:00Z |
| hierarchy_top_id |
216539323 |
| dewey-sort |
3510 |
| id |
OLC2079251031 |
| 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">OLC2079251031</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506050300.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2022 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10878-021-00822-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2079251031</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10878-021-00822-1-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">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ji, Min</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Single-machine multitasking scheduling with job efficiency promotion</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</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">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the primary task is assumed to be interrupted by every waiting task. In this paper we take into account job efficiency promotion that helps reduce the actual interruption time. We propose two functions to model job efficiency promotion based on the job positions in a given schedule. The objective is to minimize the makespan, total completion time, and total absolute difference in completion times. We show that the problem is polynomially solvable for each objective. We also provide efficient solutions for some special cases.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multitasking scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Human multitasking</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Efficiency promotion</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Single machine</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Yingchun</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Yuan</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cheng, T. C. E.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jiang, Yiwei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of combinatorial optimization</subfield><subfield code="d">Springer US, 1997</subfield><subfield code="g">44(2022), 1 vom: 18. Jan., Seite 446-479</subfield><subfield code="w">(DE-627)216539323</subfield><subfield code="w">(DE-600)1339574-9</subfield><subfield code="w">(DE-576)094421935</subfield><subfield code="x">1382-6905</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:44</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:1</subfield><subfield code="g">day:18</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:446-479</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10878-021-00822-1</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-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</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_2108</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">44</subfield><subfield code="j">2022</subfield><subfield code="e">1</subfield><subfield code="b">18</subfield><subfield code="c">01</subfield><subfield code="h">446-479</subfield></datafield></record></collection>
|
| author |
Ji, Min |
| spellingShingle |
Ji, Min ddc 510 ssgn 3,2 misc Scheduling misc Multitasking scheduling misc Human multitasking misc Efficiency promotion misc Single machine misc Optimization Single-machine multitasking scheduling with job efficiency promotion |
| authorStr |
Ji, Min |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)216539323 |
| format |
Article |
| dewey-ones |
510 - Mathematics |
| delete_txt_mv |
keep |
| author_role |
aut aut aut aut aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
1382-6905 |
| topic_title |
510 VZ 3,2 ssgn Single-machine multitasking scheduling with job efficiency promotion Scheduling Multitasking scheduling Human multitasking Efficiency promotion Single machine Optimization |
| topic |
ddc 510 ssgn 3,2 misc Scheduling misc Multitasking scheduling misc Human multitasking misc Efficiency promotion misc Single machine misc Optimization |
| topic_unstemmed |
ddc 510 ssgn 3,2 misc Scheduling misc Multitasking scheduling misc Human multitasking misc Efficiency promotion misc Single machine misc Optimization |
| topic_browse |
ddc 510 ssgn 3,2 misc Scheduling misc Multitasking scheduling misc Human multitasking misc Efficiency promotion misc Single machine misc Optimization |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| hierarchy_parent_title |
Journal of combinatorial optimization |
| hierarchy_parent_id |
216539323 |
| dewey-tens |
510 - Mathematics |
| hierarchy_top_title |
Journal of combinatorial optimization |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)216539323 (DE-600)1339574-9 (DE-576)094421935 |
| title |
Single-machine multitasking scheduling with job efficiency promotion |
| ctrlnum |
(DE-627)OLC2079251031 (DE-He213)s10878-021-00822-1-p |
| title_full |
Single-machine multitasking scheduling with job efficiency promotion |
| author_sort |
Ji, Min |
| journal |
Journal of combinatorial optimization |
| journalStr |
Journal of combinatorial optimization |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
500 - Science |
| recordtype |
marc |
| publishDateSort |
2022 |
| contenttype_str_mv |
txt |
| container_start_page |
446 |
| author_browse |
Ji, Min Zhang, Yingchun Zhang, Yuan Cheng, T. C. E. Jiang, Yiwei |
| container_volume |
44 |
| class |
510 VZ 3,2 ssgn |
| format_se |
Aufsätze |
| author-letter |
Ji, Min |
| doi_str_mv |
10.1007/s10878-021-00822-1 |
| dewey-full |
510 |
| title_sort |
single-machine multitasking scheduling with job efficiency promotion |
| title_auth |
Single-machine multitasking scheduling with job efficiency promotion |
| abstract |
Abstract Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the primary task is assumed to be interrupted by every waiting task. In this paper we take into account job efficiency promotion that helps reduce the actual interruption time. We propose two functions to model job efficiency promotion based on the job positions in a given schedule. The objective is to minimize the makespan, total completion time, and total absolute difference in completion times. We show that the problem is polynomially solvable for each objective. We also provide efficient solutions for some special cases. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 |
| abstractGer |
Abstract Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the primary task is assumed to be interrupted by every waiting task. In this paper we take into account job efficiency promotion that helps reduce the actual interruption time. We propose two functions to model job efficiency promotion based on the job positions in a given schedule. The objective is to minimize the makespan, total completion time, and total absolute difference in completion times. We show that the problem is polynomially solvable for each objective. We also provide efficient solutions for some special cases. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 |
| abstract_unstemmed |
Abstract Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the primary task is assumed to be interrupted by every waiting task. In this paper we take into account job efficiency promotion that helps reduce the actual interruption time. We propose two functions to model job efficiency promotion based on the job positions in a given schedule. The objective is to minimize the makespan, total completion time, and total absolute difference in completion times. We show that the problem is polynomially solvable for each objective. We also provide efficient solutions for some special cases. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021 |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-WIW SSG-OPC-MAT GBV_ILN_2108 |
| container_issue |
1 |
| title_short |
Single-machine multitasking scheduling with job efficiency promotion |
| url |
https://doi.org/10.1007/s10878-021-00822-1 |
| remote_bool |
false |
| author2 |
Zhang, Yingchun Zhang, Yuan Cheng, T. C. E. Jiang, Yiwei |
| author2Str |
Zhang, Yingchun Zhang, Yuan Cheng, T. C. E. Jiang, Yiwei |
| ppnlink |
216539323 |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| doi_str |
10.1007/s10878-021-00822-1 |
| up_date |
2024-07-04T00:09:41.176Z |
| _version_ |
1803605016500502528 |
| 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">OLC2079251031</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230506050300.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">221220s2022 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10878-021-00822-1</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2079251031</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10878-021-00822-1-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">510</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">3,2</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Ji, Min</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Single-machine multitasking scheduling with job efficiency promotion</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2022</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">© The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2021</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Motivated by behavioural and psychological phenomena that occur in human operators, we study single-machine multitasking scheduling with job efficiency promotion. In traditional multitasking scheduling, the primary task is assumed to be interrupted by every waiting task. In this paper we take into account job efficiency promotion that helps reduce the actual interruption time. We propose two functions to model job efficiency promotion based on the job positions in a given schedule. The objective is to minimize the makespan, total completion time, and total absolute difference in completion times. We show that the problem is polynomially solvable for each objective. We also provide efficient solutions for some special cases.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Multitasking scheduling</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Human multitasking</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Efficiency promotion</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Single machine</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Optimization</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Yingchun</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Zhang, Yuan</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Cheng, T. C. E.</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Jiang, Yiwei</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Journal of combinatorial optimization</subfield><subfield code="d">Springer US, 1997</subfield><subfield code="g">44(2022), 1 vom: 18. Jan., Seite 446-479</subfield><subfield code="w">(DE-627)216539323</subfield><subfield code="w">(DE-600)1339574-9</subfield><subfield code="w">(DE-576)094421935</subfield><subfield code="x">1382-6905</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:44</subfield><subfield code="g">year:2022</subfield><subfield code="g">number:1</subfield><subfield code="g">day:18</subfield><subfield code="g">month:01</subfield><subfield code="g">pages:446-479</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10878-021-00822-1</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-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-WIW</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_2108</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">44</subfield><subfield code="j">2022</subfield><subfield code="e">1</subfield><subfield code="b">18</subfield><subfield code="c">01</subfield><subfield code="h">446-479</subfield></datafield></record></collection>
|
| score |
7.3982754 |