Question: please i need python code for this question import pulp as p... please i have 60 mins A company has a set of jobs that
A company has a set of jobs that need to be scheduled onto one of two machines (parallel machines). The processing time and penalty for lateness and reward for earliness of each job are shown in the table below. Job 1 Job 2 Job 3 Job 4 Job 5 Job 6 Job 7 Job 8 Processing Time 3 4 6 4 5 3 6 4 Lateness Penalty/Day 9 10 8 7 15 20 13 12 Earliness Reward/Day 20 24 20 23 The due date for all jobs is day 15. The company would like to increase the reward from earliness and reduce the cost of Interess (if any) when processing all jobe on the machines Parameters 1 = Set of jobs, (1,2,...} K = Set of machines, {1,2) Proceeding time of job i, i el =Lateness penalty per day for job i,i 1 ni = Earliness reward per day for job i, ie! . d = Due date all jobs Decision Variable z = Completion time of job 1 W = Whether job i precedes job or not, i elje! fiifi is before ofj is before i x = Whether job i is processed on machine k, ie 1. EK fiifi is processed on lo otherwise Earliness of job i, i el L = Lateness of job i, ie! Mixed Integer Program Tmax -, El Vi er LEK 152; - P; +(2-w-we)+M(1 - Muj) Viel-n, Vj >i andjEIWEK 1,51-+M(2-) + Mi Viel-, Vj > and jer.VEK 4-d Vi er 45d- Vi er -A20 Viel 420 Viel Vie I. V ET binary Viel, Vk EK Note: iel- {n},j>i and je I can also be expressed as i f1.2.1-1).j [i+1...) el My binary A company has a set of jobs that need to be scheduled onto one of two machines (parallel machines). The processing time and penalty for lateness and reward for earliness of each job are shown in the table below. Job 1 Job 2 Job 3 Job 4 Job 5 Job 6 Job 7 Job 8 Processing Time 3 4 6 4 5 3 6 4 Lateness Penalty/Day 9 10 8 7 15 20 13 12 Earliness Reward/Day 20 24 20 23 The due date for all jobs is day 15. The company would like to increase the reward from earliness and reduce the cost of Interess (if any) when processing all jobe on the machines Parameters 1 = Set of jobs, (1,2,...} K = Set of machines, {1,2) Proceeding time of job i, i el =Lateness penalty per day for job i,i 1 ni = Earliness reward per day for job i, ie! . d = Due date all jobs Decision Variable z = Completion time of job 1 W = Whether job i precedes job or not, i elje! fiifi is before ofj is before i x = Whether job i is processed on machine k, ie 1. EK fiifi is processed on lo otherwise Earliness of job i, i el L = Lateness of job i, ie! Mixed Integer Program Tmax -, El Vi er LEK 152; - P; +(2-w-we)+M(1 - Muj) Viel-n, Vj >i andjEIWEK 1,51-+M(2-) + Mi Viel-, Vj > and jer.VEK 4-d Vi er 45d- Vi er -A20 Viel 420 Viel Vie I. V ET binary Viel, Vk EK Note: iel- {n},j>i and je I can also be expressed as i f1.2.1-1).j [i+1...) el My binary
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
