主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

Chinese Journal of Management Science ›› 2022, Vol. 30 ›› Issue (10): 109-118.doi: 10.16381/j.cnki.issn1003-207x.2020.0100

• Articles • Previous Articles     Next Articles

A Constraint Programming Approach for Solving the Discrete Time/cost Tradeoff Problem in Repetitive Projects considering Soft Logic

ZHANG Li-hui2, QI Jian-xun2   

  1. 1. Department of Economic Management, North China Electric Power University, Baoding 071003, China;2. School of Economics and Management, North China Electric Power University, Beijing 102206, China
  • Received:2020-01-19 Revised:2020-05-19 Online:2022-10-20 Published:2022-10-12
  • Contact: 邹鑫 E-mail:zoux788@126.com

Abstract: Repetitive projects such as multiple similar houses, high-rise buildings, highways, and pipeline, are characterized by a number of similar or identical units and a set of activities that need to be repeatedly executed from one unit to another. Logic relations exist between each activity in different units and they may be of “fixed” or “soft” character. Fixed logic means that there is only one work sequence between the same activities in different units, while soft logic indicates that more than one possibility is available when analyzing activity sequencing. With soft logic, the same activities in different units could be performed in parallel (all of them are executed concurrently), in sequence (one after the other), or part in parallel and part in sequence.

Key words: repetitive projects; time-cost tradeoff; soft logic; constraint programming

CLC Number: