| dc.description.abstract | This thesis focuses on solving a scheduling problem concerning two-stage flowshop of a single processing machine and a batch processing machine with transportation between the two machines taken into account. Both capacity of the vehicle and transportation time are particularly regarded. The batch processing machine processes a number of jobs in a batch so that all jobs in each batch start together, and also finish their processing at the same time whereas single processing machine processes one job at a time. In order to address the aforementioned problems, the objective is to: (1) build a mathematical model capable of minimizing the maximum completion time Cmax (makespan), (2) propose a heuristic algorithm to solve the problem efficiently and (3) develop an applicable program of the heuristic algorithm. The output of the developed program ought to be an optimal sequential jobs scheduling suggestion as well as the expected minimum completion time (4).
Keywords: scheduling, two-stage flowshop, transportation, batch processing machine, heuristic. | en_US |
