Solving Distributed and Flexible Job-Shop Scheduling Problems for a Real-World Fastener Manufacturer
Authors:
Open Access
- 1 January 2014
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 2, 1598-1606
Abstract
Over the last few decades, there has been considerable concern over the multifactory manufacturing environments owing to globalization. Numerous studies have indicated that flexible job-shop scheduling problems (FJSPs) and the distributed and FJSPs (DFJSPs) belong to NP-hard puzzle. The allocation of jobs to appropriate factories or flexible manufacturing units is an essential task in multifactory optimization scheduling, which involves the consideration of equipment performance, technology, capacity, and utilization level for each factory or manufacturing unit. Several variables and constraints should be considered in the encoding problem of DFJSPs when using genetic algorithms (GAs). In particular, it has been reported in the literature that the traditional GA encoding method may generate infeasible solutions or illegal solutions; thus, a specially designed evolution process is required. However, in such a process, the diversity of chromosomes is lost. To overcome this drawback, this paper proposes a refined encoding operator that integrates probability concepts into a real-parameter encoding method. In addition, the length of chromosomes can be substantially reduced using the proposed algorithm, thereby, saving computation space. The proposed refined GA algorithm was evaluated with satisfactory results through two-stage validation; in the first stage, a classical DFJSP was adopted to show the effectiveness of the algorithm, and in the second stage, the algorithm was used to solve a real-world case. The real-world case involved the use of historical data with 100 and 200 sets of work orders of a fastener manufacturer in Taiwan. The results were satisfactory and indicated that the proposed refined GA algorithm could effectively overcome the conflicts caused by GA encoding algorithms.Keywords
Funding Information
- National Science Council of Taiwan (NSC 102-221-E-151-021-MY3)
- Anchor Fasteners Company, Ltd., Kaohsiung, Taiwan
This publication has 12 references indexed in Scilit:
- An effective genetic algorithm for the flexible job-shop scheduling problemExpert Systems with Applications, 2011
- An Improved Genetic Algorithm for the Distributed and Flexible Job-shop Scheduling problemEuropean Journal of Operational Research, 2010
- Multi-Objective Flexible Job-Shop Scheduling Problem in Steel Tubes ProductionSystems Engineering - Theory & Practice, 2009
- An effective architecture for learning and evolving flexible job-shop schedulesEuropean Journal of Operational Research, 2007
- An adaptive genetic algorithm with dominated genes for distributed scheduling problemsExpert Systems with Applications, 2005
- A modified genetic algorithm for distributed scheduling problemsJournal of Intelligent Manufacturing, 2003
- A genetic algorithm for flexible job-shop scheduling2003
- Evolution programs for job-shop scheduling2002
- Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problemsIEEE Transactions on Systems, Man and Cybernetics, Part C (Applications and Reviews), 2002
- A tutorial survey of job-shop scheduling problems using genetic algorithms—I. representationComputers & Industrial Engineering, 1996