Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 11 views

    CACEP Unit 2 Assignment Problem

    Uploaded by

    Rajha Rajeswaran
    This document discusses optimization techniques used in construction engineering and planning, specifically addressing assignment problems. It provides an example of solving an assignment problem using the Hungarian method to minimize total time or cost by assigning each worker to a specific job. The steps include reducing rows and columns to identify the optimal assignment with all zeros, which indicates the minimum value. It also discusses how to solve unbalanced and constrained assignment problems when the number of workers does not equal the number of jobs.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    CACEP Unit 2 Assignment Problem

    Uploaded by

    Rajha Rajeswaran
    11 views36 pages
    This document discusses optimization techniques used in construction engineering and planning, specifically addressing assignment problems. It provides an example of solving an assignment problem using the Hungarian method to minimize total time or cost by assigning each worker to a specific job. The steps include reducing rows and columns to identify the optimal assignment with all zeros, which indicates the minimum value. It also discusses how to solve unbalanced and constrained assignment problems when the number of workers does not equal the number of jobs.

    Original Title

    CACEP Unit 2 Assignment Problem - Copy

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document discusses optimization techniques used in construction engineering and planning, specifically addressing assignment problems. It provides an example of solving an assignment problem using the Hungarian method to minimize total time or cost by assigning each worker to a specific job. The steps include reducing rows and columns to identify the optimal assignment with all zeros, which indicates the minimum value. It also discusses how to solve unbalanced and constrained assignment problems when the number of workers does not equal the number of jobs.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    11 views36 pages

    CACEP Unit 2 Assignment Problem

    Uploaded by

    Rajha Rajeswaran
    This document discusses optimization techniques used in construction engineering and planning, specifically addressing assignment problems. It provides an example of solving an assignment problem using the Hungarian method to minimize total time or cost by assigning each worker to a specific job. The steps include reducing rows and columns to identify the optimal assignment with all zeros, which indicates the minimum value. It also discusses how to solve unbalanced and constrained assignment problems when the number of workers does not equal the number of jobs.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 36

    BE Degree Honours with Specialization

    BE Civil Engineering
    Specialization in
    CONSTRUCTION MANAGEMENT

    21 CEB 07 T Computer Applications in Construction


    Engineering and Planning

    Unit 2 OPTIMIZATION TECHNIQUES


    21 CEB 07 T Computer Applications in Construction
    Engineering and Planning
    SYLLABUS Total Periods: 45 Credits 3
    UNIT I INTRODUCTION 9
    Overview of IT Applications in Construction – Construction process –
    Computerization in Construction – Computer aided Cost Estimation –
    Developing application with database software.
    UNIT II OPTIMIZATION TECHNIQUES 9
    Linear, Dynamic and Integer Programming - Branch and Bound Techniques –
    Application to Production Scheduling, Equipment Replacement, Material
    Transportation and Work Assignment Problems – Software applications
    UNIT III INVENTORY MODELS 9
    Deterministic and Probabilistic Inventory Models - Software applications.
    UNIT IV SCHEDULING APPLICATION 9
    PERT and CPM - Advanced planning and scheduling concepts – Computer
    applications – Case study.
    UNIT V OTHER PROBLEMS 9
    SYLLABUS Total Periods: 45 Credits 3

    UNIT II OPTIMIZATION TECHNIQUES 9


    Linear Programming
    Dynamic Programming
    Integer Programming
    Branch and Bound Techniques
    Application to Production Scheduling
    Application to Equipment Replacement
    Application to Material Transportation
    Application to Work Assignment Problems
    Software Applications
    SYLLABUS Total Periods: 45 Credits 3

    UNIT II OPTIMIZATION TECHNIQUES 9

    Application to Work Assignment Problems


    Assignment Problem
    • A specially structured
    Linear Programming Problem
    Assignment Problem
    Assignment Problem
    Assignment Problem
    • Assignment Problem techniques used to

    • MINIMIZE the Total Cost / Total Time


    • or to
    • MAXIMIZE Total Revenue / Total Production
    Assignment Problem

    Example 1
    Assignment Problem solved by HAM
    HUNGARIAN Assignment Method

    JOB
    Worker A B C D
    1 45 40 51 67
    2 57 42 63 55
    3 49 52 48 64
    4 41 45 60 55

    CELL VALUES areTIME taken by each worker to COMPLETE that Job


    Assignment Problem
    • In this problem
    • No. of WORKERS = No. of JOBS

    • i.e.

    • No. of ROWS = No. of COLUMNS =N=4


    Assignment Problem

    Step 1 ROW REDUCTION

    JOB

    Worker A B C D A B C D
    45 40 51 67 5 0 11 27
    1
    57 42 63 55 15 0 21 13
    2
    49 52 48 64 1 4 0 16
    3
    41 45 60 55 0 4 19 14
    4
    Assignment Problem

    Step 2 COLUM REDUCTION

    JOB

    Worker A B C D A B C D
    5 0 11 27
    1 5 0 11 14
    15 0 21 13
    2 15 0 21 0
    1 4 0 16
    3 1 4 0 3
    0 4 19 14
    4 0 4 19 1
    Assignment Problem

    Step 3 Strike Out all Zeroes using MINIMUM Number of STRAIGHT LINES

    JOB

    Worker A B C D

    1 5 0 11 14

    2 15 0 21 0

    3 1 4 0 3

    4 0 4 19 1
    Assignment Problem
    Step 3 Strike Out all Zeroes using MINIMUM Number of STRAIGHT LINES

    JOB
    Worker A B C D A B C D
    1 5 0 11 14 5 0 11 14
    2 15 0 21 0 15 0 21 0
    3 1 4 0 3 1 4 0 3
    4 0 4 19 1 0 4 19 1

    • No. of Straight Lines required = 4 = N


    Thus it is indicates OPTIMUM Solution is achieved
    Assignment Problem
    SOLUTION = Choose that Assignment containing UNIT ZERO
    Step 3 Strike Out all Zeroes using MINIMUM Number of STRAIGHT LINES

    JOB
    Worker A B C D A B C D
    1 5 0 11 14 5 0 11 14
    2 15 0 21 0 15 0 21 0
    3 1 4 0 3 1 4 0 3
    4 0 4 19 1 0 4 19 1
    Solution
    • Worker 1 Assign to Job B 1B +3C+4A+ 2D
    • Worker 3 Assign to Job C = 40 + 48 + 41 + 55
    • Worker 4 Assign to Job A = 184
    • Worker 2 Assign to Job D
    SOLUTION
    Assignment Problem solved by HAM
    HUNGARIAN Assignment Method

    JOB
    Worker A B C D

    1
    45 40 51 67

    2
    57 42 63 55
    3
    49 52 48 64

    4
    41 45 60 55

    CELL VALUES are TIME taken by each worker to COMPLETE that Job
    Assignment Problem
    Assignment Problem
    Assignment Problem
    • Example 2
    Assignment Problem
    • Example 2
    Assignment Problem
    Assignment Problem
    Assignment Problem
    Assignment Problem
    UNBALANCED & CONSTRAINED Assignment Problem

    No. of Persons 4 ≠5 No. of JOBS


    Assignment Problem
    • Table AFTER Balancing
    Assignment Problem
    Assignment Problem
    Assignment Problem
    Assignment Problem
    • MAXIMIZATION Model in Assignment
    Assignment Problem
    Assignment Problem
    Assignment Problem

    You might also like