Ajob shop scheduling problem
seven jobs (1, 2, 3, 4, 5, 6, 7) need to be processed today in a machine shop that has 4
machines (a, b, c, d). a machine can process multiple jobs. the following table provides the
processing time (hours) and processing cost ($) on each machine, as well as the number of
hours each machine is available today. for example, job 3 requires 5 hours processing time on
machine c which costs $130; the available time on machine c today is 10 hours. a"-" for the
(1.j) element means that machine i cannot process job j. find the assignments of jobs to
machines so that all jobs are processed today at minimum total cost given the availability of the
machines. solve using lingo's modeling language.