Optimal work breaks in deterministic and probabilistic repetitive projects

被引:0
|
作者
Ioannou, Photios G. [1 ]
Srisuwanrat, Chachrist [1 ]
机构
[1] Univ Michigan, Dept Civil & Environm Engn, Ann Arbor, MI 48109 USA
关键词
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:2120 / 2129
页数:10
相关论文
共 50 条
  • [31] Deterministic networks for probabilistic computing
    Jordan, Jakob
    Petrovici, Mihai A.
    Breitwieser, Oliver
    Schemmel, Johannes
    Meier, Karlheinz
    Diesmann, Markus
    Tetzlaff, Tom
    SCIENTIFIC REPORTS, 2019, 9 (1)
  • [32] Mixed deterministic and probabilistic networks
    Mateescu, Robert
    Dechter, Rina
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2008, 54 (1-3) : 3 - 51
  • [33] Is everyday causation deterministic or probabilistic?
    Frosch, Caren A.
    Johnson-Laird, P. N.
    ACTA PSYCHOLOGICA, 2011, 137 (03) : 280 - 291
  • [34] Deterministic and probabilistic implementation of context
    Brdiczka, O
    Reignier, P
    Crowley, JL
    Vaufreydaz, D
    Maisonnasse, J
    FOURTH ANNUAL IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS WORKSHOPS, PROCEEDINGS, 2006, : 46 - +
  • [35] SEQUENTIAL DECOMPOSITION OF A PROBABILISTIC AUTOMATON INTO A PROBABILISTIC AND DETERMINISTIC AUTOMATA
    KURMIT, AA
    AVTOMATIKA I VYCHISLITELNAYA TEKHNIKA, 1983, (01): : 49 - 49
  • [36] Resource smoothening in repetitive projects
    Elwany, M.H.
    Korish, I.E.
    Barakat, M.Aly
    Hafez, S.M.
    Computers and Industrial Engineering, 1998, 35 (3-4): : 415 - 418
  • [37] Resource smoothening in repetitive projects
    Elwany, MH
    Korish, IE
    Barakat, MA
    Hafez, SM
    COMPUTERS & INDUSTRIAL ENGINEERING, 1998, 35 (3-4) : 415 - 418
  • [38] The Cointegrated VAR Model with Deterministic Structural Breaks
    Gosinska, Emilia
    Welfe, Aleksander
    CENTRAL EUROPEAN JOURNAL OF ECONOMIC MODELLING AND ECONOMETRICS, 2022, 14 (03): : 335 - 350
  • [39] Deterministic and probabilistic entanglement swapping of nonmaximally entangled states assisted by optimal quantum state discrimination
    Solis-Prosser, M. A.
    Delgado, A.
    Jimenez, O.
    Neves, L.
    PHYSICAL REVIEW A, 2014, 89 (01):
  • [40] BLOCKCHAIN OF OPTIMAL MULTIPLE CONSTRUCTION PROJECTS PLANNING UNDER PROBABILISTIC ARRIVAL AND STOCHASTIC DURATIONS
    Al-refaie, Abbas
    Al-hawadi, Ahmad
    Lepkova, Natalija
    Abbasi, Ghaleb
    JOURNAL OF CIVIL ENGINEERING AND MANAGEMENT, 2023, 29 (01) : 15 - 34