Transcription of Transportation, Assignment and Transshipment problems
{{id}} {{{paragraph}}}
Chapter 7 transportation , Assignment & Transshipment ProblemsPart 2 Prof. Dr. Arslan M. Assignment ProblemsSpecial type of LP, in fact a special type of transportation (workers, processors, machines, vehicles, plants, time slots) are being assigned to tasks(jobs, classrooms, people).Example: Machineco has four jobs to be completed. Each machine must be assigned to complete one job. The time required to setup each machine for completingeach job is given. Machineco wants to minimize the total setup time needed to complete the four jobs.(Also called the cost matrix)The ModelAssignment problem : A balanced transportation problem where all supplies and demands are equal to the supplies and demands for the Machineco problem (and for any assignmentproblem) are integers, so all variables in Machineco soptimal solution must be integers.
Assignment problem: A balanced transportation problem where all supplies and demands are equal to 1. All the supplies and demands for the Machineco problem (and for any assignment problem) are integers, so all variables in Machineco’soptimal solution must be integers. Solve with Transportation simplex. Transportation simplex is often inefficient.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}