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

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:
QA76 Computer software
Online Access:http://umpir.ump.edu.my/id/eprint/8821/
http://umpir.ump.edu.my/id/eprint/8821/
http://umpir.ump.edu.my/id/eprint/8821/1/Development%20of%20Simulated%20Annealing%20Based%20Scheduling%20Algorithm%20for%20Two%20Machines%20Flow%20Shop%20Problem.pdf
id ump-8821
recordtype eprints
spelling ump-88212018-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.. http://ocs.utem.edu.my/index.php/mucet2014/MUCET2014/paper/viewFile/8/41
repository_type Digital Repository
institution_category Local University
institution Universiti Malaysia Pahang
building UMP Institutional Repository
collection Online Access
language English
topic QA76 Computer software
spellingShingle QA76 Computer software
M., Muziana
Kamal Z., Zamli
Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem
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
format Conference or Workshop Item
author M., Muziana
Kamal Z., Zamli
author_facet M., Muziana
Kamal Z., Zamli
author_sort M., Muziana
title 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_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_sort development of simulated annealing based scheduling algorithm for two machines flow shop problem
publishDate 2015
url http://umpir.ump.edu.my/id/eprint/8821/
http://umpir.ump.edu.my/id/eprint/8821/
http://umpir.ump.edu.my/id/eprint/8821/1/Development%20of%20Simulated%20Annealing%20Based%20Scheduling%20Algorithm%20for%20Two%20Machines%20Flow%20Shop%20Problem.pdf
first_indexed 2023-09-18T22:06:48Z
last_indexed 2023-09-18T22:06:48Z
_version_ 1777414762737434624

Similar Items