This paper introduces a new heuristic based on Kohonen’s self-organizing feature map for the traveling salesman problem with backhauls (TSPB). The TSPB is an extension of the traveling salesman problem in which a set of customers is partitioned into a set of linehaul customers to be visited contiguously at the beginning of the route and a set of backhaul customers to be visited once all linehau...

A feature-based model is proposed for assembly sequence planning automation. The fundamental assembly modeling strategy for a product is based on the mating features of its components. The objectives of this study are to integrate assembly planning of a product with its CAD model, generate a correct and practical assembly sequence and establish a software system to carry out the planning proces...

The effective development of data mining techniques for the discovery of knowledge from training samples for classification problems in industrial engineering is necessary in applications, such as group technology. This paper proposes a learning algorithm, which can be viewed as a knowledge acquisition tool, to effectively discover fuzzy association rules for classification problems. The conseq...

Huan Li 1, Yehua Dennis Wei 2,3,* and Yuemin Ning 4 1 Collaborative Innovation Center for China Economy, School of Economics, Nankai University, Tianjin 300071, China; [email protected] 2 Key Research Institute of Yellow River Civilization and Sustainable Development & Collaborative Innovation Center on Yellow River Civilization of Henan Province, Henan University, Kaifeng 475001, China 3 Dep...

http://dx.doi.org/10.1016/j.cie.2014.05.012 0360-8352/ 2014 Elsevier Ltd. All rights reserved. q This manuscript was processed by Area Editor Hans Kellerer. ⇑ Corresponding author. Address: Department of Industrial Management, National Taiwan University of Science and Technology, 43 Keelung Road, Section 4, Taipei 106, Taiwan. Tel.: +886 2 2737 6337. E-mail address: [email protected] (C....

0360-8352/$ see front matter 2013 Elsevier Ltd. All rights reserved. http://dx.doi.org/10.1016/j.cie.2013.03.002 ⇑ Corresponding author. Tel.: +90 212 285 33 11; fax: +90 212 240 72 60. E-mail addresses: [email protected] (G. _ Intepe), [email protected] (E. Bozdag), [email protected] (T. Koc). 1 Tel.: +90 212 293 13 00x2755; fax: +90 212 240 72 60. 2 Tel.: +90 212 293 13 00x2663. Gizem _ Int...

0360-8352/$ see front matter 2013 Elsevier Ltd. All rights reserved. http://dx.doi.org/10.1016/j.cie.2013.12.005 ⇑ Corresponding author. Tel.: 98 (0)21 8752 4022; fax: +98 (0)21 8851 2596. E-mail addresses: [email protected], [email protected] (R.Z. Farahani), [email protected] (M. Hekmatfar). 1 Tel.: +44 (0)20 8417 5098; fax: +44 (0)20 8417 7026. Reza Zanjirani F...

http://dx.doi.org/10.1016/j.cie.2015.02.022 0360-8352/ 2015 The Authors. Published by Elsevier Ltd. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/). ⇑ Corresponding author. Tel.: +44 2076792563; fax: +44 2073882348. E-mail addresses: [email protected] (L. Yang), [email protected] (S. Liu), [email protected] (S. Tsoka), l.papageorg...

http://dx.doi.org/10.1016/j.cie.2014.07.008 0360-8352/ 2014 Elsevier Ltd. All rights reserved. q This manuscript was processed by Area Editor Surendra M. Gupta. ⇑ Corresponding author at: Department of Mechanical Engineering, Politeknik Sultan Azlan Shah, 35950 Behrang, Perak, Malaysia. Tel.: +60 3 8921 7022; fax: +60 3 8925 9629. E-mail address: [email protected] (S.M. Jainury). Suhartini ...

ÐWe consider the problem of scheduling n identical jobs with unequal ready times on m parallel uniform machines to minimize the maximum lateness. This paper develops a branch-and-bound procedure that optimally solves the problem and introduces six simple single-pass heuristic procedures that approximate the optimal solution. The branch-and-bound procedure uses the heuristics to establish an ini...