Scribd
Upload
24 views1 page

Inde4287 Hw2 Gams

The document provides instructions for a homework assignment to solve three scheduling optimization problems using GAMS or another coding language: [1] Minimize total tardiness. [2] Minimize total weighted completion time. [3] Minimize total late jobs. Sample data is provided for six jobs. Students are asked to submit three separate code files that solve each problem formulation.

Uploaded by

ugurum668
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views1 page

Inde4287 Hw2 Gams

The document provides instructions for a homework assignment to solve three scheduling optimization problems using GAMS or another coding language: [1] Minimize total tardiness. [2] Minimize total weighted completion time. [3] Minimize total late jobs. Sample data is provided for six jobs. Students are asked to submit three separate code files that solve each problem formulation.

Uploaded by

ugurum668
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

INDE 4287 – HW2

Due Date: 15.12.2023

Use GAMS/any coding language to solve the following problems. Sample data is provided. Submit your
GAMS/any coding language files with the solutions.

1) Consider the following total tardiness formulation. Solve this formulation using GAMS/any coding
language.
𝑛

min ∑ 𝑡𝑘
𝑘=1
𝑠𝑢𝑏𝑗𝑒𝑐𝑡 𝑡𝑜
𝑛

∑ 𝑥𝑖𝑘 = 1 𝑓𝑜𝑟 𝑘 = 1, … , 𝑛
𝑖=1
𝑛

∑ 𝑥𝑖𝑘 = 1 𝑓𝑜𝑟 𝑖 = 1, … , 𝑛
𝑘=1
𝑛 𝑘 𝑛

∑(𝑝𝑖 ∑ 𝑥𝑖𝑢 ) − ∑ 𝑑𝑖 𝑥𝑖𝑘 ≤ 𝑡𝑘 𝑓𝑜𝑟 𝑘 = 1, … , 𝑛


𝑖=1 𝑢=1 𝑖=1
𝑥𝑖𝑘 ∈ {0,1} 𝑓𝑜𝑟 𝑖, 𝑘 = 1, … , 𝑛

1 𝑖𝑓 𝑗𝑜𝑏 𝑖 𝑖𝑠 𝑎𝑠𝑠𝑖𝑔𝑛𝑒𝑑 𝑡𝑜 𝑘𝑡ℎ 𝑝𝑜𝑠𝑖𝑡𝑖𝑜𝑛 𝑖𝑛 𝑠𝑒𝑞𝑢𝑒𝑛𝑐𝑒


𝑥𝑖𝑘 = {
0 𝑜𝑡ℎ𝑒𝑟𝑤𝑖𝑠𝑒

𝑡𝑘 = 𝑡𝑎𝑟𝑑𝑖𝑛𝑒𝑠𝑠 𝑜𝑓 𝑗𝑜𝑏 𝑘

2) Now solve the problem in GAMS/any coding language by modifying the formulation so that your
objective function is minimizing total weighted completion time instead of minimizing total tardiness.

3) Solve the problem in GAMS/any coding language this time with the objective of minimizing the
total number of late jobs.

Submit three different GAMS/any coding language files (zip them).

Sample data:

Operation A B C D E F

Processing time 12 2 6 14 8 13

Due date 41 4 44 16 35 30

Weight 41 4 44 16 35 30

Hint: You will need a statement in GAMS saying

alias(u, k);

meaning that u and k are actually use the same set, set of positions.

You might also like