Microcomputer-based working set generation methods for personnel scheduling
Presents a new approach to working set generation for personnel scheduling problems. In full-time (FT) and mixed-workforce (MW) experiments, generates the schedules in the working sets from the use of two-phase heuristic labour scheduling solution procedures. The solution procedures were implemented...
Gespeichert in:
| Veröffentlicht in: | International journal of operations & production management 1995-10, Vol.15 (10), p.63-74 |
|---|---|
| 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 | 74 |
|---|---|
| container_issue | 10 |
| container_start_page | 63 |
| container_title | International journal of operations & production management |
| container_volume | 15 |
| creator | Bechtold, Stephen E. Brusco, Michael J. |
| description | Presents a new approach to working set generation for personnel
scheduling problems. In full-time (FT) and mixed-workforce (MW)
experiments, generates the schedules in the working sets from the use of
two-phase heuristic labour scheduling solution procedures. The solution
procedures were implemented on a 386 microcomputer and did not require
the specification of the size of the working sets in advance. In the FT
experiment, the general set-covering formulations (GSCFs) associated
with the produced working sets were solved with integer programming. The
new working set procedure yielded optimal integer solutions for all 36
test problems in the FT experiment. Owing to the size and complexity of
the problem data in the MW experiment, the GSCFs associated with the
working sets were solved with linear programming, and heuristic rounding
procedures were applied to obtain feasible integer solutions. The mean
labour costs of these solutions averaged 0.69 per cent less than the
mean cost of solutions obtained via the application of heuristic
rounding procedures applied to the linear programme solutions for the
GSCFs associated with the master sets. Compares solution costs for the
new working set method with those associated with other working set
generation refinement procedures. Results indicate that the new method
produces lower solution costs in less control processing unit time. |
| doi_str_mv | 10.1108/01443579510098329 |
| format | Article |
| fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_miscellaneous_35254599</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A17844073</galeid><sourcerecordid>A17844073</sourcerecordid><originalsourceid>FETCH-LOGICAL-c513t-121f00ddf18e45dd9edbe76342b6fd97dfa75e523cb1b52b6f533ca1e54c8b663</originalsourceid><addsrcrecordid>eNqF0t1r1TAUAPAgCl6nf4BvRcEn63Ly0TSPY_gx3NjLfA5pcnLX2TY1aRn-96ZcUXB3SB4CJ7-cnCSHkNdAPwDQ9pSCEFwqLYFS3XKmn5AdKNnWjdT8Kdlt63UB6jl5kfMdpZRxkDvy9ap3Kbo4zuuCqe5sRl_dx_S9n_ZVxqXa44TJLn2cqhGX2-hzFWKqZkw5ThMOVXa36Neh-JfkWbBDxle_5xPy7dPHm_Mv9eX154vzs8vaSeBLDQwCpd4HaFFI7zX6DlXDBeua4LXywSqJknHXQSe3oOTcWUApXNs1DT8h7w555xR_rJgXM_bZ4TDYCeOaDZdMCqn1fyHTnLdKQ4Fv_oF3cU1TuYRhnPGGKbaht48hYFqVPKwRRb0_qL0d0PRTiEuy7vCKQ5ww9CV8BqoVgipeeH2El-Fx7N0xDwdffi3nhMHMqR9t-mmAmq0TzINO-FsSjlsR_s-WB9TMPhROj_PHT_gFy-bAeA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>232362721</pqid></control><display><type>article</type><title>Microcomputer-based working set generation methods for personnel scheduling</title><source>Periodicals Index Online</source><source>Emerald Journals</source><creator>Bechtold, Stephen E. ; Brusco, Michael J.</creator><creatorcontrib>Bechtold, Stephen E. ; Brusco, Michael J.</creatorcontrib><description>Presents a new approach to working set generation for personnel
scheduling problems. In full-time (FT) and mixed-workforce (MW)
experiments, generates the schedules in the working sets from the use of
two-phase heuristic labour scheduling solution procedures. The solution
procedures were implemented on a 386 microcomputer and did not require
the specification of the size of the working sets in advance. In the FT
experiment, the general set-covering formulations (GSCFs) associated
with the produced working sets were solved with integer programming. The
new working set procedure yielded optimal integer solutions for all 36
test problems in the FT experiment. Owing to the size and complexity of
the problem data in the MW experiment, the GSCFs associated with the
working sets were solved with linear programming, and heuristic rounding
procedures were applied to obtain feasible integer solutions. The mean
labour costs of these solutions averaged 0.69 per cent less than the
mean cost of solutions obtained via the application of heuristic
rounding procedures applied to the linear programme solutions for the
GSCFs associated with the master sets. Compares solution costs for the
new working set method with those associated with other working set
generation refinement procedures. Results indicate that the new method
produces lower solution costs in less control processing unit time.</description><identifier>ISSN: 0144-3577</identifier><identifier>EISSN: 1758-6593</identifier><identifier>DOI: 10.1108/01443579510098329</identifier><identifier>CODEN: IOPMDU</identifier><language>eng</language><publisher>Bradford: MCB UP Ltd</publisher><subject>Ceramics ; Costs ; Employees ; Experiments ; Heuristic ; Human resource management ; Integer programming ; Linear programming ; Mathematical programming ; Methods ; Scheduling ; Scheduling (Management) ; Technology application ; Test equipment ; Workforce</subject><ispartof>International journal of operations & production management, 1995-10, Vol.15 (10), p.63-74</ispartof><rights>MCB UP Limited</rights><rights>COPYRIGHT 1995 Emerald Group Publishing, Ltd.</rights><rights>MCB UP Limited 1995</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c513t-121f00ddf18e45dd9edbe76342b6fd97dfa75e523cb1b52b6f533ca1e54c8b663</citedby><cites>FETCH-LOGICAL-c513t-121f00ddf18e45dd9edbe76342b6fd97dfa75e523cb1b52b6f533ca1e54c8b663</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.emerald.com/insight/content/doi/10.1108/01443579510098329/full/pdf$$EPDF$$P50$$Gemerald$$H</linktopdf><linktohtml>$$Uhttps://www.emerald.com/insight/content/doi/10.1108/01443579510098329/full/html$$EHTML$$P50$$Gemerald$$H</linktohtml><link.rule.ids>314,777,781,962,11616,27850,27905,27906,52667,52670</link.rule.ids></links><search><creatorcontrib>Bechtold, Stephen E.</creatorcontrib><creatorcontrib>Brusco, Michael J.</creatorcontrib><title>Microcomputer-based working set generation methods for personnel scheduling</title><title>International journal of operations & production management</title><description>Presents a new approach to working set generation for personnel
scheduling problems. In full-time (FT) and mixed-workforce (MW)
experiments, generates the schedules in the working sets from the use of
two-phase heuristic labour scheduling solution procedures. The solution
procedures were implemented on a 386 microcomputer and did not require
the specification of the size of the working sets in advance. In the FT
experiment, the general set-covering formulations (GSCFs) associated
with the produced working sets were solved with integer programming. The
new working set procedure yielded optimal integer solutions for all 36
test problems in the FT experiment. Owing to the size and complexity of
the problem data in the MW experiment, the GSCFs associated with the
working sets were solved with linear programming, and heuristic rounding
procedures were applied to obtain feasible integer solutions. The mean
labour costs of these solutions averaged 0.69 per cent less than the
mean cost of solutions obtained via the application of heuristic
rounding procedures applied to the linear programme solutions for the
GSCFs associated with the master sets. Compares solution costs for the
new working set method with those associated with other working set
generation refinement procedures. Results indicate that the new method
produces lower solution costs in less control processing unit time.</description><subject>Ceramics</subject><subject>Costs</subject><subject>Employees</subject><subject>Experiments</subject><subject>Heuristic</subject><subject>Human resource management</subject><subject>Integer programming</subject><subject>Linear programming</subject><subject>Mathematical programming</subject><subject>Methods</subject><subject>Scheduling</subject><subject>Scheduling (Management)</subject><subject>Technology application</subject><subject>Test equipment</subject><subject>Workforce</subject><issn>0144-3577</issn><issn>1758-6593</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1995</creationdate><recordtype>article</recordtype><sourceid>K30</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNqF0t1r1TAUAPAgCl6nf4BvRcEn63Ly0TSPY_gx3NjLfA5pcnLX2TY1aRn-96ZcUXB3SB4CJ7-cnCSHkNdAPwDQ9pSCEFwqLYFS3XKmn5AdKNnWjdT8Kdlt63UB6jl5kfMdpZRxkDvy9ap3Kbo4zuuCqe5sRl_dx_S9n_ZVxqXa44TJLn2cqhGX2-hzFWKqZkw5ThMOVXa36Neh-JfkWbBDxle_5xPy7dPHm_Mv9eX154vzs8vaSeBLDQwCpd4HaFFI7zX6DlXDBeua4LXywSqJknHXQSe3oOTcWUApXNs1DT8h7w555xR_rJgXM_bZ4TDYCeOaDZdMCqn1fyHTnLdKQ4Fv_oF3cU1TuYRhnPGGKbaht48hYFqVPKwRRb0_qL0d0PRTiEuy7vCKQ5ww9CV8BqoVgipeeH2El-Fx7N0xDwdffi3nhMHMqR9t-mmAmq0TzINO-FsSjlsR_s-WB9TMPhROj_PHT_gFy-bAeA</recordid><startdate>19951001</startdate><enddate>19951001</enddate><creator>Bechtold, Stephen E.</creator><creator>Brusco, Michael J.</creator><general>MCB UP Ltd</general><general>Emerald Group Publishing, Ltd</general><general>MCB</general><general>Emerald Group Publishing Limited</general><scope>AAYXX</scope><scope>CITATION</scope><scope>K30</scope><scope>PAAUG</scope><scope>PAWHS</scope><scope>PAWZZ</scope><scope>PAXOH</scope><scope>PBHAV</scope><scope>PBQSW</scope><scope>PBYQZ</scope><scope>PCIWU</scope><scope>PCMID</scope><scope>PCZJX</scope><scope>PDGRG</scope><scope>PDWWI</scope><scope>PETMR</scope><scope>PFVGT</scope><scope>PGXDX</scope><scope>PIHIL</scope><scope>PISVA</scope><scope>PJCTQ</scope><scope>PJTMS</scope><scope>PLCHJ</scope><scope>PMHAD</scope><scope>PNQDJ</scope><scope>POUND</scope><scope>PPLAD</scope><scope>PQAPC</scope><scope>PQCAN</scope><scope>PQCMW</scope><scope>PQEME</scope><scope>PQHKH</scope><scope>PQMID</scope><scope>PQNCT</scope><scope>PQNET</scope><scope>PQSCT</scope><scope>PQSET</scope><scope>PSVJG</scope><scope>PVMQY</scope><scope>PZGFC</scope><scope>SAAPM</scope><scope>0U~</scope><scope>1-H</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>ABJCF</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>K6~</scope><scope>K8~</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>M0C</scope><scope>M0T</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>PQBIZ</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>19951001</creationdate><title>Microcomputer-based working set generation methods for personnel scheduling</title><author>Bechtold, Stephen E. ; Brusco, Michael J.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c513t-121f00ddf18e45dd9edbe76342b6fd97dfa75e523cb1b52b6f533ca1e54c8b663</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1995</creationdate><topic>Ceramics</topic><topic>Costs</topic><topic>Employees</topic><topic>Experiments</topic><topic>Heuristic</topic><topic>Human resource management</topic><topic>Integer programming</topic><topic>Linear programming</topic><topic>Mathematical programming</topic><topic>Methods</topic><topic>Scheduling</topic><topic>Scheduling (Management)</topic><topic>Technology application</topic><topic>Test equipment</topic><topic>Workforce</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Bechtold, Stephen E.</creatorcontrib><creatorcontrib>Brusco, Michael J.</creatorcontrib><collection>CrossRef</collection><collection>Periodicals Index Online</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - West</collection><collection>Primary Sources Access (Plan D) - International</collection><collection>Primary Sources Access & Build (Plan A) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Midwest</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Northeast</collection><collection>Primary Sources Access (Plan D) - Southeast</collection><collection>Primary Sources Access (Plan D) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Southeast</collection><collection>Primary Sources Access (Plan D) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - UK / I</collection><collection>Primary Sources Access (Plan D) - Canada</collection><collection>Primary Sources Access (Plan D) - EMEALA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - North Central</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - International</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - International</collection><collection>Primary Sources Access (Plan D) - West</collection><collection>Periodicals Index Online Segments 1-50</collection><collection>Primary Sources Access (Plan D) - APAC</collection><collection>Primary Sources Access (Plan D) - Midwest</collection><collection>Primary Sources Access (Plan D) - MEA</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - Canada</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - EMEALA</collection><collection>Primary Sources Access & Build (Plan A) - APAC</collection><collection>Primary Sources Access & Build (Plan A) - Canada</collection><collection>Primary Sources Access & Build (Plan A) - West</collection><collection>Primary Sources Access & Build (Plan A) - EMEALA</collection><collection>Primary Sources Access (Plan D) - Northeast</collection><collection>Primary Sources Access & Build (Plan A) - Midwest</collection><collection>Primary Sources Access & Build (Plan A) - North Central</collection><collection>Primary Sources Access & Build (Plan A) - Northeast</collection><collection>Primary Sources Access & Build (Plan A) - South Central</collection><collection>Primary Sources Access & Build (Plan A) - Southeast</collection><collection>Primary Sources Access (Plan D) - UK / I</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - APAC</collection><collection>Primary Sources Access—Foundation Edition (Plan E) - MEA</collection><collection>Periodicals Index Online Segment 42</collection><collection>Global News & ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Business Collection</collection><collection>DELNET Management Collection</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Healthcare Administration Database</collection><collection>Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>ProQuest One Business</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>International journal of operations & production management</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Bechtold, Stephen E.</au><au>Brusco, Michael J.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Microcomputer-based working set generation methods for personnel scheduling</atitle><jtitle>International journal of operations & production management</jtitle><date>1995-10-01</date><risdate>1995</risdate><volume>15</volume><issue>10</issue><spage>63</spage><epage>74</epage><pages>63-74</pages><issn>0144-3577</issn><eissn>1758-6593</eissn><coden>IOPMDU</coden><abstract>Presents a new approach to working set generation for personnel
scheduling problems. In full-time (FT) and mixed-workforce (MW)
experiments, generates the schedules in the working sets from the use of
two-phase heuristic labour scheduling solution procedures. The solution
procedures were implemented on a 386 microcomputer and did not require
the specification of the size of the working sets in advance. In the FT
experiment, the general set-covering formulations (GSCFs) associated
with the produced working sets were solved with integer programming. The
new working set procedure yielded optimal integer solutions for all 36
test problems in the FT experiment. Owing to the size and complexity of
the problem data in the MW experiment, the GSCFs associated with the
working sets were solved with linear programming, and heuristic rounding
procedures were applied to obtain feasible integer solutions. The mean
labour costs of these solutions averaged 0.69 per cent less than the
mean cost of solutions obtained via the application of heuristic
rounding procedures applied to the linear programme solutions for the
GSCFs associated with the master sets. Compares solution costs for the
new working set method with those associated with other working set
generation refinement procedures. Results indicate that the new method
produces lower solution costs in less control processing unit time.</abstract><cop>Bradford</cop><pub>MCB UP Ltd</pub><doi>10.1108/01443579510098329</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0144-3577 |
| ispartof | International journal of operations & production management, 1995-10, Vol.15 (10), p.63-74 |
| issn | 0144-3577 1758-6593 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_35254599 |
| source | Periodicals Index Online; Emerald Journals |
| subjects | Ceramics Costs Employees Experiments Heuristic Human resource management Integer programming Linear programming Mathematical programming Methods Scheduling Scheduling (Management) Technology application Test equipment Workforce |
| title | Microcomputer-based working set generation methods for personnel scheduling |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T13%3A55%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Microcomputer-based%20working%20set%20generation%20methods%20for%20personnel%20scheduling&rft.jtitle=International%20journal%20of%20operations%20&%20production%20management&rft.au=Bechtold,%20Stephen%20E.&rft.date=1995-10-01&rft.volume=15&rft.issue=10&rft.spage=63&rft.epage=74&rft.pages=63-74&rft.issn=0144-3577&rft.eissn=1758-6593&rft.coden=IOPMDU&rft_id=info:doi/10.1108/01443579510098329&rft_dat=%3Cgale_proqu%3EA17844073%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=232362721&rft_id=info:pmid/&rft_galeid=A17844073&rfr_iscdi=true |