International Journal of Production Management and Engineering - Vol 04, No 2 (2016)
https://riunet.upv.es:443/handle/10251/74214
2024-03-29T01:40:07ZSolving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System
https://riunet.upv.es:443/handle/10251/74221
Solving the Traveling Salesman Problem Based on The Genetic Reactive Bone Route Algorithm whit Ant Colony System
Yousefikhoshbakht, Majid; Malekzadeh, Nasrin; Sedighpour, Mohammad
[EN] The TSP is considered one of the most well-known combinatorial optimization tasks and researchers have paid so much attention to the TSP for many years. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The objective is to minimize the total distance traveled by the salesman. Because this problem is a non-deterministic polynomial (NP-hard) problem in nature, a hybrid meta-heuristic algorithm called REACSGA is used for solving the TSP. In REACSGA, a reactive bone route algorithm that uses the ant colony system (ACS) for generating initial diversified solutions and the genetic algorithm (GA) as an improved procedure are applied. Since the performance of the Metaheuristic algorithms is significantly influenced by their parameters, Taguchi Method is used to set the parameters of the proposed algorithm. The proposed algorithm is tested on several standard instances involving 24 to 318 nodes from the literature. The computational result shows that the results of the proposed algorithm are competitive with other metaheuristic algorithms for solving the TSP in terms of better quality of solution and computational time respectively. In addition, the proposed REACSGA is significantly efficient and finds closely the best known solutions for most of the instances in which thirteen best known solutions are also found.
2016-11-16T14:16:02ZHybrid genetic algorithms: solutions in realistic dynamic and setup dependent job-shop scheduling problems
https://riunet.upv.es:443/handle/10251/74220
Hybrid genetic algorithms: solutions in realistic dynamic and setup dependent job-shop scheduling problems
Branco, Rogério M.; Coelho, Antônio S.; Mayerle, Sérgio F.
[EN] This paper discusses the application of heuristic-based evolutionary technique in search for solutions concerning the dynamic job-shop scheduling problems with dependent setup times and alternate routes. With a combinatorial nature, these problems belong to an NP-hard class, with an aggravated condition when in realistic, dynamic and therefore, more complex cases than the traditional static ones. The proposed genetic algorithm executes two important functions: choose the routes using dispatching rules when forming each individual from a defined set of available machines and, also make the scheduling for each of these individuals created. The chromosome codifies a route, or the selected machines, and also an order to process the operations. In essence , each individual needs to be decoded by the scheduler to evaluate its time of completion, so the fitness function of the genetic algorithm, applying the modified Giffler and Thomson’s algorithm, obtains a scheduling of the selected routes in a given planning horizon. The scheduler considers the preparation time between operations on the machines and can manage operations exchange respecting the route and the order given by the chromosome. The best results in the evolutionary process are individuals with routes and processing orders optimized for this type of problema.
2016-11-16T14:14:07ZFlow shop scheduling decisions through Techniques for Order Preference by Similarity to an Ideal Solution (TOPSIS)
https://riunet.upv.es:443/handle/10251/74219
Flow shop scheduling decisions through Techniques for Order Preference by Similarity to an Ideal Solution (TOPSIS)
Gupta, Arun; Kumar, Shailendra
[EN] The flow-shop scheduling problem (FSP) has been widely studied in the literature and having a very active research area. Over the last few decades, a number of heuristic/meta-heuristic solution techniques have been developed. Some of these techniques offer excellent effectiveness and efficiency at the expense of substantial implementation efforts and being extremely complicated. This paper brings out the application of a Multi-Criteria Decision Making (MCDM) method known as techniques for order preference by similarity to an ideal solution (TOPSIS) using different weighting schemes in flow-shop environment. The objective function is identification of a job sequence which in turn would have minimum makespan (total job completion time). The application of the proposed method to flow shop scheduling is presented and explained with a numerical example. The results of the proposed TOPSIS based technique of FSP are also compared on the basis of some benchmark problems and found compatible with the results obtained from other standard procedures.
2016-11-16T14:12:17ZApplying Total Quality Management Tools Using QFD at Higher Education Institutions in Gulf Area (Case Study: ALHOSN University)
https://riunet.upv.es:443/handle/10251/74218
Applying Total Quality Management Tools Using QFD at Higher Education Institutions in Gulf Area (Case Study: ALHOSN University)
Al-Bashir, Adnan
Human power’s quality plays the key role in the growth and development of societies where the quality of human powers can be enriched with the high quality education provided by the higher education institutions. The higher education institutions are hereby an important sector of any society since it defines the overall quality of human lives. This research will investigate the application of Total Quality Management (TQM) tools at the higher education institutions; specifically at ALHOSN University. In this study five tools were implemented at ALHOSN University’s engineering college including: Quality Function Deployment, Affinity Diagrams, Tree Diagrams, Pareto Charts, and Fishbone Diagrams. The research will reveal that the implementation of TQM tools has a great benefit for higher education institutions where they have uncovered many area of potential improvement as well as the main causes of some of the problems the Faculty of Engineering is facing. Also, it will show that the implementation of TQM tools on higher education institution systems will enhance the performance of such institutions.
2016-11-16T14:10:05ZA Mathematical Programming Model for Tactical Planning with Set-up Continuity in a Two-stage Ceramic Firm
https://riunet.upv.es:443/handle/10251/74217
A Mathematical Programming Model for Tactical Planning with Set-up Continuity in a Two-stage Ceramic Firm
Pérez Perales, David; Alemany, M.M. Eva
[EN] It is known that capacity issues in tactical production plans in a hierarchical context are relevant since its inaccurate determination may lead to unrealistic or simply non-feasible plans at the operational level. Semi-continuous industrial processes, such as ceramic ones, often imply large setups and their consideration is crucial for accurate capacity estimation. However, in most of production planning models developed in a hierarchical context at this tactical (aggregated) level, setup changes are not explicitly considered. Their consideration includes not only decisions about lot sizing of production, but also allocation, known as Capacitated Lot Sizing and Loading Problem (CLSLP). However, CLSLP does not account for set-up continuity, specially important in contexts with lengthy and costly set-ups and where product families minimum run length are similar to planning periods. In this work, a mixed integer linear programming (MILP) model for a two stage ceramic firm which accounts for lot sizing and loading decisions including minimum lot-sizes and set-up continuity between two consecutive periods is proposed. Set-up continuity inclusion is modelled just considering which product families are produced at the beginning and at the end of each period of time, and not the complete sequence. The model is solved over a simplified two-stage real-case within a Spanish ceramic firm. Obtained results confirm its validity.
2016-11-16T14:08:14ZIndustrial Engineering: creating a network!
https://riunet.upv.es:443/handle/10251/74216
Industrial Engineering: creating a network!
Prado-Prado, José Carlos
[EN] This paper presents a brief history of the Industrial Engineering Conference (CIO), and specially reinforces the role of the CIOs as a forum for building a network and creating log-term relationships
2016-11-16T14:04:55Z