Evolutionary computation for minimizing makespan on identical machines with mold constraints

Authors:
Tzung-Pei Hong;Pei-Chen Sun;Sheng-Shin Jou
Affiliations:
Department of Computer Science and Information Engineering, National University of Kaohsiung, Taiwan, R.O.C. and Department of Computer Science and Engineering, National Sun Yat-sen University, Ta ...;Graduate Institute of Information and Computer Education, National Kaohsiung Normal University, Taiwan, R.O.C.;Graduate Institute of Information and Computer Education, National Kaohsiung Normal University, Taiwan, R.O.C.
Venue:
WSEAS Transactions on Systems and Control
Year:
2009

Citing 7
Cited 2

Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms

ICC&IE '94 Proceedings of the 17th international conference on Computers and industrial engineering
Parallel machine scheduling with earliness and tardiness penalties

Computers and Operations Research
Scheduling Algorithms

Scheduling Algorithms
A Parallel Genetic Algorithm for Task Mapping on Parallel Machines

Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria

Computers and Operations Research
A heuristic algorithm for the scheduling problem of parallel machines with mold constraints

ACACOS'08 Proceedings of the 7th WSEAS International Conference on Applied Computer and Applied Computational Science
Genetic algorithm-based heuristics for an open shop scheduling problem with setup, processing, and removal times separated

Robotics and Computer-Integrated Manufacturing

Temperature profile in fermenting process using differential evolution

EE'10 Proceedings of the 5th IASME/WSEAS international conference on Energy & environment
Differential evolution application in temperature profile of fermenting process

WSEAS TRANSACTIONS on SYSTEMS

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper focuses on minimizing makespan of identical-machines scheduling problems with mold constraints. In this kind of problems, jobs are non-preemptive with mold constraints and several identical machines are available. Feasible solutions are randomly generated and evolved by the proposed approach and an adjustment operator is designed to fill up the empty time slot due to the mold constraint. The proposed approach can also be easily extended to solve the same problem but with the fitness function of the total complete time. Experiments with and without the adjustment operator are made to analyze the performance of the proposed approach. Experimental results show that the adjustment operator does increase the performance of the scheduling.