Rough-cut capacity planning with production constraints and dynamic bottleneck considerations

A machine-readable medium comprising code which, upon execution by a processor of a computing device, causes said computing device to assess a sufficiency of a plurality of work centers for processing a plurality of jobs during a time interval, each work center having a group of machines for performing an operation, each job having a job priority and including one or more operations to be performed upon a set of items associated with the job, the items of the set being like items, each machine having a preference level for processing the items associated with each job, said preference level being one of a range of machine preference levels, by:

• determining which jobs of said plurality of jobs have an operation that is associated with a work center having an available machine whose preference level for processing the items associated with the job matches a current machine preference level, said current machine preference level having been selected from said range of machine preference levels in decreasing preference order, said determining resulting in a set of candidate jobs;
• selecting a highest priority job from said set of candidate jobs, said selecting resulting in a selected job, the items associated with said selected job being referred to as selected items;
• at each work center associated with an operation of the selected job, allocating one or more machines having either said current machine preference level or a lower machine preference level in respect of the selected items to process a chosen number of units of the selected items, said allocating of machines being performed in decreasing order of machine preference level in respect of the selected items;
• prior to said allocating:
• calculating, for each work center associated with an operation of the selected job, a maximum number of units of the selected items that the work center is capable of processing during said time interval, said calculating being based on availability of machines having said current machine preference level or a lower machine preference level in respect of the selected items and on a processing rate of said machines when processing the selected items, said calculating resulting in a set of numbers, each of said numbers being a maximum number of units capable of being processed by a work center;
• and
• choosing a minimum value from said set of numbers, said minimum value defining a bottleneck number of units of the selected items to be processed during the time interval;
• and
• outputting a rough-cut capacity plan indicative of said allocating,
• wherein the machine preference level of each machine for processing the items associated with a job is dependent upon the items to be processed,
• and wherein said chosen number of units is said bottleneck number of units.

A computing device comprising a processor and persistent storage memory in communication with said processor storing machine readable instructions which, upon execution by said processor, direct said device to assess a sufficiency of a plurality of work centers for processing a plurality of jobs during a time interval, each work center having a group of machines for performing an operation, each job having a job priority and including one or more operations to be performed upon a set of items associated with the job, the items of the set being like items, each machine having a preference level for processing the items associated with each job, said preference level being one of a range of machine preference levels, by:

• determining which jobs of said plurality of jobs have an operation that is associated with a work center having an available machine whose preference level for processing the items associated with the job matches a current machine preference level, said current machine preference level having been selected from said range of machine preference levels in decreasing preference order, said determining resulting in a set of candidate jobs;
• selecting a highest priority job from said set of candidate jobs, said selecting resulting in a selected job, the items associated with said selected job being referred to as selected items;
• and
• at each work center associated with an operation of the selected job, allocating one or more machines having either said current machine preference level or a lower machine preference level in respect of the selected items to process a chosen number of units of the selected items, said allocating of machines being performed in decreasing order of machine preference level in respect of the selected items;
• prior to said allocating:
• calculating, for each work center associated with an operation of the selected job, a maximum number of units of the selected items that the work center is capable of processing during said time interval, said calculating being based on availability of machines having said current machine preference level or a lower machine preference level in respect of the selected items and on a processing rate of said machines when processing the selected items, said calculating resulting in a set of numbers, each of said numbers being a maximum number of units capable of being processed by a work center;
• and
• choosing a minimum value from said set of numbers, said minimum value defining a bottleneck number of units of the selected items to be processed during the time interval;
• and
• outputting a rough-cut capacity plan indicative of said allocating,
• wherein the machine preference level of each machine for processing the items associated with a job is dependent upon the items to be processed,
• and wherein said chosen number of units is said bottleneck number of units.