Information Technology Reference
In-Depth Information
References
1. Pinedo, M.: Scheduling: theory algorithms and systems. Prentice-Hall, Englewood
Cliffs (2002)
2. Gupta, J.N.D.: Two-stage hybrid flowshop scheduling problem. J. Oper. Res.
Soc. 39, 359-364 (1988)
3. Santos, D.L., Hunsucker, J.L., Deal, D.E.: Global lower bounds for flow shops with
multiple processors. Eur. J. Oper. Res. 80(1), 112-120 (1995)
4. Neron, E., Baptiste, P., Gupta, J.N.D.: Solving hybrid flow shop problem using
energetic reasoning and global operations. Omega 29(6), 501-511 (2001)
5. Carlier, J., Neron, E.: An exact method for solving the multi-processor flow-shop.
RAIRO-Oper. Res. 34(1), 1-25 (2000)
6. Ruiz, R., Serifoglu, F.S., Urlings, T.: Modeling realistic hybrid flexible flowshop
scheduling problems. Comput. Oper. Res. 35(4), 1151-1175 (2008)
7. Nawaz, M., Enscore, E., Ham, I.: A heuristic algorithm for the m-machine, n-job
flow shop sequencing problem. Omega 11, 91-95 (1983)
8. Kahraman, C., Engin, O., Kaya, I., Yilmaz, M.K.: An application of effective ge-
netic algorithms for solving hybrid flow shop scheduling problems. Int. J. Comput.
Intell. Sys. 1(2), 134-147 (2008)
9. Engin, O., Doyen, A.: A new approach to solve hybrid flow shop scheduling prob-
lems by artificial immune system. Future Gener. Comp. Sys. 20, 1083-1095 (2004)
10. Alaykyran, K., Engin, O., Doyen, A.: Using ant colony optimization to solve hybrid
flow shop scheduling problems. Int. J. Adv. Manuf. Tech. 35, 541-550 (2007)
11. Niu, Q., Zhou, T., Ma, S.: A quantum-inspired immune algorithm for hybrid flow
shop with makespan criterion. J. Univers. Comput. Sci. 15, 765-785 (2009)
12. Liao, C.J., Tjandradjaja, E., Chung, T.P.: An approach using particle swarm op-
timization and bottleneck heuristic to solve hybrid flow shop scheduling problem.
Appl. Soft. Comput. 12(6), 1755-1764 (2012)
13. Karaboga, D.: An idea based on honey bee swarm for numerical optimization.
Technical report, Computer Engineering Department, Engineering Faculty, Erciyes
University (2005)
14. Karaboga, D., Basturk, B.: A powerful and ecient algorithm for numerical func-
tion optimization: artificial bee colony algorithm. J. Global. Optim. 39(3), 459-471
(2007)
15. Karaboga, D., Basturk, B.: On the performance of artificial bee colony (ABC)
algorithm. Appl. Soft. Comput. 8(1), 687-697 (2008)
16. Wardono, B., Fathi, Y.: A tabu search algorithm for the multi-stage parallel ma-
chine problem with limited buffer capacities. Eur. J. Oper. Res. 155, 380-401 (2004)
17. Oguz, C., Zinder, Y., Do, V.H., Janiak, A., Lichtenstein, M.: Hybrid flow-shop
scheduling problems with multiprocessor task systems. Eur. J. Oper. Res. 152,
115-131 (2004)
18. Oguz, C., Ercan, M.F.: A genetic algorithm for hybrid flow shop scheduling with
multiprocessor tasks. J. Scheduling 8, 323-351 (2005)
19. Goldberg, D.E., Lingle, R.J.: Alleles, loci and the traveling salesman problem. In:
1st International Conference on Genetic Algorithms and their Application, pp.
154-159. Lawrence Erlbaum (1985)
20. Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24,
1097-1100 (1997)
21. Ruiz, R., Stutzle, T.: A simple and effective iterated greedy algorithm for the
permutation flowshop scheduling problem. Eur. J. Oper. Res. 177(3), 2033-2049
(2007)
Search WWH ::
Custom Search