A genetic algorithm for flowshop sequencing
Computers and Operations Research - Special issue on genetic algorithms
Genetic algorithms for flowshop scheduling problems
Computers and Industrial Engineering
An integrated agent-based approach for responsive control of manufacturing resources
Computers and Industrial Engineering - Special issue: Selected papers from the 27th international conference on computers & industrial engineering
Modeling realistic hybrid flexible flowshop scheduling problems
Computers and Operations Research
Computers and Industrial Engineering
Expert Systems with Applications: An International Journal
Algorithms for a realistic variant of flowshop scheduling
Computers and Operations Research
Computers and Operations Research
Agent-based distributed manufacturing process planning and scheduling: a state-of-the-art survey
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
A multiagent genetic algorithm for global numerical optimization
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Operations Research Letters
Heuristic algorithms for the two-stage hybrid flowshop problem
Operations Research Letters
Hi-index | 12.05 |
This paper deals with a variant of flowshop scheduling, namely, the hybrid or flexible flowshop with sequence dependent setup times. This type of flowshop is frequently used in the batch production industry and helps reduce the gap between research and operational use. This scheduling problem is NP-hard and solutions for large problems are based on non-exact methods. An improved genetic algorithm (GA) based on software agent design to minimise the makespan is presented. The paper proposes using an inherent characteristic of software agents to create a new perspective in GA design. To verify the developed metaheuristic, computational experiments are conducted on a well-known benchmark problem dataset. The experimental results show that the proposed metaheuristic outperforms some of the well-known methods and the state-of-art algorithms on the same benchmark problem dataset.