Return to search

Solution Approaches For Flexible Job Shop Scheduling Problems

discrete parts manufacturing industries. We are motivated by the production
environment of Roketsan Missiles Industries Incorporation, operating at Turkish
defense industry. Our objective is to minimize the total weighted completion
times of the jobs in the system.
We formulate the problem as a mixed integer linear program and find that our
model could find optimal solutions only to small sized problem instances. For
medium and large sized problem instances, we develop heuristic algorithms with
high quality approximate solutions in reasonable solution time.
Our proposed heuristic algorithm has hierarchical approach and benefits from
optimization models and priority rules. We improve the heuristic method via
best move with non-blocking strategy and design several experiments to test the
performances. Our computational results have revealed that proposed heuristic
algorithm can find high quality solutions to large sized instances very quickly.

Identiferoai:union.ndltd.org:METU/oai:etd.lib.metu.edu.tr:http://etd.lib.metu.edu.tr/upload/12615676/index.pdf
Date01 February 2013
CreatorsBalci, Serife Aytug
ContributorsAzizoglu, Meral
PublisherMETU
Source SetsMiddle East Technical Univ.
LanguageEnglish
Detected LanguageEnglish
TypeM.S. Thesis
Formattext/pdf
RightsTo liberate the content for public access

Page generated in 0.0018 seconds