Abstract
Flexible manufacturing systems are not easy to control and it is difficult to generate controlling systems for this problem domain. Flexible job-shop scheduling problem (FJSP) is one of the instances in this domain. It is a problem which acquires the job-shop scheduling problems (JSP). FJSP has additional routing subproblem in addition to JSP. In routing sub-problem each task is assigned to a machine out of a set of capable machines. In scheduling sub-problem, the sequence of assigned operations is obtained while optimizing the objective function(s). In this work an object-oriented (OO) approach with simulated annealing algorithm is used to simulate multi-objective FJSP. Solution approaches provided in the literature generally use two-string encoding scheme to represent this problem. However, OO analysis, design and programming methodology helps to present this problem on a single encoding scheme effectively which result in a practical integration of the problem solution to manufacturing control systems where OO paradigm is frequently used. Three parameters are considered in this paper: maximum completion time, workload of the most loaded machine and total workload of all machines which are the benchmark used to show the propose system achieve effective result.
Highlights
Flexible job shop scheduling is a scheduling mechanism that inherits the problem of job shop scheduling problem[1]
This work proposes an OO representation for Flexible job-shop scheduling problem (FJSP) using class diagram that reduces the problem encoding to a single data structure where hierarchical data structure is used to show operational objects of FJSP
Main advantage of the proposed approach is its capability of reducing the number of data structures used during problem solving process and increasing adaptability of algorithms to real manufacturing control systems
Summary
Flexible job shop scheduling is a scheduling mechanism that inherits the problem of job shop scheduling problem[1]. Flexible job shop scheduling has two more additional problems to that of its predecessor job shop scheduling. Job shop scheduling is complexto control because it has many routes and job can be assign to the entire available route at a time. Flexible job shop scheduling has two sub-routing problem: assigning of operation to various available machine and sequence of operation of the machine in order to obtain an optimal solution. Obtaining optimal solution is difficult to achieve with the traditional approach to optimizing scheduling problem due to its high complexity [16]. Scheduling problem has drawn the attention of many researchers to contribute in diverse ways of addressing the problem [9]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
