Type

Data source

Date

Thumbnail

Search results

2 records were found.

Constant Work-in-Process (ConWIP) is a card-based control system that was developed for simple flow shops – a lack of load-balancing capabilities hinders its application to more complex shops. In contrast, load balancing is an integral part of Workload Control, a production planning and control concept developed for high-variety environments. One means of load balancing evident in the Workload Control literature is through the use of a capacity slack-based backlog-sequencing rule. This study therefore investigates the potential of the backlog-sequencing decision to improve load balancing in the context of ConWIP, thereby making it suitable for more complex, high-variety environments. Using simulation, we demonstrate that: (i) the choice of backlog-sequencing rule significantly impacts throughput times and tardiness-related performance measures; and (ii) capacity slack-based sequencing rules achieve significant performance improvements over ‘classical’ ConWIP backlog-sequencing rules. These results significantly extend the applicability of ConWIP. Results from the Workload Control literature however do not directly translate across to ConWIP. The simplified release procedure of ConWIP makes backlog-sequencing based on planned release dates dysfunctional. This negatively impacts the performance of modified capacity slack-based sequencing rules that were recently shown to be the best choice for Workload Control.
POLCA (i.e. Paired-cell Overlapping Loops of Cards with Authorization) is a card-based production control approach developed to support the adoption of Quick Response Manufacturing. The approach has received significant research attention but has remained largely unchanged since its introduction in the late 1990s. The main improvements have occurred in the context of an electronic POLCA system, but such developments undermine the simplicity of the original card-based concept. We ask: is there any refinement possible to enhance the performance of POLCA without jeopardizing its simplicity? By analyzing POLCA, two possible refinements are identified: (i) the choice of rule to support both the card allocation and dispatching decisions; and (ii) the use of a starvation avoidance mechanism to overcome premature station idleness, as reported in the context of load limiting order release. Using simulation, we demonstrate that performance gains can be obtained by using different rules for card allocation and dispatching other than the earliest release date rule typically applied in POLCA for both decisions. Further, results demonstrate performance improvements for all combinations of card allocation and dispatching rules considered via the addition of a simple starvation avoidance mechanism. Both refinements significantly enhance POLCA performance, potentially furthering its application in practice.