UMP Institutional Repository

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

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..

[img]
Preview
PDF
Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem.pdf - Published Version
Available under License Creative Commons Attribution.

Download (863kB) | Preview

Abstract

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

Item Type: Conference or Workshop Item (Speech)
Additional Information: ISBN: 978-967-0257-53-2
Uncontrolled Keywords: flowshop, Simulated Annealing, makespan
Subjects: Q Science > QA Mathematics > QA76 Computer software
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Mrs. Neng Sury Sulaiman
Date Deposited: 19 Aug 2015 06:20
Last Modified: 16 Jan 2018 01:20
URI: http://umpir.ump.edu.my/id/eprint/8821
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item