Abstract The flexible job-shop scheduling problem (FJSP) is a critical model in manufacturing systems that assigns operations from different jobs to various machines. However, optimizing multiple targets during the production process always necessary. While non-dominated sorting genetic algorithm (NSGA-II) an effective method solve multi-objective FJSP, it can have main drawbacks of converging ...

Flexible job-shop scheduling problem (FJSSP) is an extension of the classical job-shop scheduling problem that allows an operation to be processed by any machine from a given set along different routes. It is very important in both fields of production management and combinatorial optimisation. This paper presents a new approach based on attribute oriented mining technique to solve the multi-ob...

The flexible job shop scheduling problem (FJSP) is of great importance for realistic manufacturing, and the has been proven to be NP-hard (non-deterministic polynomial time) because its high computational complexity. To optimize makespan critical machine load FJSP, a discrete improved grey wolf optimization (DIGWO) algorithm proposed. Firstly, combined with random Tent chaotic mapping strategy ...

In this paper, scheduling problems in Flexible Manufacturing Cells (FMC) are studied. The scheduling objective is to minimize the makespan. We used a genetic algorithm (GA) for solving the optimization scheduling problem. We have developed one FMC with industrial characteristics with the objective of studying scheduling problems in these types of manufacturing systems (single machine scheduling...

Integrating flexible job-shop scheduling problem (FJSP) with preventive maintenance (PM) is pondered in this paper. Minimizing the makespan for scheduling part and minimizing the system unavailability for maintenance part are simultaneously under consideration. For doing it, the assignment of n jobs on m machines in production side and executing the PM actions at appropriate time intervals in m...

Flexible job shop schedule is very important in both fields of combinatorial optimization and production management. In this paper, a simulationmodel is presented to solve themulti-objective flexible job shop scheduling problem. The proposed model has been coded by Matlab which is a special mathematical computation language. After modeling the pending problem, the model is validated by five rep...

The nature of construction and formulation the multi-objective functions in flexible job shop (FJS) provides great insights about study technique mechanism scheduling helping to prioritize efforts for optimizing manufacturing execution performance, which draw focus researchers at home abroad. From perspective model, solution method objective function, this paper reviews analyzes related academi...

The Distributed and Flexible Job-shop Scheduling problem (DFJS) considers the scheduling of distributed manufacturing environments, where jobs are processed by a system of several Flexible Manufacturing Units (FMUs). Distributed scheduling problems deal with the assignment of jobs to FMUs and with determining the scheduling of each FMU, in terms of assignment of each job operation to one of the...

An NP-hard problem like Flexible Job Shop Scheduling (FJSP) tends to be more complex and requires computational effort optimize the objectives with contradictory measures. This paper aims address FJSP combined objectives, minimization of make-span, maximum workload, total workload. proposes ‘Hybrid Adaptive Firefly Algorithm’ (HAdFA), a new enhanced version classic Algorithm (FA) embedded adapt...