Skip to content

Commit 066aac8

Browse files
Merge pull request #968 from Quantum-Software-Development/FabianaCampanari-patch-1
Update README.md
2 parents d1ca559 + 832141e commit 066aac8

File tree

1 file changed

+43
-10
lines changed

1 file changed

+43
-10
lines changed

README.md

Lines changed: 43 additions & 10 deletions
Original file line numberDiff line numberDiff line change
@@ -2179,7 +2179,6 @@ The [**Assignment Problem**]() aims to allocate *n* tasks to *n* agents (machine
21792179

21802180
<br>
21812181

2182-
🏄🏄🏄🏄🏄
21832182

21842183
## 1. [Hungarian Method]() (Step by Step):
21852184

@@ -2235,10 +2234,15 @@ The [**Assignment Problem**]() aims to allocate *n* tasks to *n* agents (machine
22352234

22362235
<br>
22372236

2237+
🏄🏄🏄🏄🏄
22382238

2239-
## Step 1: Set Up the Excel Spreadsheet
2239+
### [Step 1](): Set Up the Excel Spreadsheet
22402240

2241-
### 1. Enter the Cost Matrix
2241+
<br>
2242+
2243+
#### [1.1](): Enter the Cost Matrix
2244+
2245+
<br>
22422246

22432247
| | B | C | D |
22442248
|-----|------|------|------|
@@ -2247,9 +2251,15 @@ The [**Assignment Problem**]() aims to allocate *n* tasks to *n* agents (machine
22472251
| T2 | 1 | 3 | 2 |
22482252
| T3 | 5 | 2 | 4 |
22492253

2254+
<br>
2255+
22502256
- Place this table in cells **B2:D4**.
22512257

2252-
### 2. Create the Decision Variable Table
2258+
<br>
2259+
2260+
#### [1.2](): Create the Decision Variable Table
2261+
2262+
<br>
22532263

22542264
| | G | H | I |
22552265
|-----|------|------|------|
@@ -2258,20 +2268,31 @@ The [**Assignment Problem**]() aims to allocate *n* tasks to *n* agents (machine
22582268
| T2 | x21 | x22 | x23 |
22592269
| T3 | x31 | x32 | x33 |
22602270

2271+
<br>
2272+
22612273
- Place this table in **G2:I4**.
22622274
- These cells will be filled with 0 or 1 by the Solver (1 = assigned, 0 = not assigned).
22632275

2264-
### 3. Calculate the Total Cost
2276+
<br>
2277+
2278+
### [1.3](): Calculate the Total Cost
22652279

22662280
In cell **K2**, enter:
22672281

2282+
22682283
```bash
22692284
=SUMPRODUCT(B2:D4, G2:I4)
22702285
```
22712286

22722287
This formula multiplies each assignment by its cost and sums the total.
22732288

2274-
### 4. Add Row and Column Sums for Constraints
2289+
2290+
<br>
2291+
2292+
2293+
#### [.4](): Add Row and Column Sums for Constraints
2294+
2295+
<br>
22752296

22762297
#### Row Sums (Each Task Assigned Once)
22772298

@@ -2285,9 +2306,10 @@ This formula multiplies each assignment by its cost and sums the total.
22852306
- In **H5**: `=SUM(H2:H4)`
22862307
- In **I5**: `=SUM(I2:I4)`
22872308

2309+
22882310
<br>
22892311

2290-
## Step 2: Configure Excel Solver
2312+
### [Step 2](): Configure Excel Solver
22912313

22922314
1. **Go to**: Data > Solver
22932315
2. **Set Objective**:
@@ -2304,17 +2326,22 @@ This formula multiplies each assignment by its cost and sums the total.
23042326

23052327
<br>
23062328

2307-
## Step 3: Solution Example
2329+
### [Step 3](): Solution Example
23082330

23092331
After running Solver, you should get a solution like:
23102332

2333+
<br>
2334+
2335+
23112336
| | M1 | M2 | M3 | Row Sum |
23122337
|-----|----|----|----|---------|
23132338
| T1 | 1 | 0 | 0 | 1 |
23142339
| T2 | 0 | 0 | 1 | 1 |
23152340
| T3 | 0 | 1 | 0 | 1 |
23162341
|Col Sum| 1| 1 | 1 | |
23172342

2343+
<br>
2344+
23182345
- **Task 1 → Machine 1** (cost 2)
23192346
- **Task 2 → Machine 3** (cost 2)
23202347
- **Task 3 → Machine 2** (cost 2)
@@ -2325,27 +2352,33 @@ After running Solver, you should get a solution like:
23252352

23262353
## Excel Table and Formula Summary
23272354

2355+
<br>
2356+
23282357
| | M1 | M2 | M3 | Row Sum |
23292358
|-----|------|------|------|---------|
23302359
| T1 | G2 | H2 | I2 | J2 |
23312360
| T2 | G3 | H3 | I3 | J3 |
23322361
| T3 | G4 | H4 | I4 | J4 |
23332362
|Col Sum|G5 | H5 | I5 | |
23342363

2364+
<br>
2365+
23352366
- **Total Cost:** `=SUMPRODUCT(B2:D4, G2:I4)`
23362367
- **Row Sums:** `=SUM(G2:I2)`, etc.
23372368
- **Column Sums:** `=SUM(G2:G4)`, etc.
23382369

23392370
<br>
23402371

2341-
### [Result]():
2372+
### [Step 4]():Result
23422373

23432374
**The optimal assignment is:**
23442375
- Task 1 to Machine 1 (cost 2)
23452376
- Task 2 to Machine 3 (cost 2)
23462377
- Task 3 to Machine 2 (cost 2)
23472378

2348-
### [**Total minimum cost:** 6]()
2379+
<br>
2380+
2381+
### **Total minimum cost:** [6]()
23492382

23502383

23512384
<br><br>

0 commit comments

Comments
 (0)