A Hybrid Artificial Bee Colony Algorithm with Local Search for Flexible Job-shop Scheduling Problem

@inproceedings{Thammano2013AHA,
  title={A Hybrid Artificial Bee Colony Algorithm with Local Search for Flexible Job-shop Scheduling Problem},
  author={Arit Thammano and Ajchara Phu-ang},
  booktitle={Complex Adaptive Systems},
  year={2013}
}
Abstract This paper presents a hybrid artificial bee colony algorithm for solving the flexible job-shop scheduling problem (FJSP) with the criteria to minimize the maximum completion time (makespan). In solving the FJSP, we have to focus on two sub-problems: determining the sequence of the operations and selecting the best machine for each operation. In the proposed algorithm, first, several dispatching rules and the harmony search algorithm are used in creating the initial solutions… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 12 CITATIONS

Meta-Heuristics for Bi-Objective Urban Traffic Light Scheduling Problems

  • IEEE Transactions on Intelligent Transportation Systems
  • 2019
VIEW 1 EXCERPT
CITES BACKGROUND

A meta-heuristic with ensemble of local search operators for urban traffic light optimization

  • 2017 IEEE Symposium Series on Computational Intelligence (SSCI)
  • 2017
VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-9 OF 9 REFERENCES

A hybrid harmony search algorithm for the flexible job shop scheduling problem

Yuan Yuan, Hua Xu, Jiadong Yang
  • Appl. Soft Comput.
  • 2013
VIEW 2 EXCERPTS

Pareto-based discrete harmony search algorithm for flexible job shop scheduling

  • 2012 12th International Conference on Intelligent Systems Design and Applications (ISDA)
  • 2012
VIEW 2 EXCERPTS

A modified simulated annealing method for flexible job shop scheduling problem

  • IEEE International Conference on Systems, Man and Cybernetics
  • 2002
VIEW 3 EXCERPTS