Scheduling for the Supplier Arrival by considering Sumber Daya Terbatas in serving Proses Unloading Material (the Case Study in PT. XYZ)

This article was aimed to study about supplier arrival scheduling problem at a materials handling and unloading place by considering resources constraint to serve it. The problem is modeled into serial structure multi projects scheduling to minimize total actual flowtime (makespan). In this case, each supplier is assumed to pass several sequenced material handling steps. Each step represents an activity that uses the same kind and quantity of resource during certain time interval. Integer linear programming is used to solve this problem. Final schedule show that total actual flowtime of all unloading activities is lower than available time. Thus, it is possible to add several suppliers to increase resource utilization. Sensitivity analysis also shows that one unit reduction of docks, inspectors, and handpalets is feasible solution to increase resource utilization.