A BATCH SCHEDULING MODEL FOR A FLOW SHOP WITH DETERIORATING MACHINES PROCESSING MULTI ITEM WITH A COMMON DUE DATE TO MINIMIZE TOTAL ACTUAL FLOW TIME

Scheduling is very important in production activities, because it affects the productivity of the company. Scheduling needed for the allocation of resources such as machines, labor, and materials being organized and efficient. In the existing batch scheduling literature, one of the assumptions commo...

Full description

Saved in:
Bibliographic Details
Main Author: ANGGRAENI SIBARANI (NIM: 23414006), AYU
Format: Theses
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/21345
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
id id-itb.:21345
spelling id-itb.:213452017-09-29T14:35:41ZA BATCH SCHEDULING MODEL FOR A FLOW SHOP WITH DETERIORATING MACHINES PROCESSING MULTI ITEM WITH A COMMON DUE DATE TO MINIMIZE TOTAL ACTUAL FLOW TIME ANGGRAENI SIBARANI (NIM: 23414006), AYU Indonesia Theses INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/21345 Scheduling is very important in production activities, because it affects the productivity of the company. Scheduling needed for the allocation of resources such as machines, labor, and materials being organized and efficient. In the existing batch scheduling literature, one of the assumptions commonly used is that the processing time of jobs are constant.. In real situations, many cases show that the processing time of a job may change, one of which becomes longer due to the decreased ability of machine caused by the increasing usage or life time of the machine. This condition is known as machine deterioration. <br /> <br /> This research proposes a batch scheduling model for a flow shop with deteriorating machines processing multi item with a common due date. The objectives is to minimize total actual flow time. The decision variables in this research are number of batch (&#119873;), batch size (&#119876;[&#119894;]), and batch processing sequence. The problem-solving method was developed by proposed heuristic algorithms.The proposed algorithm is consist of feasibility sub algorithm, batching sub algorithm, and sequence sub algorithm. <br /> <br /> Numerical testing shows that the proposed algorithm is able to solve the problem of a batch scheduling for a flow shop with deteriorating machines processing multi item with a common due date. The solution obtained by the algorithm is a feasible solution. 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 Scheduling is very important in production activities, because it affects the productivity of the company. Scheduling needed for the allocation of resources such as machines, labor, and materials being organized and efficient. In the existing batch scheduling literature, one of the assumptions commonly used is that the processing time of jobs are constant.. In real situations, many cases show that the processing time of a job may change, one of which becomes longer due to the decreased ability of machine caused by the increasing usage or life time of the machine. This condition is known as machine deterioration. <br /> <br /> This research proposes a batch scheduling model for a flow shop with deteriorating machines processing multi item with a common due date. The objectives is to minimize total actual flow time. The decision variables in this research are number of batch (&#119873;), batch size (&#119876;[&#119894;]), and batch processing sequence. The problem-solving method was developed by proposed heuristic algorithms.The proposed algorithm is consist of feasibility sub algorithm, batching sub algorithm, and sequence sub algorithm. <br /> <br /> Numerical testing shows that the proposed algorithm is able to solve the problem of a batch scheduling for a flow shop with deteriorating machines processing multi item with a common due date. The solution obtained by the algorithm is a feasible solution.
format Theses
author ANGGRAENI SIBARANI (NIM: 23414006), AYU
spellingShingle ANGGRAENI SIBARANI (NIM: 23414006), AYU
A BATCH SCHEDULING MODEL FOR A FLOW SHOP WITH DETERIORATING MACHINES PROCESSING MULTI ITEM WITH A COMMON DUE DATE TO MINIMIZE TOTAL ACTUAL FLOW TIME
author_facet ANGGRAENI SIBARANI (NIM: 23414006), AYU
author_sort ANGGRAENI SIBARANI (NIM: 23414006), AYU
title A BATCH SCHEDULING MODEL FOR A FLOW SHOP WITH DETERIORATING MACHINES PROCESSING MULTI ITEM WITH A COMMON DUE DATE TO MINIMIZE TOTAL ACTUAL FLOW TIME
title_short A BATCH SCHEDULING MODEL FOR A FLOW SHOP WITH DETERIORATING MACHINES PROCESSING MULTI ITEM WITH A COMMON DUE DATE TO MINIMIZE TOTAL ACTUAL FLOW TIME
title_full A BATCH SCHEDULING MODEL FOR A FLOW SHOP WITH DETERIORATING MACHINES PROCESSING MULTI ITEM WITH A COMMON DUE DATE TO MINIMIZE TOTAL ACTUAL FLOW TIME
title_fullStr A BATCH SCHEDULING MODEL FOR A FLOW SHOP WITH DETERIORATING MACHINES PROCESSING MULTI ITEM WITH A COMMON DUE DATE TO MINIMIZE TOTAL ACTUAL FLOW TIME
title_full_unstemmed A BATCH SCHEDULING MODEL FOR A FLOW SHOP WITH DETERIORATING MACHINES PROCESSING MULTI ITEM WITH A COMMON DUE DATE TO MINIMIZE TOTAL ACTUAL FLOW TIME
title_sort batch scheduling model for a flow shop with deteriorating machines processing multi item with a common due date to minimize total actual flow time
url https://digilib.itb.ac.id/gdl/view/21345
_version_ 1821120434349801472