Mixed integer goal programming model for flexible job shop scheduling problem (FJSSP) with load balancing / Shirley Sinatra Gran

In manufacturing-related industries, scheduling of resources and tasks play an important role in improving efficiency and productivityas well as reducing costs. Job shop scheduling problem (JSSP) concerns with the problem whereby there is only one machine that can process one type of operation. The...

Full description

Saved in:

Bibliographic Details
Main Author:	Gran, Shirley Sinatra
Format:	Thesis
Language:	English
Published:	2014
Online Access:	https://ir.uitm.edu.my/id/eprint/16450/1/TM_SHIRLEY%20SINATRA%20GRAN%20CS%2014_5.pdf
Tags:	Add Tag No Tags, Be the first to tag this record!

id	my-uitm-ir.16450
record_format	uketd_dc
spelling	my-uitm-ir.164502022-04-08T07:16:42Z Mixed integer goal programming model for flexible job shop scheduling problem (FJSSP) with load balancing / Shirley Sinatra Gran 2014-01 Gran, Shirley Sinatra In manufacturing-related industries, scheduling of resources and tasks play an important role in improving efficiency and productivityas well as reducing costs. Job shop scheduling problem (JSSP) concerns with the problem whereby there is only one machine that can process one type of operation. The flexible job shop scheduling problem (FJSSP) is an extension of t he job shop scheduling problem. FJSSP allows an operation to be processed by any machine out of a set of alternative machines. Thus, the objectives of this study are to analyze the production schedules and operations of the machines in FJSSP, to construct a load balancing constraint function, to formulate a Mixed Integer Goal Programming (MIGP) model to solve FJSSP with load balancing; and to propose an optimal production job shop scheduling strategies based on the solution model. The MIGP model formulated is to solve FJSSP with three objective functions, which are to minimize the makespan, the total machining time and the mean absolute deviation of the total machining time to achieve machine’s load balancing. The model was solved by implementing the pre-emptive goal programming approach and using the Microsoft Excel Solver Add-Ins. The novelties of this study are the introduction of the objective function that minimizes the mean absolute deviation of the total machining time and therefore producing balanced load (total machining time) among machines used in the FJSSP. Data from benchmark problem instances for the general FJSSP with total flexibility by Kacem, Hammadi and Borne has been used in the computational experiments. Optimal solutions were found for the FJSSP involved. The results obtained proved that the proposed solution approach gives competitive results as compared to the metaheuristics approaches. 2014-01 Thesis https://ir.uitm.edu.my/id/eprint/16450/ https://ir.uitm.edu.my/id/eprint/16450/1/TM_SHIRLEY%20SINATRA%20GRAN%20CS%2014_5.pdf text en public mphil masters Universiti Teknologi MARA Faculty of Computer and Mathematical Sciences Shuib, Adibah (Assoc. Prof. Dr.)
institution	Universiti Teknologi MARA
collection	UiTM Institutional Repository
language	English
advisor	Shuib, Adibah (Assoc. Prof. Dr.)
description	In manufacturing-related industries, scheduling of resources and tasks play an important role in improving efficiency and productivityas well as reducing costs. Job shop scheduling problem (JSSP) concerns with the problem whereby there is only one machine that can process one type of operation. The flexible job shop scheduling problem (FJSSP) is an extension of t he job shop scheduling problem. FJSSP allows an operation to be processed by any machine out of a set of alternative machines. Thus, the objectives of this study are to analyze the production schedules and operations of the machines in FJSSP, to construct a load balancing constraint function, to formulate a Mixed Integer Goal Programming (MIGP) model to solve FJSSP with load balancing; and to propose an optimal production job shop scheduling strategies based on the solution model. The MIGP model formulated is to solve FJSSP with three objective functions, which are to minimize the makespan, the total machining time and the mean absolute deviation of the total machining time to achieve machine’s load balancing. The model was solved by implementing the pre-emptive goal programming approach and using the Microsoft Excel Solver Add-Ins. The novelties of this study are the introduction of the objective function that minimizes the mean absolute deviation of the total machining time and therefore producing balanced load (total machining time) among machines used in the FJSSP. Data from benchmark problem instances for the general FJSSP with total flexibility by Kacem, Hammadi and Borne has been used in the computational experiments. Optimal solutions were found for the FJSSP involved. The results obtained proved that the proposed solution approach gives competitive results as compared to the metaheuristics approaches.
format	Thesis
qualification_name	Master of Philosophy (M.Phil.)
qualification_level	Master's degree
author	Gran, Shirley Sinatra
spellingShingle	Gran, Shirley Sinatra Mixed integer goal programming model for flexible job shop scheduling problem (FJSSP) with load balancing / Shirley Sinatra Gran
author_facet	Gran, Shirley Sinatra
author_sort	Gran, Shirley Sinatra
title	Mixed integer goal programming model for flexible job shop scheduling problem (FJSSP) with load balancing / Shirley Sinatra Gran
title_short	Mixed integer goal programming model for flexible job shop scheduling problem (FJSSP) with load balancing / Shirley Sinatra Gran
title_full	Mixed integer goal programming model for flexible job shop scheduling problem (FJSSP) with load balancing / Shirley Sinatra Gran
title_fullStr	Mixed integer goal programming model for flexible job shop scheduling problem (FJSSP) with load balancing / Shirley Sinatra Gran
title_full_unstemmed	Mixed integer goal programming model for flexible job shop scheduling problem (FJSSP) with load balancing / Shirley Sinatra Gran
title_sort	mixed integer goal programming model for flexible job shop scheduling problem (fjssp) with load balancing / shirley sinatra gran
granting_institution	Universiti Teknologi MARA
granting_department	Faculty of Computer and Mathematical Sciences
publishDate	2014
url	https://ir.uitm.edu.my/id/eprint/16450/1/TM_SHIRLEY%20SINATRA%20GRAN%20CS%2014_5.pdf
_version_	1783733532197126144

Mixed integer goal programming model for flexible job shop scheduling problem (FJSSP) with load balancing / Shirley Sinatra Gran

Similar Items