IDEAS home Printed from https://ideas.repec.org/a/inm/orinte/v34y2004i6p442-450.html
   My bibliography  Save this article

Quadrant Homes Applies Lean Concepts in a Project Environment

Author

Listed:
  • Karen A. Brown

    (University of Washington Bothell, Campus Box 358533, 18115 Campus Way NE, Bothell, Washington 98011-8246)

  • Thomas G. Schmitt

    (School of Business, University of Washington Seattle, Campus Box 353225, Seattle, Washington 98195)

  • Richard J. Schonberger

    (Schonberger & Associates, Inc., 177 107th Avenue NE, #2101, Bellevue, Washington 98004)

  • Stephen Dennis

    (Dennis and Associates, 1314 Lake Sammamish Parkway NE, Bellevue, Washington 98008)

Abstract

Quadrant Homes, a subsidiary of Weyerhaeuser Corporation, provides transferable lessons for applying lean-manufacturing concepts in project environments. The company has obtained impressive market and financial results, using an even-flow, predictable scheduling model in which it starts six houses per day and finishes each one in exactly 54 days. Quadrant follows recognized lean principles, including (1) designing its value stream around customer needs, (2) balancing work so all stages flow evenly, (3) operating on the basis of customer pull, and (4) continuously improving. Quadrant makes the lean principles work in a project environment by (1) knowing what can be standardized and what must be customized, (2) carefully setting and consistently managing customer expectations, (3) aligning goals of all stakeholders, and (4) recognizing that variances will occur, and designing routines to handle them when they do.

Suggested Citation

  • Karen A. Brown & Thomas G. Schmitt & Richard J. Schonberger & Stephen Dennis, 2004. "Quadrant Homes Applies Lean Concepts in a Project Environment," Interfaces, INFORMS, vol. 34(6), pages 442-450, December.
    • Handle: RePEc:inm:orinte:v:34:y:2004:i:6:p:442-450
    DOI: 10.1287/inte.1040.0108
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/inte.1040.0108
    Download Restriction: no
    File URL: https://libkey.io/10.1287/inte.1040.0108?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Paul S. Adler & Avi Mandelbaum & Viên Nguyen & Elizabeth Schwerer, 1995. "From Project to Process Management: An Empirically-Based Framework for Analyzing Product Development Time," Management Science, INFORMS, vol. 41(3), pages 458-484, March.
    2. Thomas Schmitt & Bruce Faaland, 2004. "Scheduling recurrent construction," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(8), pages 1102-1128, December.
    3. Brucker, Peter & Drexl, Andreas & Mohring, Rolf & Neumann, Klaus & Pesch, Erwin, 1999. "Resource-constrained project scheduling: Notation, classification, models, and methods," European Journal of Operational Research, Elsevier, vol. 112(1), pages 3-41, January.
    4. John J. Kanet & V. Sridharan, 2000. "Scheduling with Inserted Idle Time: Problem Taxonomy and Literature Review," Operations Research, INFORMS, vol. 48(1), pages 99-110, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Karen A. Brown & Thomas G. Schmitt & Richard J. Schonberger, 2015. "ASP, The Art and Science of Practice: Three Challenges for a Lean Enterprise in Turbulent Times," Interfaces, INFORMS, vol. 45(3), pages 260-270, June.
    2. Schmitt, Thomas G. & Kumar, Sanjay & Stecke, Kathryn E. & Glover, Fred W. & Ehlen, Mark A., 2017. "Mitigating disruptions in a multi-echelon supply chain using adaptive ordering," Omega, Elsevier, vol. 68(C), pages 185-198.
    3. Xin Xu & Yao Zhao & Ching-Yu Chen, 2016. "Project-driven supply chains: integrating safety-stock and crashing decisions for recurrent projects," Annals of Operations Research, Springer, vol. 241(1), pages 225-247, June.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Thomas Schmitt & Bruce Faaland, 2004. "Scheduling recurrent construction," Naval Research Logistics (NRL), John Wiley & Sons, vol. 51(8), pages 1102-1128, December.
    2. Asbach, Lasse & Dorndorf, Ulrich & Pesch, Erwin, 2009. "Analysis, modeling and solution of the concrete delivery problem," European Journal of Operational Research, Elsevier, vol. 193(3), pages 820-835, March.
    3. Wendi Tian & Erik Demeulemeester, 2014. "Railway scheduling reduces the expected project makespan over roadrunner scheduling in a multi-mode project scheduling environment," Annals of Operations Research, Springer, vol. 213(1), pages 271-291, February.
    4. Byung-Cheon Choi & Changmuk Kang, 2019. "A linear time–cost tradeoff problem with multiple milestones under a comb graph," Journal of Combinatorial Optimization, Springer, vol. 38(2), pages 341-361, August.
    5. Andrzej Kozik, 2017. "Handling precedence constraints in scheduling problems by the sequence pair representation," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 445-472, February.
    6. Xiong, Jian & Leus, Roel & Yang, Zhenyu & Abbass, Hussein A., 2016. "Evolutionary multi-objective resource allocation and scheduling in the Chinese navigation satellite system project," European Journal of Operational Research, Elsevier, vol. 251(2), pages 662-675.
    7. Rolf H. Möhring & Andreas S. Schulz & Frederik Stork & Marc Uetz, 2003. "Solving Project Scheduling Problems by Minimum Cut Computations," Management Science, INFORMS, vol. 49(3), pages 330-350, March.
    8. Ilkyeong Moon & Sanghyup Lee & Moonsoo Shin & Kwangyeol Ryu, 2016. "Evolutionary resource assignment for workload-based production scheduling," Journal of Intelligent Manufacturing, Springer, vol. 27(2), pages 375-388, April.
    9. Park, Jongyoon & Han, Jinil & Lee, Kyungsik, 2024. "Integer optimization models and algorithms for the multi-period non-shareable resource allocation problem," European Journal of Operational Research, Elsevier, vol. 317(1), pages 43-59.
    10. Mattfeld, D. C. & Kopfer, H., 2003. "Terminal operations management in vehicle transshipment," Transportation Research Part A: Policy and Practice, Elsevier, vol. 37(5), pages 435-452, June.
    11. M. Vanhoucke, 2006. "A scatter search procedure for maximizing the net present value of a project under renewable resource constraints," Working Papers of Faculty of Economics and Business Administration, Ghent University, Belgium 06/417, Ghent University, Faculty of Economics and Business Administration.
    12. Ip, W. H. & Yung, K. L. & Wang, Dingwei, 2004. "A branch and bound algorithm for sub-contractor selection in agile manufacturing environment," International Journal of Production Economics, Elsevier, vol. 87(2), pages 195-205, January.
    13. Dieter Debels & Mario Vanhoucke, 2007. "A Decomposition-Based Genetic Algorithm for the Resource-Constrained Project-Scheduling Problem," Operations Research, INFORMS, vol. 55(3), pages 457-469, June.
    14. Yamashita, Denise Sato & Armentano, Vinicius Amaral & Laguna, Manuel, 2006. "Scatter search for project scheduling with resource availability cost," European Journal of Operational Research, Elsevier, vol. 169(2), pages 623-637, March.
    15. Smith, Robert P. & Eppinger, Steven D., 1991. "Identifying controlling features of engineering design iteration," Working papers 3348-91., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    16. Moukrim, Aziz & Quilliot, Alain & Toussaint, Hélène, 2015. "An effective branch-and-price algorithm for the Preemptive Resource Constrained Project Scheduling Problem based on minimal Interval Order Enumeration," European Journal of Operational Research, Elsevier, vol. 244(2), pages 360-368.
    17. Eugene Shragowitz & Habib Youssef & Bing Lu, 2003. "Iterative Converging Algorithms for Computing Bounds on Durations of Activities in Pert and Pert-Like Models," Journal of Combinatorial Optimization, Springer, vol. 7(1), pages 5-22, March.
    18. Hongbo Li & Zhe Xu & Wenchao Wei, 2018. "Bi-Objective Scheduling Optimization for Discrete Time/Cost Trade-Off in Projects," Sustainability, MDPI, vol. 10(8), pages 1-15, August.
    19. Guha, Mahua & Das, Gopal, 2017. "Routine contraction in good times: An example of a typical prototype development routine," Journal of Business Research, Elsevier, vol. 70(C), pages 145-152.
    20. Dorndorf, Ulrich & Drexl, Andreas & Nikulin, Yury & Pesch, Erwin, 2005. "Flight gate scheduling: State-of-the-art and recent developments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 584, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:orinte:v:34:y:2004:i:6:p:442-450. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.