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 |
Jezik: | English |
Izdano: |
2015
|
Teme: | |
Online dostop: | http://umpir.ump.edu.my/id/eprint/8821/1/Development%20of%20Simulated%20Annealing%20Based%20Scheduling%20Algorithm%20for%20Two%20Machines%20Flow%20Shop%20Problem.pdf |
Podobne knjige/članki
-
Simulated Annealing Based Strategy for Test Redundancy Reduction
od: Kamal Z., Zamli, et al.
Izdano: (2014) -
Comparative study of five metaheuristic algorithms for team formation problem
od: Kader, Md. Abdul, et al.
Izdano: (2021) -
Solving multi-task optimization problems using the sine cosine algorithm
od: Kamal Z., Zamli, et al.
Izdano: (2022) -
Chaotic map initializations with Tiki-Taka algorithm for software remodularization problem
od: Kamal Z., Zamli, et al.
Izdano: (2021) -
An improved genetic bat algorithm for unconstrained global optimization problems
od: Muhammad Zubair, Rehman, et al.
Izdano: (2020)