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

Bibliographic Details
Main Author:	Shirley Sinatra Gran
Format:	Thesis
Language:	English
Published:	2014
Online Access:	http://ir.uitm.edu.my/id/eprint/16450/ http://ir.uitm.edu.my/id/eprint/16450/1/TM_SHIRLEY%20SINATRA%20GRAN%20CS%2014_5.pdf

id	uitm-16450
recordtype	eprints
spelling	uitm-164502019-02-21T02:26:41Z http://ir.uitm.edu.my/id/eprint/16450/ Mixed integer goal programming model for flexible job shop scheduling problem (FJSSP) with load balancing / Shirley Sinatra Gran 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 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 Thesis NonPeerReviewed text en http://ir.uitm.edu.my/id/eprint/16450/1/TM_SHIRLEY%20SINATRA%20GRAN%20CS%2014_5.pdf Shirley Sinatra Gran (2014) Mixed integer goal programming model for flexible job shop scheduling problem (FJSSP) with load balancing / Shirley Sinatra Gran. Masters thesis, Universiti Teknologi MARA.
repository_type	Digital Repository
institution_category	Local University
institution	Universiti Teknologi MARA
building	UiTM Institutional Repository
collection	Online Access
language	English
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
author	Shirley Sinatra Gran
spellingShingle	Shirley Sinatra Gran Mixed integer goal programming model for flexible job shop scheduling problem (FJSSP) with load balancing / Shirley Sinatra Gran
author_facet	Shirley Sinatra Gran
author_sort	Shirley Sinatra Gran
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
publishDate	2014
url	http://ir.uitm.edu.my/id/eprint/16450/ http://ir.uitm.edu.my/id/eprint/16450/1/TM_SHIRLEY%20SINATRA%20GRAN%20CS%2014_5.pdf
first_indexed	2023-09-18T22:56:06Z
last_indexed	2023-09-18T22:56:06Z
_version_	1777417863889420288

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

Similar Items