Case Study: Flexible Job Shop Scheduling

1070 Words5 Pages

1.1 General Scheduling is the method by which the work is assigned to resources that complete the work. Scheduling aims to maximize the efficiency of the operation and reduce the cost and time. Classical job shop scheduling deals with set of n jobs to be processed by a set of m machines. The flexible job shop scheduling is an extension of job shop scheduling. In the flexible job shop scheduling operations are allowed to be processed on any available machines at a facility. It is difficult to find an optimal solutions in reasonable time. Different Heuristic and metaheuristic approaches are used to solve the problems and to generate optimal solutions. Quantum computers provide powerful ability to solve optimization problems. Quantum computing utilizes the quantum mechanics to improve the efficiency of computation. Quantum algorithm consist of series of quantum operations on a quantum system. In this work quantum inspired algorithm is used to solve the FJSP due its effective exploration and exploitation. In Quantum inspired algorithm the quantum operations are performed on the classical computers. 1.2 Flexible job shop scheduling …show more content…

Flexible job shop scheduling is the extension of the classical FJSP. In today’s market there is a need to schedule the jobs flexibly. The flexible job shop scheduling is based on the scheduling the pre specified sequenced operations of jobs to the available set of machines. All machines cannot able to process all operations. Here the jobs are allocated only to the possible machines. There are two problems in flexible job shop scheduling problem. First the sequence of the operation to be scheduled is obtained. Then the sequenced operations are allocated to the available machines at that time. If more number of machines are available to process the operations then selcect the machine with minimum processing

More about Case Study: Flexible Job Shop Scheduling

Open Document