Optimization of Job Shop Scheduling Algorithm by using B-B Technique |
Author(s): |
| P Haritha , KMM INSTITUTION OF PG STUDIES; Dr K Venkataramana, KMM INSTITUTE OF PG STUDIES |
Keywords: |
| Job Shop Scheduling, Scheduling Model, Branch And Bound Algorithm |
Abstract |
|
As an extension of the classical job look scheduling problem, the flexible job shop scheduling problem plays an important role in real production systems. The problem complication has increased along with the increase in the complication of operations and product-mix. To unravel this problem, various outlooks are developed incorporating distinct event simulation methodology. The scope and the purpose of this gift a survey that covers most of the solving techniques of Job look scheduling problem. A classification of this performance has been proposed traditional Techniques and Advanced Techniques. The traditional techniques to solve JSS could not fully satisfy the world competition and fast changing in customer requirements. |
Other Details |
|
Paper ID: IJSRDV7I10920 Published in: Volume : 7, Issue : 1 Publication Date: 01/04/2019 Page(s): 1360-1363 |
Article Preview |
|
|
|
|
