- Details
- Parent Category: Programming Assignments' Solutions

# We Helped With This Excel Programming Homework: Have A Similar One?

Category | Programming |
---|---|

Subject | Excel |

Difficulty | College |

Status | Solved |

More Info | Excel Assignment |

## Short Assignment Requirements

## Assignment Description

**Quiz**

** **

Complete the Problem Set (available on Blackboard) by hand. Complete the Job Sequencing 1 – Problem Set Quiz on Blackboard.

### Workbook

** **

Develop a Microsoft Excel workbook that is designed to solve single‐machine, six‐job, job sequencing (with no preemption) problems via total enumeration. The workbook must accept the following integer inputs for each job: ready time, processing time, due date, and weight. The workbook must compute for each feasible job sequence: the start time for each job, the idle time for each job, the completion time for each job, the lateness for each job, the tardiness for each job, the weighted completion time for each job, the weighted tardiness for each job, the makespan, the total completion time, the maximum lateness, the total tardiness, the total weighted completion time, and the total weighted tardiness.

Demonstrate the capability of the workbook using the jobs summarized in the table below. Sort the solutions to the job sequencing problem as if the objective is to minimize total weighted tardiness.

Job | Ready Time | Processing Time | Due Date | Weight |

1 | 18 | 7 | 30 | 6 |

2 | 0 | 13 | 20 | 2 |

3 | 0 | 42 | 66 | 9 |

4 | 0 | 9 | 44 | 1 |

5 | 52 | 14 | 73 | 4 |

6 | 31 | 27 | 55 | 7 |

## Assignment Description

**Problem 1**

** **

Consider a single‐machine, five‐job, job sequencing problem such that all jobs have a ready time of zero and preempting jobs is not permitted. The remaining characteristics of the five jobs, listed in the order they were received, can be found in the table below.

Job Number | Processing Time | Due Date |

1 | 10 | 28 |

2 | 4 | 28 |

3 | 3 | 12 |

4 | 7 | 7 |

5 | 14 | 15 |

Determine and evaluate the job sequence that minimizes total completion time.

### Problem 2

** **

Consider a single‐machine, six‐job, job sequencing problem such that all jobs have a ready time of zero and preempting jobs is not permitted. The remaining characteristics of the six jobs, listed in the order they were received, can be found in the table below.

Job Number | Processing Time | Due Date |

1 | 2 | 5 |

2 | 3 | 4 |

3 | 2 | 13 |

4 | 1 | 6 |

5 | 4 | 12 |

6 | 3 | 10 |

Determine and evaluate the job sequence that minimizes maximum lateness.

### Problem 3

** **

Consider a single‐machine, five‐job, job sequencing problem such that all jobs have a ready time of zero and preempting jobs is not permitted. The remaining characteristics of the five jobs, listed in the order they were received, can be found in the table below.

Job Number | Processing Time | Due Date | Weight |

1 | 3 | 4 | 6 |

2 | 6 | 8 | 3 |

3 | 8 | 12 | 1 |

4 | 4 | 15 | 9 |

5 | 2 | 11 | 2 |

Determine and evaluate the job sequence that minimizes total weighted completion time.

### Problem 4

** **

Consider a single‐machine, four‐job, job sequencing problem such that preempting jobs is not permitted. The characteristics of the four jobs, listed in the order they were received, can be found in the table below.

Job Number | Ready Time | Processing Time | Due Date | Weight |

1 | 0 | 12 | 17 | 1 |

2 | 15 | 22 | 40 | 5 |

3 | 30 | 28 | 59 | 8 |

4 | 70 | 31 | 90 | 3 |

Evaluate the performance of the FCFS dispatching rule.