Determination of Order Delivery Time in Event Organizer Industry Using a Non-Delay Scheduling Approach

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 makespan 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 makespan 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. Determination of Order Delivery Time in Event

Optimized Three-Stage Strategy of Orderly Management of File Stream in Network Printing Workflow

This paper proposed the optimized three-stage strategy of orderly management of file stream in network printing workflow. In first stage the customer preflight was added to the conventional prepress preflight, which set quick-type, general-type, stable-type and comprehensive-type preflight scheme for customers by investigating the possibility of occurrence of errors of various preflight entries and customer relevancy. Based on four types of preflight schemes, four customer preflight applications were created by using Pitstop Pro and Connector You. Customers can select one of the appropriate applications for quick preflight before delivering to reduce the probability of returning the files back for correction when errors occur in preflight. Second stage is printing enterprise prepress preflight, which proposed the concept of the prepress preflight tolerance. In addition, according to the different requirements of printing technology and quality, this paper established the prepress preflight scheme based on the printing enterprises’ tolerance for preflight error. Third stage is to manage the optimized sorting of prepress file stream. To achieve it, the SPT rule and the 0-1 programming model were adopted, time spend of preflight, printing process and post-press finishing was also taken into account. Moreover, Enfocus Switch software was applied to establish automated network printing workflow and complete the file stream sorting. Finally, the result of simulation analysis of the optimized strategy shows that the optimized three-stage strategy can effectively shorten the file processing time.

An Orderly Untangling Model against Arching Effect in Emergency Evacuation Based on Equilibrium Partition of Crowd

To untangle the arching effect of a crowd as much as possible in emergency evacuations, we employ a theoretical model of equilibrium partition of crowd batch. Based on the shortest time arrangement of evacuation, the crowd is divided into appropriate batches according to the occupied time of evacuation channel in order to determine the occupant number of every evacuation passageway. The number of each batch crowd is calculated under the condition that the time of entering the evacuation passageway is equal to the time of crossing over the evacuation passageway. Subsequently, the shortest processing time (SPT) rule establishes the evacuation order of each batch. Taking a canteen of China Three Gorges University as a background, we obtain the waiting time from the first person to the last one entering the evacuation channel in every batch by simulation. This research utilizes data from simulations to observe an untangling process against the arching effect based on the SPT rule. More specifically, evacuation time only lasts for 180.1 s in order and is 1.6 s longer than that in disorder, but the arching effect disappears. Policy recommendations are offered to improve the evacuation scheme in disaster operations.

Determination of Transportation Fleet Size using The Combination of Adjusted SPT Rule and Linear Programming Method

<p>In a very competitive industry, XYZ Ltd. needs to have an effective, efficient and reliable logistics fleet management. The fleets should be able to help the company serve the market demands and guarantee the distribution of its products. This research analyzed and determined the by-truck transportation fleet size of XYZ Ltd using the combination of adjusted SPT Rule and linear programming method. The results showed that the product delivery’s scheduling was arranged by operating a fleet of 13 tronton trucks and 25 trailer trucks, with the scheduling of delivery resulting in maximum makespan of 6.98 days and an average flow-time per shipment of 3.83 days. <br /><strong>Keywords</strong>: Fleet Management, Logistics Transportation, Adjusted SPT</p>

Optimal Rules for Single Machine Scheduling with Stochastic Breakdowns

This paper studies the problem of scheduling a set of jobs on a single machine subject to stochastic breakdowns, where jobs have to be restarted if preemptions occur because of breakdowns. The breakdown process of the machine is independent of the jobs processed on the machine. The processing times required to complete the jobs are constants if no breakdown occurs. The machine uptimes are independently and identically distributed (i.i.d.) and are subject to a uniform distribution. It is proved that theLongest Processing Time first(LPT) rule minimizes the expected makespan. For the large-scale problem, it is also showed that theShortest Processing Time first(SPT) rule is optimal to minimize the expected total completion times of all jobs.