Mathematical Modeling of Finite Capacity Job Shop Scheduling Using Theory
of Constraints
Student Name: K.Ramshanker
Pseudo-codes were developed for Goldratt's Theory of
Constraints (TOC) for Finite Capacity Job Shop Scheduling. The algorithm of
TOC is to accept the existence of an unbalanced plant, one in which some
resource is a constraint; identify the constraint (called the primary
constraint); decide the plan for the primary constraint that best supports the
organizational goal; alter or manage the systems policies, processes and
other resources to support the decisions; add capacity or otherwise change
the status of the original resource as dominating primary constraint, taking
care that none of the previous decisions become constraints.