5.1. Thumb Rule Formula for Cycle Time

Once the loading of scraper 1 is completed, the pusher will back-track and return to spot scraper 2 and start pushing it in the same direction. This is what we call back-track loading. The limitation of this method is that it needs additional time for returning back, making it the slowest method.

Back-track loading involves a pusher that, after loading a scraper, has to detach and return to fetch the next scraper. This backtracking takes time, contributing to its designation as the slowest loading method. The key point is that while this method is slower due to travel time, it is commonly used because operators prefer to maintain a uniform cutting direction, making operations smoother despite the longer cycle time.

Imagine a waiter serving food at a restaurant. After serving one table, instead of directly moving to the next, the waiter goes back to the kitchen to fetch another tray before approaching the next table. This creates delays, making the overall service slower, but the waiter does it because it provides a more organized and streamlined approach for serving tables along a particular route.

In chain loading, once scraper 1 is fully loaded, the pusher does not return but instead pushes the next scraper 2, which waits nearby. This method is notably efficient for long, narrow cuts like roads as it reduces return time and cycle time.

Chain loading is a more efficient method where the next scraper is positioned close to the pusher, eliminating the need for backtracking. When the first scraper is loaded, the pusher can quickly transition to the next scraper, significantly reducing the overall cycle time. This method is particularly useful in situations where scrapers can be arranged closely together, such as in long linear projects like road works.

Consider a relay race where a runner passes the baton to a teammate waiting right beside them. If the next runner is positioned close, the transition is quick and smooth compared to a scenario where the runner has to return to a distant point to hand off the baton. This efficient passing leads to a better overall time for the team, similar to how chain loading improves operational efficiency.

Shuttle loading is used when there are fill areas in both directions. The pusher detaches from scraper 1 and immediately starts pushing the next scraper in the opposite direction, which reduces the return time as well.

Shuttle loading involves a pusher that can work in both directions between two fill areas. Once the first scraper is fully loaded, the pusher switches to pushing another scraper in the opposite direction. This method minimizes waiting time and maintains a steady workflow because the pusher is not required to return to a single point to fetch the next scraper.

Think of a double-decker bus that makes stops on both sides of the street. Instead of going back to a central bus stop after each drop-off, it can immediately stop on the other side to pick up more passengers. This dual-direction approach allows for more efficient use of time and resources, akin to how shuttle loading maximizes operational efficiency.

A thumb rule formula, provided by Caterpillar, helps determine the cycle time of the pusher based on the loading time of the scraper: $T_p = 1.4L + 0.25$, where $L$ is the scraper load time.

The formula helps calculate the cycle time of the pusher (the time it takes to complete one full operation) by considering the loading time of the scraper. The formula indicates that as the loading time increases, the cycle time will also increase, thus giving operators a useful tool for estimating how long operations will take based on loading times.

Think of a chef preparing meals in a kitchen. If the time to cook spaghetti (loading time) increases, it naturally takes longer to complete the entire meal (cycle time). The chef can anticipate this using a simple calculation based on their cooking schedule, much like how operators can use the thumb rule formula to manage pusher operations effectively.

To balance interdependent machines, you must choose the correct number of scrapers and pushers to minimize waiting time and maximize production efficiency. The formula for determining the number of scrapers served by one pusher is: $N = \frac{T_s}{T_p}$, where $N$ is the number of scrapers, $T_s$ is the scraper cycle time, and $T_p$ is the pusher cycle time.

The balance between the number of scrapers and pushers is crucial for optimizing productivity. When the pusher's cycle time is known, operators can determine how many scrapers a single pusher can effectively serve without causing delays. This ensures that both machines operate at peak efficiency with minimal idle time, leading to improved overall productivity.

Consider an assembly line in a factory where workers are assembling products. If one worker is bogged down with too many parts to assemble while others are left without tasks, production slows. By balancing the number of workers and assigning them tasks based on their capacity, assembly lines can run smoothly and effectively, just as balancing scrapers and pushers enhances operational flow in excavation projects.

--