A heuristic algorithm for dynamic identify bottleneck machine;

operation start probability,individual demand probability of operation for machine and machine aggregate demand,a look-ahead heuristic algorithm,in which machine with the highest aggregate demand probability for the most contended machine/time interval is considered likely the bottleneck in local subproblem,is designed for identifying bottleneck machine dynamically.

After analyzing the shifting bottleneck procedure, a dynamic bottleneck is extended from shifting bottleneck to describe the temporal bottleneck that is different from the spatial shifting bottleneck.

Identifying and relaxing energy bottleneck for a chemical system;

Some advice about breaking bottleneck in industrialization of oxidization technique for producing DSD acid in solvent;

Analysis on bottleneck in refining system of synthetic ammonia plant;

The "preying on" model of high-tech enterprise and analysis of bottle-neck problem of resources;

Solution to Bottle-neck of practice Teaching for Higher Vocational Education;

Walk out the bottle-neck:survey and return model in development of high-level college vollyball teams;