Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem

Flow shop scheduling problems relates the generation of appropriate sequencing for processing of N machines in compliance with given processing sequence orders. Due to costing requirements and time delivery constraints, continuous flow of processing tasks is desired within completion time and wit...

Full description

Bibliographic Details
Main Authors: M., Muziana, Kamal Z., Zamli
Format: Conference or Workshop Item
Language:English
Published: 2015
Subjects:
Online Access:http://umpir.ump.edu.my/id/eprint/8821/1/Development%20of%20Simulated%20Annealing%20Based%20Scheduling%20Algorithm%20for%20Two%20Machines%20Flow%20Shop%20Problem.pdf
_version_ 1825822174943903744
author M., Muziana
Kamal Z., Zamli
author_facet M., Muziana
Kamal Z., Zamli
author_sort M., Muziana
collection UMP
description Flow shop scheduling problems relates the generation of appropriate sequencing for processing of N machines in compliance with given processing sequence orders. Due to costing requirements and time delivery constraints, continuous flow of processing tasks is desired within completion time and with minimum of due date time. Viewing as optimization problem and focusing on two machines, this research aims to develop a new Simulated Annealing based scheduling algorithm, called SA2M, for flow shop problem. The developed algorithm will be compared to the existing Johnson’s algorithm in term of its costs. It is expected that the developed algorithm will perform well if not a par with Johnson’s algorithm
first_indexed 2024-03-06T11:52:38Z
format Conference or Workshop Item
id UMPir8821
institution Universiti Malaysia Pahang
language English
last_indexed 2024-03-06T11:52:38Z
publishDate 2015
record_format dspace
spelling UMPir88212018-01-16T01:20:49Z http://umpir.ump.edu.my/id/eprint/8821/ Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem M., Muziana Kamal Z., Zamli QA76 Computer software Flow shop scheduling problems relates the generation of appropriate sequencing for processing of N machines in compliance with given processing sequence orders. Due to costing requirements and time delivery constraints, continuous flow of processing tasks is desired within completion time and with minimum of due date time. Viewing as optimization problem and focusing on two machines, this research aims to develop a new Simulated Annealing based scheduling algorithm, called SA2M, for flow shop problem. The developed algorithm will be compared to the existing Johnson’s algorithm in term of its costs. It is expected that the developed algorithm will perform well if not a par with Johnson’s algorithm 2015 Conference or Workshop Item PeerReviewed application/pdf en cc_by http://umpir.ump.edu.my/id/eprint/8821/1/Development%20of%20Simulated%20Annealing%20Based%20Scheduling%20Algorithm%20for%20Two%20Machines%20Flow%20Shop%20Problem.pdf M., Muziana and Kamal Z., Zamli (2015) Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem. In: Proceeding Book MUCET 2014, Volume: 1 Engineering & Technology , 10-11 November 2014 , Mahkota Hotel Bandar Hilir Melaka. pp. 1-5.. (Published) http://ocs.utem.edu.my/index.php/mucet2014/MUCET2014/paper/viewFile/8/41
spellingShingle QA76 Computer software
M., Muziana
Kamal Z., Zamli
Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
title Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
title_full Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
title_fullStr Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
title_full_unstemmed Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
title_short Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
title_sort development of simulated annealing based scheduling algorithm for two machines flow shop problem
topic QA76 Computer software
url http://umpir.ump.edu.my/id/eprint/8821/1/Development%20of%20Simulated%20Annealing%20Based%20Scheduling%20Algorithm%20for%20Two%20Machines%20Flow%20Shop%20Problem.pdf
work_keys_str_mv AT mmuziana developmentofsimulatedannealingbasedschedulingalgorithmfortwomachinesflowshopproblem
AT kamalzzamli developmentofsimulatedannealingbasedschedulingalgorithmfortwomachinesflowshopproblem