GA-based discrete dynamic programming approach for scheduling inFMS environments

Authors:
Jian-Bo Yang
Affiliations:
Sch. of Manage., Univ. of Manchester Inst. of Sci. & Technol.
Venue:
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Year:
2001

Citing 0
Cited 14

Dynamic Real-Time Scheduling for Multi-Processor Tasks Using Genetic Algorithm

COMPSAC '04 Proceedings of the 28th Annual International Computer Software and Applications Conference - Volume 01
A hybrid of genetic algorithm and bottleneck shifting for flexible job shop scheduling problemA hybrid of genetic algorithm and bottleneck shifting for flexible job shop scheduling problem

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Machine number, priority rule, and due date determination in flexible manufacturing systems using artificial neural networks

Computers and Industrial Engineering
A hybrid of genetic algorithm and bottleneck shifting for multiobjective flexible job shop scheduling problems

Computers and Industrial Engineering
Enhancing optimal feeder assignment of the multi-head surface mounting machine using genetic algorithms

Applied Soft Computing
A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems

Computers and Operations Research
Dynamic hard-real-time scheduling using genetic algorithm for multiprocessor task with resource and timing constraints

Expert Systems with Applications: An International Journal
Evolutionary techniques for optimization problems in integrated manufacturing system: State-of-the-art-survey

Computers and Industrial Engineering
Hybrid genetic algorithm with adaptive local search scheme for solving multistage-based supply chain problems

Computers and Industrial Engineering
Machine number, priority rule, and due date determination in flexible manufacturing systems using artificial neural networks

Computers and Industrial Engineering
Discrepancy search for the flexible job shop scheduling problem

Computers and Operations Research
An effective genetic algorithm for the flexible job-shop scheduling problem

Expert Systems with Applications: An International Journal
Population-based dynamic scheduling optimisation for complex production process

International Journal of Computer Applications in Technology
A new critical path method and a memetic algorithm for flexible job shop scheduling with overlapping operations

Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper presents a new genetic algorithm (GA)-based discrete dynamic programming (DDP) approach for generating static schedules in a flexible manufacturing system (FMS) environment. This GA-DDP approach adopts a sequence-dependent schedule generation strategy, where a GA is employed to generate feasible job sequences and a series of discrete dynamic programs are constructed to generate legal schedules for a given sequence of jobs. In formulating the GA, different performance criteria could be easily included. The developed DDF algorithm is capable of identifying locally optimized partial schedules and shares the computation efficiency of dynamic programming. The algorithm is designed In such a way that it does not suffer from the state explosion problem inherent in pure dynamic programming approaches in FMS scheduling. Numerical examples are reported to illustrate the approach