Determination of order delivery time in event organizer industry using a non-delay scheduling approach / Nur Indrianti and Vina Islamia Vervly Suandevin

• Main Authors: Nur Indrianti (Author), Vervly Suandevin, Vina Islamia (Author)
• Format: Article
• Language: English
• Published: Universiti Teknologi MARA Cawangan Sarawak, 2020-06.
• Subjects: Programming. Rule-based programming. Backtrack programming; Operating systems (Computers); Interactive computer systems; Article
• Online Access: Get fulltext; View Fulltext in UiTM IR

 This study discusses the determination of order delivery time in the event organizer (EO) industry. With regard to the characteristics of the EO production process that is identical to the job shop production process in the manufacturing industry, a non-delay scheduling approach is applied. The non-delay schedule is compiled using the non-delay algorithm with the criteria for make span minimization. Job assignment is done using the shortest processing time (SPT), longest processing time (LPT), and first comes first served (FCFS) priority rules. We consider the situation where all orders arrive simultaneously (offline) and at different time (online). As a case study, the modified non-delay algorithm is examined to solve the problem of an EO in Indonesia. The results of the study show that the nondelay algorithm using SPT rule provides the best schedule performance which results in the shortest make span and the lowest resource idle time. In addition to determining the delivery time, the resulting non-delay schedule can be used to control the execution of each order. The method of determining order delivery time in this study can be applied to other service industries. Further study can be developed for situations where order arrival and processing time are probabilistic. Furthermore, it is also necessary to consider the balanced distribution of the workload among operators