Storefront planning: interchangeable bottleneck

Question

I'm currently looking at a quick schedule because I need to implement a Job Shop Scheduling schedule. I researched and found the bottleneck shift algorithm very promising. Since I am not well versed in mathematics and the search algorithm, I would like to ask you if the bottleneck offset fits into my problem area and how it can be achieved that quickgraph or any other tool (or even a custom implementation) in .net / C #

I have several machines that need to produce individual parts. The plays are described by the description of the meta quest. You can prioritize individual tasks. Each job requires a number of tools for the production process, which is either present on the machine or not. Machines can be “linked” together into a resource group that describes which parts can be manufactured on the machine. For example, in the manufacture of LEGO parts, there may exist groups of L-types of resources and I-types (speaking of the shape of the lego part). A manufacturing plant could, for example, have 3 L-type machines and 2 I-type machines.

The scheduling algorithm should calculate the optimal scheduling of work on the machines, so that the machines are always busy. Limitations or costs associated with procurement for procurement may be a priority, the availability of tools necessary for manufacturing on a machine, etc.

Any ideas?

thank

Daniel

Answer 1

Jobs may also require skilled workers along with machines and tools, and all resources may have different calendars (such as shifts) and calendar exceptions. Machines can be multifunctional, and workers can have different skill sets.

, . , Schedlerzer Optisol. . . .

PV