You have no items in your shopping cart.
ABSTRACT
A Meta heuristic approach for solving flexible job shop scheduling problem is presented in this study. Flexible Job Shop Scheduling Problem (FJSP) is an extension of the classical Job Shop Scheduling Problem (JSP) which provides a closer approximation to a wide range of real manufacturing systems. In particular, there are a set of work centers in a flexible job shop. Each work center has a set of parallel machines with possibly different efficiency. An operation can be performed by any machine in the work center. Hence the research is set out to minimize the total completion time+ and the tardiness.
A computer program was written using PHP to solve the Genetic Algorithm (GA) of the FJSP. The methodology used for this research is the First in First Out (FIFO) rule combined with shortest processing time and longest processing time to minimize the total completion time and tardiness.
The result obtained shows how buoyant the GA is in solving both partial and total flexibility systems. In CASE 1, the FIFO and SPT rule gave a total completion time value of 76 and a tardiness value of 10. The FIFO and LPT rule got a total completion time value of 254 and a tardiness value of 35. The result of the GA show that our algorithm is effective and comparable to the other algorithms.
