Advanced scheduling problem using constraint programming techniques in SCM environment

Authors:
Young-Su Yun;Mitsuo Gen
Affiliations:
Department of Industrial and Information Systems Engineering, Ashikaga Institute of Technology, Ashikaga 326-8558, Japan;Department of Industrial and Information Systems Engineering, Ashikaga Institute of Technology, Ashikaga 326-8558, Japan
Venue:
Computers and Industrial Engineering - Supply chain management
Year:
2002

Citing 4
Cited 4

Preemptive scheduling with changeovers: using column generation technique and genetic algorithm

Computers and Industrial Engineering
Genetic Algorithms

Genetic Algorithms
Hybrid methods using genetic algorithms for global optimization

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs

Operations Research Letters

Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling

Computers in Industry - Special issue: Application of genetics algorithms in industry
An Adaptive MO-HGA for Resource-Constrained Transport Task Scheduling

ISNN '09 Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks
Construction of Systematic Learning Support System of Business Theory and Method

Proceedings of the Symposium on Human Interface 2009 on Human Interface and the Management of Information. Information and Interaction. Part II: Held as part of HCI International 2009
Hybrid genetic algorithm with adaptive abilities for resource-constrained multiple project scheduling

Computers in Industry - Special issue: Application of genetics algorithms in industry

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider a preemptive and non-preemptive scheduling model as one of the advanced scheduling problems considered by a constraint programming technique and propose a new genetic algorithm (GA) considering simultaneously the preemptive and non-preemptive cases of the activities of jobs under single machine job-shop scheduling problems. In the proposed GA, we develop a new method for representing the chromosome of GA. For various comparisons, we also propose the hybrid GAs with the proposed GA and conventional sequencing rules. These hybrid GAs are applied to several job-shop scheduling problems under a single machine. Experiment results show that the proposed hybrid GA with a conventional sequencing rule outperforms the proposed GA and other conventional sequencing rules.