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...
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 |
Similar Items
-
A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem
by: Kelvin, Lim Ching Wei
Published: (2023) -
Simulated Annealing Based Strategy for Test Redundancy Reduction
by: Kamal Z., Zamli, et al.
Published: (2014) -
Harmony annealing algorithm for curriculum-based course timetabling problem
by: Wahid, Juliana, et al.
Published: (2012) -
Simulated annealing with probabilistic analysis for solving traveling salesman problems
by: Hong, Pei Yee, et al.
Published: (2013) -
Comparative study of five metaheuristic algorithms for team formation problem
by: Kader, Md. Abdul, et al.
Published: (2021)