Starting-time decisions in labor tour scheduling: An experimental analysis and case study
Many service organizations limit the number of daily planning periods in which employees may begin their shifts to a fixed number, S. Even for relatively small values of S, which are quite common in practice, there may be hundreds, thousands or millions of possible subsets of starting times. This pa...
Gespeichert in:
| Veröffentlicht in: | European journal of operational research 2001-06, Vol.131 (3), p.459-475 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 475 |
|---|---|
| container_issue | 3 |
| container_start_page | 459 |
| container_title | European journal of operational research |
| container_volume | 131 |
| creator | Brusco, Michael J Jacobs, Larry W |
| description | Many service organizations limit the number of daily planning periods in which employees may begin their shifts to a fixed number,
S. Even for relatively small values of
S, which are quite common in practice, there may be hundreds, thousands or millions of possible subsets of starting times. This paper presents the results of a large experimental study that revealed that, in many instances, only a very small portion of starting-time subsets was capable of providing the minimum workforce size. The importance of effective starting-time selection is further supported by a case study that describes a spreadsheet-based program designed for scheduling customer service representatives in the System Support Center, United States and Canada Group, Radio Network Solutions Group, Land Mobile Products Sector, Motorola. |
| doi_str_mv | 10.1016/S0377-2217(00)00135-1 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_204140422</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221700001351</els_id><sourcerecordid>73018685</sourcerecordid><originalsourceid>FETCH-LOGICAL-c402t-6ad20cf5f8597700bb8522b7cae9df029ad8fe18f3c21470c2a838c3130c8bd03</originalsourceid><addsrcrecordid>eNqFkDFPHDEQha0oSLlAfkIkiwqKTcb2-uyjQQhBQCBRkBSpLK89Cz4tuxvbh7h_n4GLaGPpeab43ujpMfZVwDcBYvn9HpQxjZTCHAEcAwilG_GBLYQ1slnaJXxki3fkE_tcyhqI0kIv2O_76nNN40NT0xPyiCGVNI2Fp5EPvpsyr9Mm8xIeMW4G4k742cjxZcZM_Fj9wP3oh21JhZbIgy_IS93E7QHb6_1Q8Mu_uc9-XV78PL9qbu9-XJ-f3TahBVmbpY8SQq97q1fGAHSd1VJ2JnhcxR7kykfbo7C9ClK0BoL0VtmghIJguwhqnx3u7s55-rPBUt2aElOm4iS0ooVWSoL0Dgp5KiVj72bK7_PWCXCvJbq3Et1rQw7AvZXoBPludr6MM4Z3E9JbTxmLe3bKCyXo35Ik-WgkkiLNpFavXGu0e6xPdO10dw2pj-eE2ZWQcAwYU8ZQXZzSf_L8BdV3kq4</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>204140422</pqid></control><display><type>article</type><title>Starting-time decisions in labor tour scheduling: An experimental analysis and case study</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Brusco, Michael J ; Jacobs, Larry W</creator><creatorcontrib>Brusco, Michael J ; Jacobs, Larry W</creatorcontrib><description>Many service organizations limit the number of daily planning periods in which employees may begin their shifts to a fixed number,
S. Even for relatively small values of
S, which are quite common in practice, there may be hundreds, thousands or millions of possible subsets of starting times. This paper presents the results of a large experimental study that revealed that, in many instances, only a very small portion of starting-time subsets was capable of providing the minimum workforce size. The importance of effective starting-time selection is further supported by a case study that describes a spreadsheet-based program designed for scheduling customer service representatives in the System Support Center, United States and Canada Group, Radio Network Solutions Group, Land Mobile Products Sector, Motorola.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/S0377-2217(00)00135-1</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Call centers ; Decision making ; Heuristic ; Heuristics ; Integer programming ; Scheduling ; Studies</subject><ispartof>European journal of operational research, 2001-06, Vol.131 (3), p.459-475</ispartof><rights>2001 Elsevier Science B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Jun 16, 2001</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c402t-6ad20cf5f8597700bb8522b7cae9df029ad8fe18f3c21470c2a838c3130c8bd03</citedby><cites>FETCH-LOGICAL-c402t-6ad20cf5f8597700bb8522b7cae9df029ad8fe18f3c21470c2a838c3130c8bd03</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/S0377-2217(00)00135-1$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3536,3993,27903,27904,45974</link.rule.ids><backlink>$$Uhttp://econpapers.repec.org/article/eeeejores/v_3a131_3ay_3a2001_3ai_3a3_3ap_3a459-475.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Brusco, Michael J</creatorcontrib><creatorcontrib>Jacobs, Larry W</creatorcontrib><title>Starting-time decisions in labor tour scheduling: An experimental analysis and case study</title><title>European journal of operational research</title><description>Many service organizations limit the number of daily planning periods in which employees may begin their shifts to a fixed number,
S. Even for relatively small values of
S, which are quite common in practice, there may be hundreds, thousands or millions of possible subsets of starting times. This paper presents the results of a large experimental study that revealed that, in many instances, only a very small portion of starting-time subsets was capable of providing the minimum workforce size. The importance of effective starting-time selection is further supported by a case study that describes a spreadsheet-based program designed for scheduling customer service representatives in the System Support Center, United States and Canada Group, Radio Network Solutions Group, Land Mobile Products Sector, Motorola.</description><subject>Call centers</subject><subject>Decision making</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Integer programming</subject><subject>Scheduling</subject><subject>Studies</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2001</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNqFkDFPHDEQha0oSLlAfkIkiwqKTcb2-uyjQQhBQCBRkBSpLK89Cz4tuxvbh7h_n4GLaGPpeab43ujpMfZVwDcBYvn9HpQxjZTCHAEcAwilG_GBLYQ1slnaJXxki3fkE_tcyhqI0kIv2O_76nNN40NT0xPyiCGVNI2Fp5EPvpsyr9Mm8xIeMW4G4k742cjxZcZM_Fj9wP3oh21JhZbIgy_IS93E7QHb6_1Q8Mu_uc9-XV78PL9qbu9-XJ-f3TahBVmbpY8SQq97q1fGAHSd1VJ2JnhcxR7kykfbo7C9ClK0BoL0VtmghIJguwhqnx3u7s55-rPBUt2aElOm4iS0ooVWSoL0Dgp5KiVj72bK7_PWCXCvJbq3Et1rQw7AvZXoBPludr6MM4Z3E9JbTxmLe3bKCyXo35Ik-WgkkiLNpFavXGu0e6xPdO10dw2pj-eE2ZWQcAwYU8ZQXZzSf_L8BdV3kq4</recordid><startdate>20010616</startdate><enddate>20010616</enddate><creator>Brusco, Michael J</creator><creator>Jacobs, Larry W</creator><general>Elsevier B.V</general><general>Elsevier</general><general>Elsevier Sequoia S.A</general><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20010616</creationdate><title>Starting-time decisions in labor tour scheduling: An experimental analysis and case study</title><author>Brusco, Michael J ; Jacobs, Larry W</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c402t-6ad20cf5f8597700bb8522b7cae9df029ad8fe18f3c21470c2a838c3130c8bd03</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2001</creationdate><topic>Call centers</topic><topic>Decision making</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Integer programming</topic><topic>Scheduling</topic><topic>Studies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Brusco, Michael J</creatorcontrib><creatorcontrib>Jacobs, Larry W</creatorcontrib><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Brusco, Michael J</au><au>Jacobs, Larry W</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Starting-time decisions in labor tour scheduling: An experimental analysis and case study</atitle><jtitle>European journal of operational research</jtitle><date>2001-06-16</date><risdate>2001</risdate><volume>131</volume><issue>3</issue><spage>459</spage><epage>475</epage><pages>459-475</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>Many service organizations limit the number of daily planning periods in which employees may begin their shifts to a fixed number,
S. Even for relatively small values of
S, which are quite common in practice, there may be hundreds, thousands or millions of possible subsets of starting times. This paper presents the results of a large experimental study that revealed that, in many instances, only a very small portion of starting-time subsets was capable of providing the minimum workforce size. The importance of effective starting-time selection is further supported by a case study that describes a spreadsheet-based program designed for scheduling customer service representatives in the System Support Center, United States and Canada Group, Radio Network Solutions Group, Land Mobile Products Sector, Motorola.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/S0377-2217(00)00135-1</doi><tpages>17</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0377-2217 |
| ispartof | European journal of operational research, 2001-06, Vol.131 (3), p.459-475 |
| issn | 0377-2217 1872-6860 |
| language | eng |
| recordid | cdi_proquest_journals_204140422 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | Call centers Decision making Heuristic Heuristics Integer programming Scheduling Studies |
| title | Starting-time decisions in labor tour scheduling: An experimental analysis and case study |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T19%3A52%3A11IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Starting-time%20decisions%20in%20labor%20tour%20scheduling:%20An%20experimental%20analysis%20and%20case%20study&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Brusco,%20Michael%20J&rft.date=2001-06-16&rft.volume=131&rft.issue=3&rft.spage=459&rft.epage=475&rft.pages=459-475&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/S0377-2217(00)00135-1&rft_dat=%3Cproquest_cross%3E73018685%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=204140422&rft_id=info:pmid/&rft_els_id=S0377221700001351&rfr_iscdi=true |