location: Current position: Shi Yanjun >> Scientific Research >> Paper Publications

Solving Multi-objective Flexible Job Shop Scheduling with Transportation Constraints using a Micro Artificial Bee Colony Algorithm

Hits:

Indexed by:会议论文

Date of Publication:2013-06-27

Included Journals:EI、CPCI-S、Scopus

Page Number:427-432

Key Words:flexible job shop scheduling problem; automatic guided vehicle; artificial bee colony; micro genetic algorithm

Abstract:We deal with multi-objective Flexible Job Shop Scheduling Problem (FJSSP) with transportation resources constraints herein, where the cost time of loaded and empty Automatic Guided Vehicle (AGV) cannot be neglected. This problem is a NP-hard problem, whose optimization objectives are to minimize the makespan and total workload of machines. We proposed a multi-objective micro artificial bee colony algorithm (MMABC) to tackle this problem. In MMABC, each solution corresponds to a food source, which is encoded to reflect the assignment of AGV tasks, machine operations, and operation sequence; the smaller bee population is divided in two parts: a replaceable bee part and non-replaceable bee part. We also employed the crossover operator to the employed bee for exchanging the good scheduling. Experimental results on larger examples and comparisons with multi-objective micro genetic algorithm showed the effectiveness of the proposed algorithm.

Pre One:Study on methods of numerical simulation of transient flow in the semi-open impeller stage of a centrifugal compressor

Next One:A dual-system method with differential evolution and genetic algorithm for loop-based station sequencing problem