A distance-based ranking model estimation of distribution algorithm for the flowshop scheduling problem

IEEE Transactions on Evolutionary Computation

Volumn 18, Issue 2, 2014, Pages 286-300

  Ceberio, Josu ^a   Irurozki, Ekhine ^a   Mendiburu, Alexander ^a   Lozano, Jose A ^a  

^a UNIVERSITY OF THE BASQUE COUNTRY UPV EHU   (Spain)

Author keywords

Estimation of distribution algorithms; Generalized Mallows model; Permutation flowshop scheduling problem; Permutations based optimization problems

Indexed keywords

BENCHMARKING; HEURISTIC ALGORITHMS; OPTIMIZATION; SCHEDULING;

ESTIMATION OF DISTRIBUTION ALGORITHMS; FLOW SHOP SCHEDULING PROBLEM; MALLOWS MODELS; OPTIMIZATION PROBLEMS; PERMUTATION FLOWSHOP SCHEDULING PROBLEMS; PROBABILISTIC MODELING; STATE-OF-THE-ART APPROACH; VARIABLE NEIGHBORHOOD SEARCH;

EVOLUTIONARY ALGORITHMS;

EID: 84897539411     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2013.2260548     Document Type: Article

References (72)

1. S. M. Johnson, "Optimal two- and three-stage production schedules with setup times included," Naval Res. Logis. Quart., vol. 1, no. 1, pp. 61-68, 1954.
2. M. R. Garey, D. S. Johnson, and R. Sethi, "The complexity of flow shop and jobshop scheduling," Math. Oper. Res., vol. 1, no. 2, pp. 117-129, May 1976.
3. S. R. Hejazi and S. Saghafianz, "Flowshop-scheduling problems with makespan criterion: A review," Int. J. Prod. Res., vol. 43, no. 14, pp. 2895-2929, Feb. 2005.
4. J. Gupta and J. E. Stafford, "Flow shop scheduling research after five decades," Eur. J. Oper. Res., vol. 169, no. 3, pp. 699-711, 2006. (Pubitemid 41492009)
5. J. M. Framinan and R. Leisten, "An efficient constructive heuristic for flowtime minimisation in permutation flow shops," Omega, vol. 31, no. 4, pp. 311-317, 2003. (Pubitemid 36742549)
6. C. Wang, C. Chu, and J.-M. Proth, "A branch-and-bound algorithm for njob two machine flow shop scheduling problems," in Proc. INRIA/IEEE Symp. Emerging Technol. Factory Autom., vol. 2. Oct 1995, pp. 375-383.
7. C.-S. Chung, J. Flynn, and O. Kirca, "A branch and bound algorithm to minimize the total flow time for m-machine permutation flowshop problems," Int. J. Prod. Econom., vol. 79, no. 3, pp. 185-196, Oct. 2002. (Pubitemid 35039850)
8. H.-S. Woo and D.-S. Yim, "A heuristic algorithm for mean flowtime objective in flowshop scheduling," Comput. Oper. Res., vol. 25, no. 3, pp. 175-182, 1998.
9. M. Nawaz, E. E. Enscore, Jr., and I. Ham, "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, vol. 11, no. 1, pp. 91-95, 1983. (Pubitemid 13193807)
10. J. Liu and C. R. Reeves, "Constructive and composite heuristic solutions to the p//[summation operator]ci scheduling problem," Eur. J. Oper. Res., vol. 132, no. 2, pp. 439-452, 2001. (Pubitemid 32385032)
11. C. Rajendran, "Heuristic algorithm for scheduling in a flowshop to minimize total flowtime," Int. J. Prod. Econom., vol. 29, no. 1, pp. 65-73, Feb. 1993. (Pubitemid 23623618)
12. C. Rajendran and H. Ziegler, "An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs," Eur. J. Oper. Res., vol. 103, no. 1, pp. 129-138, Nov. 1997. (Pubitemid 127396735)
13. X. Li, Q. Wang, and C. Wu, "Efficient composite heuristics for total flowtime minimization in permutation flow shops," Omega, vol. 37, no. 1, pp. 155-164, 2009.
14. Y. Zhang, X. Li, J. Zhu, and Q. Wang, "Composite heuristic algorithm for permutation flowshop scheduling problems with total flowtime minimization," in Proc. 12th Int. Conf. Comput. Supported Cooperative Work Des., Apr. 2008, pp. 903-907.
15. A. Allahverdi and T. Aldowaisan, "New heuristics to minimize total completion time in m-machine flowshops," Int. J. Prod. Econom., vol. 77, no. 1, pp. 71-83, 2002. (Pubitemid 34284488)
16. J. M. Framinan, R. Leisten, and R. Ruiz-Usano, "Comparison of heuristics for flowtime minimisation in permutation flowshops," Comput. Oper. Res., vol. 32, pp. 1237-1254, May 2005.
17. X. Dong, H. Huang, and P. Chen, "An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion," Comput. Oper. Res., vol. 36, no. 5, pp. 1664-1669, 2009.
18. J. K. Pawel Jan Kalczynski, "On the NEH heuristic for minimizing the makespan in permutation flow shops," Omega, vol. 35, no. 1, pp. 53-60, 2007.
19. W. E. Costa, M. C. Goldbarg, and E. G. Goldbarg, "New VNS heuristic for total flowtime flowshop scheduling problem," Expert Syst. Applicat., vol. 39, no. 9, pp. 8149-8161, 2012.
20. I. Osman and C. Potts, "Simulated annealing for permutation flow-shop scheduling," Omega, vol. 17, no. 6, pp. 551-557, 1989.
21. E. Taillard, "Some efficient heuristic methods for the flow shop sequencing problem," Eur. J. Oper. Res., vol. 47, no. 1, pp. 65-74, Jul. 1990. (Pubitemid 20733430)
22. E. Nowicki and C. Smutnicki, "A fast tabu search algorithm for the permutation flow-shop problem," Eur. J. Oper. Res., vol. 91, no. 1, pp. 160-175, May 1996. (Pubitemid 126369642)
23. C. R. Reeves, "Improving the efficiency of tabu search for machine sequencing problems," J. Oper. Res. Soc., vol. 44, no. 4, pp. 375-382, Apr. 1993.
24. V. S. Vempati, C.-L. Chen, and S. F. Bullington, "An effective heuristic for flow shop problems with total flow time as criterion," Comput. Ind. Eng., vol. 25, no. 1-4, pp. 219-222, 1993.
25. M. S. Nagano, R. Ruiz, and L. A. N. Lorena, "A constructive genetic algorithm for permutation flowshop scheduling," Comput. Ind. Eng., vol. 55, pp. 195-207, Aug. 2008.
26. X. Xu, Z. Xu, and X. Gu, "An asynchronous genetic local search algorithm for the permutation flowshop scheduling problem with total flowtime minimization," Expert Syst. Applict., vol. 38, no. 7, pp. 7970-7979, 2011.
27. L.-Y. Tseng and Y.-T. Lin, "A hybrid genetic local search algorithm for the permutation flowshop scheduling problem," Eur. J. Oper. Res., vol. 198, no. 1, pp. 84-92, Oct. 2009.
28. Y. Zhang, X. Li, and Q. Wang, "Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization," Eur. J. Oper. Res., vol. 196, no. 3, pp. 869-876, Aug. 2009.
29. M. F. Tasgetiren, Y.-C. Liang, M. Sevkli, and G. Gencyilmaz, "A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem," Eur. J. Oper. Res., vol. 177, no. 3, pp. 1930-1947, 2007. (Pubitemid 44780934)
30. C.-J. Liao, C.-T. Tseng, and P. Luarn, "A discrete version of particle swarm optimization for flowshop scheduling problems," Comput. Oper. Res., vol. 34, pp. 3099-3111, Oct. 2007. (Pubitemid 46356739)
31. B. Jarboui, S. Ibrahim, P. Siarry, and A. Rebai, "A combinatorial particle swarm optimization for solving permutation flowshop problems," Comput. Ind. Eng., vol. 54, no. 3, pp. 526-538, 2008. (Pubitemid 351199803)
32. H. Liu, L. Gao, and Q. Pan, "A hybrid particle swarm optimization with estimation of distribution algorithm for solving permutation flowshop scheduling problem," Expert Syst. Appl., vol. 38, pp. 4348-4360, Apr. 2011.
33. T. Sẗutzle, "An ant approach to the flow shop problem," in Proc. 6th Eur. Congr. Intell. Tech. Soft Comput, 1997, pp. 1560-1564.
34. C. Rajendran and H. Ziegler, "Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs," Eur. J. Oper. Res., vol. 155, no. 2, pp. 426-438, 2004.
35. Y. Gajpal and C. Rajendran, "An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops," Int. J. Prod. Econom., vol. 101, no. 2, pp. 259-272, Jun. 2006. (Pubitemid 43177614)
36. Y. Zhang, X. Li, Q. Wang, and J. Zhu, "Similarity based ant-colony algorithm for permutation flowshop scheduling problems with total flowtime minimization," in Proc. Int. Conf. Comput. Supported Cooperat. Work Des., 2009, pp. 582-589.
37. B. Jarboui, M. Eddaly, and P. Siarry, "An estimation of distribution algorithm for minimizing the total flowtime in permutation flowshop scheduling problems," Comput. OR, vol. 36, no. 9, pp. 2638-2646, 2009.
38. P. Larrañaga and J. A. Lozano, Estimation of Distribution algorithms: A New Tool for Evolutionary Computation. Berlin, Germany: Kluwer Academic Publishers, 2002.
39. J. A. Lozano, P. Larrañaga, I. Inza, and E. Bengoetxea, "Toward a new evolutionary computation: Advances on estimation of distribution Algorithms," in Studies in Fuzziness and Soft Computing. Secaucus, NJ, USA: Springer, 2006.
40. M. Pelikan, K. Sastry, and E. Cant́u-Paz, "Scalable optimization via probabilistic modeling: From algorithms to applications," in Studies in Computational Intelligence. Secaucus, NJ, USA: Springer Inc., 2006.
41. R. Santana, P. Larrañaga, and J. A. Lozano, "Protein folding in simplified models with estimation of distribution algorithms," IEEE Trans. Evol. Comput., vol. 12, no. 4, pp. 418-438, Aug. 2008.
42. Q. Zhang, J. Sun, and E. Tsang, "An evolutionary algorithm with guided mutation for the maximum clique problem," IEEE Trans. Evol. Comput., vol. 9, no. 2, pp. 192-200, Apr. 2005. (Pubitemid 40564736)
43. Q. Zhang, J. Sun, E. Tsang, and J. Ford, "Estimation of distribution algorithm with 2-opt local search for the quadratic assignment problem," Stud. Fuzziness Soft Comput., vol. 192/2006, pp. 281-292, 2006. (Pubitemid 44856945)
44. L. Wang and C. Fang, "An effective estimation of distribution algorithm for the multimode resource-constrained project scheduling problem," Comput. Oper. Res., vol. 39, no. 2, pp. 449-460, Feb. 2012.
45. Q.-K. Pan and R. Ruiz, "An estimation of distribution algorithm for lotstreaming flow shop problems with setup times," Omega, vol. 40, no. 2, pp. 166-180, 2012.
46. S.-H. Chen and M.-C. Chen, "Addressing the advantages of using ensemble probabilistic models in estimation of distribution algorithms for scheduling problems," Int. J. Prod. Econom., vol. 141, no. 1, pp. 24-33, 2012.
47. J. Ceberio, E. Irurozki, A. Mendiburu, and J. A. Lozano, "A review on estimation of distribution algorithms in permutation-based combinatorial optimization problems," Progr. Artif. Intell., vol. 1, no. 1, pp. 103-117, Jan. 2012.
48. S. Tsutsui, "Probabilistic model-building genetic algorithms in permutation representation domain using edge histogram," in Proc. Parallel Prob. Solv. Nat., 2002, pp. 224-233.
49. S. Tsutsui, M. Pelikan, and D. E. Goldberg, "Node histogram versus edge histogram: A comparison of PMBGAs in permutation domains," Medal, Tech. Rep., 2006.
50. J. Ceberio, A. Mendiburu, and J. A. Lozano, "Introducing the Mallows model on estimation of distribution algorithms," in Proc. Int. Conf. Neural Inform. Process., vol. 7063, Nov. 2011, pp. 461-470.
51. M. A. Fligner and J. S. Verducci, "Distance based ranking models," J. Royal Stat. Soc., vol. 48, no. 3, pp. 359-369, 1986.
52. K. Baker, Introduction to Sequencing and Scheduling. New York, NY, USA: Wiley, 1974.
53. A. Allahverdi, C. Ng, T. Cheng, and M. Y. Kovalyov, "A survey of scheduling problems with setup times or costs," Eur. J. Oper. Res., vol. 187, no. 3, pp. 985-1032, 2008. (Pubitemid 350236619)
54. L. L. Thurstone, "A law of comparative judgment." Psych. Rev., vol. 34, no. 4, pp. 273-286, 1927.
55. C. L. Mallows, "Nonnull ranking models." Biometrika, vol. 44, no. 1-2, pp. 114-130, 1957.
56. T. Lu and C. Boutilier, "Learning mallows models with pairwise preferences," in Proc. 28th Int. Conf. Mach. Learn., ser. ICML '11, L. Getoor and T. Scheffer, Eds. New York, NY, USA: ACM, Jun. 2011, pp. 145-152.
57. W. Cheng and E. Ḧullermeier, "A simple instance-based approach to multilabel classification using the mallows model," in Proc. Workshop Learn. MultiLabel Data, Sep. 2009, pp. 28-38.
58. G. Lebanon and J. Lafferty, "Cranking: Combining rankings using conditional probability models on permutations," in Proc. Int. Conf. Mach. Learn., 2002, pp. 363-370.
59. Y. Mao and G. Lebanon, "Nonparametric modeling of partially ranked data," J. Mach. Learn. Res., vol. 9, pp. 2401-2429, 2008.
60. M. Meila and H. Chen, "Dirichlet process mixtures of generalized Mallows models," Uncertainty Artif. Intell., vol. 1, no. l, pp. 358-367, 2010.
61. K. K. Lau, P. C. Yuen, and Y. Y. Tang, "Directed connection measurement for evaluating reconstructed stroke sequence in handwriting images," Pattern Recogn., vol. 38, no. 3, pp. 323-339, 2005.
62. M. Fligner and J. Verducci, "Multistage ranking models," J. Amer. Stat. Assoc., vol. 83, no. 403, pp. 892-901, 1988.
63. M. Meila, K. Phadnis, A. Patterson, and J. Bilmes, "Consensus ranking under the exponential model," in Proc. 22nd Conf. Uncertainty Artif. Intell., Vancouver, BC, USA, Jul. 2007, pp. 285-294.
64. B. Mandhani and M. Meila, "Tractable search for learning exponential models of rankings," J. Mach. Learn. Res., vol. 5, pp. 392-399, 2009.
65. J. Bartholdi, C. A. Tovey, and M. A. Trick, "Voting schemes for which it can be difficult to tell who won the election," Soc. Choice Welfare, vol. 6, no. 2, pp. 157-165, Apr. 1989.
66. J. C. Borda, "Memoire sur les elections au scrutin," Histoire de l'Academie Royale des Science, 1784.
67. A. Ali and M. Meila, "Experiments with Kemeny ranking: What works when?" Math. Soc. Sci., vol. 64, no. 1, pp. 28-40, Jul. 2011.
68. J. M. Borwein and P. B. Borwein, Pi and the AGM: A Study in the Analytic Number Theory and Computational Complexity. New York, NY, USA: Wiley, 1987.
69. E. Taillard, "Benchmarks for basic scheduling problems," Eur. J. Oper. Res., vol. 64, no. 2, pp. 278-285, Jan. 1993. (Pubitemid 23599340)
70. S. Garcia and F. Herrera, "An extension on statistical comparisons of classifiers over multiple data set for all pairwise comparisons," J. Mach. Learn. Res., vol. 9, pp. 2677-2694, Dec. 2008.
71. T. B. Murphy and D. Martin, "Mixtures of distance-based models for ranking data," Comput. Stat. Data Anal., vol. 41, no. 3-4, pp. 645-655, Jan. 2003. (Pubitemid 36065401)
72. M. Deza and T. Huang, "Metrics on permutations: A survey," J. Combinatorics, Inf. Syst. Sci., vol. 23, pp. 173-185, 1998.