Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

int NTasks = . . . ; / / Number of tasks are read from data file int NStations = . . . ; range

int NTasks=...; //Number of tasks are read from data file
int NStations=...;
range Tasks=1..NTasks;
range Stations=1..NStations;
float T[Tasks]=...;
int b[Tasks][Tasks]=...;
dvar boolean x[Tasks][Stations];
dvar float+ Tc;
minimize Tc;
subject to
{
forall(i in Stations)
Tc>=sum(j in Tasks)T[j]*x[j][i];
forall(j in Tasks)
sum(i in Stations)x[j][i]==1;
forall(j in Tasks, k in Tasks:j!=k)
sum (i in Stations)i*x[k][i]>=b[j][k]*sum (i in Stations)i*x[j][i];
} rewrite this code as a CP With IBM CPLEX

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Filing And Computer Database Projects

Authors: Jeffrey Stewart

2nd Edition

007822781X, 9780078227813

More Books

Students also viewed these Databases questions