BATCH SCHEDULING MODEL ON FLEXIBLE FLOW LINE WITH MISSING OPERATIONS TO MINIMIZE TOTAL ACTUAL FLOW TIME

This study discusses a batch scheduling model with criteria the total minimization of actual flow time on flexible flow line with missing operations. Missing operations is a condition when not all jobs are processed at each stage. In this study, the stages in flexible flow line are divided into thre...

Full description

Saved in:
Bibliographic Details
Main Author: RAHMAWATI, SINTA
Format: Theses
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/40240
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
id id-itb.:40240
spelling id-itb.:402402019-07-01T13:08:07ZBATCH SCHEDULING MODEL ON FLEXIBLE FLOW LINE WITH MISSING OPERATIONS TO MINIMIZE TOTAL ACTUAL FLOW TIME RAHMAWATI, SINTA Indonesia Theses batch scheduling, missing operations, total actual flow time INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/40240 This study discusses a batch scheduling model with criteria the total minimization of actual flow time on flexible flow line with missing operations. Missing operations is a condition when not all jobs are processed at each stage. In this study, the stages in flexible flow line are divided into three types, namely: stages that do not have successors, stages that have successors and predecessors, and stages that have no predecessor. The decision variables in this study are the number and size of batches and the batch sequence that will be processed. Heuristic algorithms are proposed to solve problems in the batch scheduling model with the criteria the total minimization of actual flow time on flexible flow line with missing operations. The solution of the proposed algorithm starts with determining the batch number and the batch size, and then determines the batch sequence produced. Determination of batch number and batch size is carried out at stages that do not have successors by using algorithm 5.1 on Halim et al (1994), namely the problem of multi item batch scheduling on a single machine. The scheduling process considers the existence of a batch distribution to be processed simultaneously into several available machines. The test results show that the proposal model is sensitive to the number of demand’s changes, processing time, setup time and the number of machine. On the contrary, the solution on the proposed algorithm is not sensitive to the due date parameter’s changes. text
institution Institut Teknologi Bandung
building Institut Teknologi Bandung Library
continent Asia
country Indonesia
Indonesia
content_provider Institut Teknologi Bandung
collection Digital ITB
language Indonesia
description This study discusses a batch scheduling model with criteria the total minimization of actual flow time on flexible flow line with missing operations. Missing operations is a condition when not all jobs are processed at each stage. In this study, the stages in flexible flow line are divided into three types, namely: stages that do not have successors, stages that have successors and predecessors, and stages that have no predecessor. The decision variables in this study are the number and size of batches and the batch sequence that will be processed. Heuristic algorithms are proposed to solve problems in the batch scheduling model with the criteria the total minimization of actual flow time on flexible flow line with missing operations. The solution of the proposed algorithm starts with determining the batch number and the batch size, and then determines the batch sequence produced. Determination of batch number and batch size is carried out at stages that do not have successors by using algorithm 5.1 on Halim et al (1994), namely the problem of multi item batch scheduling on a single machine. The scheduling process considers the existence of a batch distribution to be processed simultaneously into several available machines. The test results show that the proposal model is sensitive to the number of demand’s changes, processing time, setup time and the number of machine. On the contrary, the solution on the proposed algorithm is not sensitive to the due date parameter’s changes.
format Theses
author RAHMAWATI, SINTA
spellingShingle RAHMAWATI, SINTA
BATCH SCHEDULING MODEL ON FLEXIBLE FLOW LINE WITH MISSING OPERATIONS TO MINIMIZE TOTAL ACTUAL FLOW TIME
author_facet RAHMAWATI, SINTA
author_sort RAHMAWATI, SINTA
title BATCH SCHEDULING MODEL ON FLEXIBLE FLOW LINE WITH MISSING OPERATIONS TO MINIMIZE TOTAL ACTUAL FLOW TIME
title_short BATCH SCHEDULING MODEL ON FLEXIBLE FLOW LINE WITH MISSING OPERATIONS TO MINIMIZE TOTAL ACTUAL FLOW TIME
title_full BATCH SCHEDULING MODEL ON FLEXIBLE FLOW LINE WITH MISSING OPERATIONS TO MINIMIZE TOTAL ACTUAL FLOW TIME
title_fullStr BATCH SCHEDULING MODEL ON FLEXIBLE FLOW LINE WITH MISSING OPERATIONS TO MINIMIZE TOTAL ACTUAL FLOW TIME
title_full_unstemmed BATCH SCHEDULING MODEL ON FLEXIBLE FLOW LINE WITH MISSING OPERATIONS TO MINIMIZE TOTAL ACTUAL FLOW TIME
title_sort batch scheduling model on flexible flow line with missing operations to minimize total actual flow time
url https://digilib.itb.ac.id/gdl/view/40240
_version_ 1821998030288584704