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: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| 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 |