Optimal work breaks in deterministic and probabilistic repetitive projects

Optimal work breaks in deterministic and probabilistic repetitive projects

An effective way to reduce the duration and cost of projects with repetitive activities is through the relaxation of resource continuity and the introduction of work breaks at strategic points between repetitive project units. This paper describes the problem and introduces the basic concepts for de...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Ioannou, P.G., Srisuwanrat, C.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Buildings
Continuous production
Costs
Delay
Floors
Road transportation
Scheduling algorithm
Tunneling
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 2150
container_issue
container_start_page 2141
container_title
container_volume
creator Ioannou, P.G.
Srisuwanrat, C.
description An effective way to reduce the duration and cost of projects with repetitive activities is through the relaxation of resource continuity and the introduction of work breaks at strategic points between repetitive project units. This paper describes the problem and introduces the basic concepts for determining the optimal location and duration of work breaks for both deterministic and probabilistic activity durations. The procedure is described in detail and is applied to an example project with 9 activities with probabilistic durations that repeat over 10 similar work units. The solution employs concepts from the Repetitive Scheduling Method (RSM), the Sequence Step Algorithm (SQS-AL), and is modeled in STROBOSCOPE, an activity-based simulation system. Numerical and graphical results explain the process and the underlying time and cost tradeoffs.
doi_str_mv 10.1109/WSC.2007.4419848
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4419848</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4419848</ieee_id><sourcerecordid>4419848</sourcerecordid><originalsourceid>FETCH-LOGICAL-i1328-1d0405921bbfa4f18c4e78dc74a938d7d48bfee1fc04d881b7b5b37989932b1b3</originalsourceid><addsrcrecordid>eNpVkMtqwzAURNUXNE2zL3SjH7Crq0d0tSymTwJZtKXLIFnXoMRxjGxa-vdNSTZdDTMHhmEYuwFRAgh39_lWlVIIW2oNDjWesJmzCFruvRJzc8omYAwWWglz9o8ZPGcTgQ4Ka9X8kl0Nw1oIQANywl6X_Zi2vuXfu7zhIZPfDDx1PNJIeZu6NIyp5r6LvM-74ENqD0mmnsY0pi_6A2uqx-GaXTS-HWh21Cn7eHx4r56LxfLppbpfFAmUxAKi0MI4CSE0XjeAtSaLsbbaO4XRRo2hIYKmFjoiQrDBBGUdOqdkgKCm7PbQm4ho1ef9_PyzOt6ifgHvOlJ5</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Optimal work breaks in deterministic and probabilistic repetitive projects</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Ioannou, P.G. ; Srisuwanrat, C.</creator><creatorcontrib>Ioannou, P.G. ; Srisuwanrat, C.</creatorcontrib><description>An effective way to reduce the duration and cost of projects with repetitive activities is through the relaxation of resource continuity and the introduction of work breaks at strategic points between repetitive project units. This paper describes the problem and introduces the basic concepts for determining the optimal location and duration of work breaks for both deterministic and probabilistic activity durations. The procedure is described in detail and is applied to an example project with 9 activities with probabilistic durations that repeat over 10 similar work units. The solution employs concepts from the Repetitive Scheduling Method (RSM), the Sequence Step Algorithm (SQS-AL), and is modeled in STROBOSCOPE, an activity-based simulation system. Numerical and graphical results explain the process and the underlying time and cost tradeoffs.</description><identifier>ISSN: 0891-7736</identifier><identifier>ISBN: 9781424413058</identifier><identifier>ISBN: 1424413052</identifier><identifier>EISSN: 1558-4305</identifier><identifier>EISBN: 9781424413065</identifier><identifier>EISBN: 1424413060</identifier><identifier>DOI: 10.1109/WSC.2007.4419848</identifier><language>eng</language><publisher>IEEE</publisher><subject>Buildings ; Continuous production ; Costs ; Delay ; Floors ; Road transportation ; Scheduling algorithm ; Tunneling</subject><ispartof>2007 Winter Simulation Conference, 2007, p.2141-2150</ispartof><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4419848$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>310,311,781,785,790,791,2059,27930,54925</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4419848$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Ioannou, P.G.</creatorcontrib><creatorcontrib>Srisuwanrat, C.</creatorcontrib><title>Optimal work breaks in deterministic and probabilistic repetitive projects</title><title>2007 Winter Simulation Conference</title><addtitle>WSC</addtitle><description>An effective way to reduce the duration and cost of projects with repetitive activities is through the relaxation of resource continuity and the introduction of work breaks at strategic points between repetitive project units. This paper describes the problem and introduces the basic concepts for determining the optimal location and duration of work breaks for both deterministic and probabilistic activity durations. The procedure is described in detail and is applied to an example project with 9 activities with probabilistic durations that repeat over 10 similar work units. The solution employs concepts from the Repetitive Scheduling Method (RSM), the Sequence Step Algorithm (SQS-AL), and is modeled in STROBOSCOPE, an activity-based simulation system. Numerical and graphical results explain the process and the underlying time and cost tradeoffs.</description><subject>Buildings</subject><subject>Continuous production</subject><subject>Costs</subject><subject>Delay</subject><subject>Floors</subject><subject>Road transportation</subject><subject>Scheduling algorithm</subject><subject>Tunneling</subject><issn>0891-7736</issn><issn>1558-4305</issn><isbn>9781424413058</isbn><isbn>1424413052</isbn><isbn>9781424413065</isbn><isbn>1424413060</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2007</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNpVkMtqwzAURNUXNE2zL3SjH7Crq0d0tSymTwJZtKXLIFnXoMRxjGxa-vdNSTZdDTMHhmEYuwFRAgh39_lWlVIIW2oNDjWesJmzCFruvRJzc8omYAwWWglz9o8ZPGcTgQ4Ka9X8kl0Nw1oIQANywl6X_Zi2vuXfu7zhIZPfDDx1PNJIeZu6NIyp5r6LvM-74ENqD0mmnsY0pi_6A2uqx-GaXTS-HWh21Cn7eHx4r56LxfLppbpfFAmUxAKi0MI4CSE0XjeAtSaLsbbaO4XRRo2hIYKmFjoiQrDBBGUdOqdkgKCm7PbQm4ho1ef9_PyzOt6ifgHvOlJ5</recordid><startdate>200712</startdate><enddate>200712</enddate><creator>Ioannou, P.G.</creator><creator>Srisuwanrat, C.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200712</creationdate><title>Optimal work breaks in deterministic and probabilistic repetitive projects</title><author>Ioannou, P.G. ; Srisuwanrat, C.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i1328-1d0405921bbfa4f18c4e78dc74a938d7d48bfee1fc04d881b7b5b37989932b1b3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Buildings</topic><topic>Continuous production</topic><topic>Costs</topic><topic>Delay</topic><topic>Floors</topic><topic>Road transportation</topic><topic>Scheduling algorithm</topic><topic>Tunneling</topic><toplevel>online_resources</toplevel><creatorcontrib>Ioannou, P.G.</creatorcontrib><creatorcontrib>Srisuwanrat, C.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Ioannou, P.G.</au><au>Srisuwanrat, C.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimal work breaks in deterministic and probabilistic repetitive projects</atitle><btitle>2007 Winter Simulation Conference</btitle><stitle>WSC</stitle><date>2007-12</date><risdate>2007</risdate><spage>2141</spage><epage>2150</epage><pages>2141-2150</pages><issn>0891-7736</issn><eissn>1558-4305</eissn><isbn>9781424413058</isbn><isbn>1424413052</isbn><eisbn>9781424413065</eisbn><eisbn>1424413060</eisbn><abstract>An effective way to reduce the duration and cost of projects with repetitive activities is through the relaxation of resource continuity and the introduction of work breaks at strategic points between repetitive project units. This paper describes the problem and introduces the basic concepts for determining the optimal location and duration of work breaks for both deterministic and probabilistic activity durations. The procedure is described in detail and is applied to an example project with 9 activities with probabilistic durations that repeat over 10 similar work units. The solution employs concepts from the Repetitive Scheduling Method (RSM), the Sequence Step Algorithm (SQS-AL), and is modeled in STROBOSCOPE, an activity-based simulation system. Numerical and graphical results explain the process and the underlying time and cost tradeoffs.</abstract><pub>IEEE</pub><doi>10.1109/WSC.2007.4419848</doi><tpages>10</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 0891-7736
ispartof 2007 Winter Simulation Conference, 2007, p.2141-2150
issn 0891-7736
1558-4305
language eng
recordid cdi_ieee_primary_4419848
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Buildings
Continuous production
Costs
Delay
Floors
Road transportation
Scheduling algorithm
Tunneling
title Optimal work breaks in deterministic and probabilistic repetitive projects
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-15T00%3A53%3A54IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Optimal%20work%20breaks%20in%20deterministic%20and%20probabilistic%20repetitive%20projects&rft.btitle=2007%20Winter%20Simulation%20Conference&rft.au=Ioannou,%20P.G.&rft.date=2007-12&rft.spage=2141&rft.epage=2150&rft.pages=2141-2150&rft.issn=0891-7736&rft.eissn=1558-4305&rft.isbn=9781424413058&rft.isbn_list=1424413052&rft_id=info:doi/10.1109/WSC.2007.4419848&rft_dat=%3Cieee_6IE%3E4419848%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&rft.eisbn=9781424413065&rft.eisbn_list=1424413060&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4419848&rfr_iscdi=true