DSCI 304 Chapter Notes - Chapter 16: Yield Management, Gantt Chart, Hungarian Algorithm

46 views3 pages

Document Summary

Assignment model a linear programming model for optimal assignment of tasks and resources. Backward scheduling scheduling backward from a due date. Finite loading jobs are assigned to work centers taking into account the work center capacity and job processing times. Flow system high-volume system in which jobs all follow the same sequence. Forward system scheduling ahead from a point in time. Gantt chart chart used as visual aid for loading and scheduling purposes. Global priority rules incorporate information from multiple workstations when establishing a job sequence. Hungarian method method of assigning jobs by a one-for-one matching to identify the lowest-cost solution. Infinite loading jobs are assigned to work centers without regard to the capacity of the work center. Input/output control managing work flow and queues at work centers. Job flow time the amount of time from when a job arrives until it is finished. Job lateness the difference between the actual completion date and the due date.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents