𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An application of bar-code system for reducing construction wastes

✍ Scribed by Zhen Chen; Heng Li; Conrad T.C Wong

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
167 KB
Volume
11
Category
Article
ISSN
0926-5805

No coin nor oath required. For personal study only.

✦ Synopsis

This paper presents a group-based incentive reward program (IRP) to encourage workers to minimize avoidable wastes of construction materials by rewarding them according to the amounts and values of materials they saved. Bar-code technique is used to facilitate effective management of construction materials. An IRP-integrated construction management system is also introduced to avoid jerrybuilding and solve reschedule problem due to rework of quality failure. An experiment is conducted on a residential project in Hong Kong and results from the experiment demonstrate the effectiveness of the IRP in motivating workers to reduce construction wastes. Discussions on the relationship between construction waste reduction and time and cost performances are also presented. Difficulties and challenges of applying IRP are also discussed.

πŸ“œ SIMILAR VOLUMES

Real-time gesture recognition from dynam
Real-time gesture recognition from dynamic images for construction of an interactive system: Application to a virtual conductor system
✍ Takahiro Watanabe; Chil-Woo Lee; Masahiko Yachida πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 207 KB πŸ‘ 2 views

This paper discusses a method for real-time gesture recognition from a dynamic image and its application to an interactive system. The proposed technique enables a large volume of dynamic image information to be processed efficiently, by using a low-dimensional gesture space to represent a partial i

An Optimal Algorithm for Constructing th
An Optimal Algorithm for Constructing the Reduced GrΓΆbner Basis of Binomial Ideals, and Applications to Commutative Semigroups
✍ Ulla Koppenhagen; Ernst W. Mayr πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 404 KB

It is known that the reduced GrΓΆbner basis of general polynomial ideals can be computed in exponential space. The algorithm, obtained by KΓΌhnle and Mayr, is, however, based on rather complex parallel computations, and, above that, makes extensive use of the parallel computation thesis. In this paper