2.1. Introduction to Chain Loading

Once the loading of scraper 1 is completed, the pusher will back-track, return back, and spot the next scraper, scraper 2, and start pushing it in the same direction. This is called back-track loading. The pusher gets detached when scraper 1 is fully loaded, travels back to find scraper 2, and then starts pushing it again.

Back-track loading involves a sequence where the pusher moves to load the first scraper, waits until it is fully loaded, and then returns to select and push the next scraper. This process includes a travel back for the pusher, making it a slower method due to the need for additional time to return and continue the operation. The efficiency of this method is influenced by the specific project site conditions.

Imagine a delivery truck that drops off a package at a store. Once the delivery is complete, instead of driving to another store nearby, the truck has to return to the warehouse first before heading out again. This back-and-forth travel takes more time, just like the pusher in the back-track loading method.

One limitation of the back-track loading method is it needs additional time for returning back. This is why we call it the slowest method. The actual time depends on the project site. However, this method is often preferred because it maintains the direction of cutting.

The main drawback of back-track loading is the time lag caused by the need to return to pick up the next scraper, which adds to the overall cycle time. Despite being the slowest method, it is commonly used because it allows workers to maintain consistent direction when cutting and pushing, thereby simplifying the process.

Think of a gardener who is pruning trees in a straight line. Each time the gardener finishes with one tree, instead of moving straight to the next tree, they have to walk back to their tools at the starting point before heading back down the line. This method, although inefficient, helps keep all their tools in one direction.

The chain loading method is commonly followed for long and narrow cuts like roads. In this method, once scraper 1 is loaded, the pusher detaches from scraper 1 and pushes the next scraper without backtracking. The next scraper waits near the pusher.

In chain loading, the pusher does not return to its original position after loading one scraper. Instead, as soon as the first scraper is loaded, the pusher moves on to the second scraper waiting close by. This approach effectively reduces travel time, allowing for a quicker cycle time in operations especially suited for lengthy projects.

Consider a train that stops at a station to let passengers off. Instead of the train going back to the starting point after each stop, it can immediately push forward to the next station as passengers are waiting there. This continuous movement allows for faster overall travel.

When comparing all these methods, back-track loading is the slowest due to return trips, while chain loading and shuttle loading have lesser cycle times.

Each loading method has its advantages and disadvantages. Back-track loading is slower because of its back-and-forth travel. In contrast, chain loading allows for streamlined operations without returning, thus speeding up the cycle. Similarly, shuttle loading facilitates movement in both directions, reducing wait times further.

Imagine a waiter serving food in a restaurant. If they keep returning to the kitchen every time they serve, their pace slows down. However, if they can move between tables without going back until all tables are served, they can complete their rounds more quickly, much like chain and shuttle loading operations.

A thumb rule formula given by Caterpillar can determine the cycle time of the pusher using the loading time of the scraper: Tp = 1.4Lt + 0.25.

This formula allows operators to calculate how long it will take for a pusher to complete a cycle based on how long it takes for a scraper to load. Knowing both times helps in planning efficient operations, ensuring that equipment is used effectively without unnecessary waiting.

It's similar to estimating how long it takes to bake multiple batches of cookies. If you know how long it takes to bake one batch, you can plan out how many batches you can bake in a certain time frame, rather than randomly guessing how much time you need.

It is important to balance interdependent machines like scrapers and pushers to minimize waiting time. A rule to figure out how many scrapers one pusher can serve is: N = Ts / Tp.

To achieve optimum efficiency, it's crucial to ensure that the number of scrapers matches the number of pushers. Calculating this balance helps prevent any delays in the workflow, ensuring that both the pusher and scrapers are fully utilized and do not sit idle waiting for each other.

Think of a teacher in a classroom with several students working on assignments. If there are more students than available desks, some will be idle while waiting for a desk. However, if the number of desks matches the number of students, everyone can work efficiently without waiting.

--