Proposed Production Scheduling Using Non-Delay Algorithm to Reduce Makespan

Proposed Production Scheduling Using Non-Delay Algorithm to Reduce Makespan

Table 10 below is the result of scheduling calculations using the non-delay algorithm method. Table 10.

Proposed Production Scheduling Using Non-Delay Algorithm to Reduce Makespan

Proposed Production Scheduling Using Non-Delay Algorithm to Reduce Makespan

4.12.Calculation of Efficiency Index

The efficiency index parameter is used to compare the company's scheduling method with the non-delay algorithm method.

The efficiency index obtained from the comparison of the initial method with the proposed method is 1.16.

4.13.Analysis of Actual Company Production Completion

Cabinet Side PT. Xyz produces various kinds of cabinets. In the production process, each cabinet has a different process flow and machine usage. Based on the various products processed and their flow, the nature of the production flow includes job shop flow. With a varied process flow, the company completes the process or schedule with no work priority. The condition that occurs on the production floor is that the goods that arrive first will be processed earlier. Scheduling this completion is fairly conventional because there are no rules that lead to a schedule with a fixed priority of work. In other conditions, if the accumulation of production shortages on the previous day and daily targets produce large values, the cabinet with the largest production shortage will take precedence in the work process. But it comes back to the availability of goods. If it is not available, the production process will be carried out on the existing goods and come first. This production process is known as the FCFS (first come, first serve) process. Under certain conditions, if there is a demand for emergency goods, the work of the goods will be processed and put aside in the ongoing production process. Then resume the work that is aside when the item is finished.