#TITLE_ALTERNATIVE#

• Main Author: DWI ASTUTI (NIM: 23412001) ; Pembimbing : Prof. Dr. Ir. Abdul Hakim Halim, MURNI
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/19025
• Institution: Institut Teknologi Bandung

This research concern about batch scheduling problem at single batch processor considering unconstant batch processing time. Batch processor is a machine which processing each part of batch simultaneously (start and finish at the same time). In this research, batch processing time is a processing time of all part at batch processor and tools installation time at each part of the batch. The part processing time of the batch (t) and the tools installation time at each part (a) are asumed to be constant. Therefore, batch processing time will be the same as (t + aQ). The decision variabel in this research are number of batch (N), batch size (Qi) and batch processing sequence considering the objective of minimizing total actual flow time. <br /> <br /> <br /> <br /> <br /> This research is generated in two stages. First stage is a developing stage of batch scheduling model at single batch processor considering unconstant batch processing time for the case of single item common due date and generate a solution searching algorithm for the model. Second stage is the stage of developing model for the case of multi due date and generated solution of searching algorithm for the model. <br /> <br /> <br /> <br /> <br /> Scheduling model for the case of single item common due date is formulated using an analytical algorithm. The result is an optimal solution and it schedules backwardly. In the case of multi due date, it is formulated from one interval of time Hh as a case of common due date. Whenever the interval of time Hh doesn’t suite to the condition of - s t + anh* Hh, so each part can be sent to the next interval of time. nh* is the number of part sent to its own interval of time added to the number of part which can not be processed at the predecessor interval of time, if there is. Therefore, all schedule will be feasible if h = r (last interval of time) fill the condition of - s t + anh* Hh. To test the performances of model, the hypotetic set of data is generated.