Search results for: payment problems
2397 Applying Sequential Pattern Mining to Generate Block for Scheduling Problems
Authors: Meng-Hui Chen, Chen-Yu Kao, Chia-Yu Hsu, Pei-Chann Chang
Abstract:
The main idea in this paper is using sequential pattern mining to find the information which is helpful for finding high performance solutions. By combining this information, it is defined as blocks. Using the blocks to generate artificial chromosomes (ACs) could improve the structure of solutions. Estimation of Distribution Algorithms (EDAs) is adapted to solve the combinatorial problems. Nevertheless many of these approaches are advantageous for this application, but only some of them are used to enhance the efficiency of application. Generating ACs uses patterns and EDAs could increase the diversity. According to the experimental result, the algorithm which we proposed has a better performance to solve the permutation flow-shop problems.
Keywords: Combinatorial problems, Sequential Pattern Mining, Estimation of Distribution Algorithms, Artificial Chromosomes.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17182396 Enhanced Imperialist Competitive Algorithm for the Cell Formation Problem Using Sequence Data
Authors: S. H. Borghei, E. Teymourian, M. Mobin, G. M. Komaki, S. Sheikh
Abstract:
Imperialist Competitive Algorithm (ICA) is a recent meta-heuristic method that is inspired by the social evolutions for solving NP-Hard problems. The ICA is a population-based algorithm which has achieved a great performance in comparison to other metaheuristics. This study is about developing enhanced ICA approach to solve the Cell Formation Problem (CFP) using sequence data. In addition to the conventional ICA, an enhanced version of ICA, namely EICA, applies local search techniques to add more intensification aptitude and embed the features of exploration and intensification more successfully. Suitable performance measures are used to compare the proposed algorithms with some other powerful solution approaches in the literature. In the same way, for checking the proficiency of algorithms, forty test problems are presented. Five benchmark problems have sequence data, and other ones are based on 0-1 matrices modified to sequence based problems. Computational results elucidate the efficiency of the EICA in solving CFP problems.Keywords: Cell formation problem, Group technology, Imperialist competitive algorithm, Sequence data.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15882395 Approximate Solution of Some Mixed Boundary Value Problems of the Generalized Theory of Couple-Stress Thermo-Elasticity
Authors: M. Chumburidze, D. Lekveishvili
Abstract:
We have considered the harmonic oscillations and general dynamic (pseudo oscillations) systems of theory generalized Green-Lindsay of couple-stress thermo-elasticity for isotropic, homogeneous elastic media. Approximate solution of some mixed boundary value problems for finite domain, bounded by the some closed surface are constructed.
Keywords: The couple-stress thermo-elasticity, boundary value problems.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 20312394 Analysis of Wi-Fi Access Networks Situation in the City Area
Authors: A. Statkus, S. Paulikas
Abstract:
With increasing number of wireless devices like laptops, Wi-Fi Web Cams, network extenders, etc., a new kind of problems appeared, mostly related to poor Wi-Fi throughput or communication problems. In this paper an investigation on wireless networks and it-s saturation in Vilnius City and its surrounding is presented, covering the main problems of wireless saturation and network load during day. Also an investigation on wireless channel selection and noise levels were made, showing the impact of neighbor AP to signal and noise levels and how it changes during the day.Keywords: IEEE 802.11b/g/n, wireless saturation, client activity, channel selection.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16482393 Solving Part Type Selection and Loading Problem in Flexible Manufacturing System Using Real Coded Genetic Algorithms – Part I: Modeling
Authors: Wayan F. Mahmudy, Romeo M. Marian, Lee H. S. Luong
Abstract:
This paper and its companion (Part 2) deal with modeling and optimization of two NP-hard problems in production planning of flexible manufacturing system (FMS), part type selection problem and loading problem. The part type selection problem and the loading problem are strongly related and heavily influence the system-s efficiency and productivity. The complexity of the problems is harder when flexibilities of operations such as the possibility of operation processed on alternative machines with alternative tools are considered. These problems have been modeled and solved simultaneously by using real coded genetic algorithms (RCGA) which uses an array of real numbers as chromosome representation. These real numbers can be converted into part type sequence and machines that are used to process the part types. This first part of the papers focuses on the modeling of the problems and discussing how the novel chromosome representation can be applied to solve the problems. The second part will discuss the effectiveness of the RCGA to solve various test bed problems.Keywords: Flexible manufacturing system, production planning, part type selection problem, loading problem, real-coded genetic algorithm
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21072392 Engineering Optimization Using Two-Stage Differential Evolution
Authors: K. Y. Tseng, C. Y. Wu
Abstract:
This paper employs a heuristic algorithm to solve engineering problems including truss structure optimization and optimal chiller loading (OCL) problems. Two different type algorithms, real-valued differential evolution (DE) and modified binary differential evolution (MBDE), are successfully integrated and then can obtain better performance in solving engineering problems. In order to demonstrate the performance of the proposed algorithm, this study adopts each one testing case of truss structure optimization and OCL problems to compare the results of other heuristic optimization methods. The result indicates that the proposed algorithm can obtain similar or better solution in comparing with previous studies.
Keywords: Differential evolution, truss structure optimization, optimal chiller loading, modified binary differential evolution.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 7082391 A Modified Inexact Uzawa Algorithm for Generalized Saddle Point Problems
Authors: Shu-Xin Miao
Abstract:
In this note, we discuss the convergence behavior of a modified inexact Uzawa algorithm for solving generalized saddle point problems, which is an extension of the result obtained in a recent paper [Z.H. Cao, Fast Uzawa algorithm for generalized saddle point problems, Appl. Numer. Math., 46 (2003) 157-171].
Keywords: Saddle point problem, inexact Uzawa algorithm, convergence behavior.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14832390 An Analytical Framework for Multi-Site Supply Chain Planning Problems
Authors: Yin-Yann Chen
Abstract:
As the gradual increase of the enterprise scale, the firms may possess many manufacturing plants located in different places geographically. This change will result in the multi-site production planning problems under the environment of multiple plants or production resources. Our research proposes the structural framework to analyze the multi-site planning problems. The analytical framework is composed of six elements: multi-site conceptual model, product structure (bill of manufacturing), production strategy, manufacturing capability and characteristics, production planning constraints, and key performance indicators. As well as the discussion of these six ingredients, we also review related literatures in this paper to match our analytical framework. Finally we take a real-world practical example of a TFT-LCD manufacturer in Taiwan to explain our proposed analytical framework for the multi-site production planning problems.Keywords: Multi-Site, Production Planning, Supply Chain, TFT-LCD.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19002389 Haar wavelet Method for Solving Initial and Boundary Value Problems of Bratu-type
Authors: S.G.Venkatesh, S.K.Ayyaswamy, G.Hariharan
Abstract:
In this paper, we present a framework to determine Haar solutions of Bratu-type equations that are widely applicable in fuel ignition of the combustion theory and heat transfer. The method is proposed by applying Haar series for the highest derivatives and integrate the series. Several examples are given to confirm the efficiency and the accuracy of the proposed algorithm. The results show that the proposed way is quite reasonable when compared to exact solution.
Keywords: Haar wavelet method, Bratu's problem, boundary value problems, initial value problems, adomain decomposition method.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 29652388 A New Design Partially Blind Signature Scheme Based on Two Hard Mathematical Problems
Authors: Nedal Tahat
Abstract:
Recently, many existing partially blind signature scheme based on a single hard problem such as factoring, discrete logarithm, residuosity or elliptic curve discrete logarithm problems. However sooner or later these systems will become broken and vulnerable, if the factoring or discrete logarithms problems are cracked. This paper proposes a secured partially blind signature scheme based on factoring (FAC) problem and elliptic curve discrete logarithms (ECDL) problem. As the proposed scheme is focused on factoring and ECDLP hard problems, it has a solid structure and will totally leave the intruder bemused because it is very unlikely to solve the two hard problems simultaneously. In order to assess the security level of the proposed scheme a performance analysis has been conducted. Results have proved that the proposed scheme effectively deals with the partial blindness, randomization, unlinkability and unforgeability properties. Apart from this we have also investigated the computation cost of the proposed scheme. The new proposed scheme is robust and it is difficult for the malevolent attacks to break our scheme.
Keywords: Cryptography, Partially Blind Signature, Factoring, Elliptic Curve Discrete Logarithms.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17702387 The Basic Problems for the Realization of the Concept of Economic Policy
Authors: R. Gvelesiani, I. Gogorishvili
Abstract:
The concept of economic policy and the practical economic policy diverge from each other at a certain stage of development. This is related to the concept of realization of the underlying problems. It comes with all the problems emerged in the market oriented economic order due to the political processes based on social welfare policy. The realization of the concept of economic policy is impeded by economic and political obstacles. If you want to fill the appeared between the concept and reality, it is necessary to identify and avoid these obstacles. It requires the following: increase of the level of the knowledge of prevention technology in understanding of economic relations, as well as political aspects of the formation of ideas; perfection of economic policy toolkit, and political methods. It is necessary to realize what is the main precondition of implementation and further development of the concept of economic policy, as well as the formation of opinions about economic and public safety. This is a broad consensus on the basic values of the content and the scale of action, which the general public wants to be realized.Keywords: Economic Policy, Basic Problems, Social Welfare Policy.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 12732386 Problems Occurring in the Process of Audit by Taking into Consideration their Theoretic Aspects against the Background of Reforms Conducted in a Country: The Example of Georgia
Authors: Levan Sabauri
Abstract:
The purpose of this article is an examination of the meaning of theoretic aspects of audit in the context of solving of specific problems of the audit. The audit’s aim is the estimation of financial statements by the auditor, i.e. if they are prepared according to the basic requirements of current financial statements. By examination of concrete examples, we can clearly see problems created in an audit and in often cases, those contradictions which can be caused by incompliance of matters regulated by legislation and by reality. An important part of this work is the analysis of reform in the direction of business accounting, statements and audit in Georgia and its comparison with EU countries. In the article, attention is concentrated on the analysis of specific problems of auditing practice and ways of their solving by taking into consideration theoretical aspects of the audit are proposed.
Keywords: Audit, auditor, auditor’s ethic code, auditor’s risk, financial statement, objectivity.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 8162385 On a New Inverse Polynomial Numerical Scheme for the Solution of Initial Value Problems in Ordinary Differential Equations
Authors: R. B. Ogunrinde
Abstract:
This paper presents the development, analysis and implementation of an inverse polynomial numerical method which is well suitable for solving initial value problems in first order ordinary differential equations with applications to sample problems. We also present some basic concepts and fundamental theories which are vital to the analysis of the scheme. We analyzed the consistency, convergence, and stability properties of the scheme. Numerical experiments were carried out and the results compared with the theoretical or exact solution and the algorithm was later coded using MATLAB programming language.Keywords: Differential equations, Numerical, Initial value problem, Polynomials.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17722384 Adaptation of Iterative Methods to Solve Fuzzy Mathematical Programming Problems
Authors: Ricardo C. Silva, Luiza A. P. Cantao, Akebo Yamakami
Abstract:
Based on the fuzzy set theory this work develops two adaptations of iterative methods that solve mathematical programming problems with uncertainties in the objective function and in the set of constraints. The first one uses the approach proposed by Zimmermann to fuzzy linear programming problems as a basis and the second one obtains cut levels and later maximizes the membership function of fuzzy decision making using the bound search method. We outline similarities between the two iterative methods studied. Selected examples from the literature are presented to validate the efficiency of the methods addressed.Keywords: Fuzzy Theory, Nonlinear Optimization, Fuzzy Mathematics Programming.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16232383 Positive Solutions for a Class of Semipositone Discrete Boundary Value Problems with Two Parameters
Authors: Benshi Zhu
Abstract:
In this paper, the existence, multiplicity and noexistence of positive solutions for a class of semipositone discrete boundary value problems with two parameters is studied by applying nonsmooth critical point theory and sub-super solutions method.Keywords: Discrete boundary value problems, nonsmoothcritical point theory, positive solutions, semipositone, sub-super solutions method
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13432382 A Family of Distributions on Learnable Problems without Uniform Convergence
Authors: César Garza
Abstract:
In supervised binary classification and regression problems, it is well-known that learnability is equivalent to uniform convergence of the hypothesis class, and if a problem is learnable, it is learnable by empirical risk minimization. For the general learning setting of unsupervised learning tasks, there are non-trivial learning problems where uniform convergence does not hold. We present here the task of learning centers of mass with an extra feature that “activates” some of the coordinates over the unit ball in a Hilbert space. We show that the learning problem is learnable under a stable RLM rule. We introduce a family of distributions over the domain space with some mild restrictions for which the sample complexity of uniform convergence for these problems must grow logarithmically with the dimension of the Hilbert space. If we take this dimension to infinity, we obtain a learnable problem for which the uniform convergence property fails for a vast family of distributions.
Keywords: Statistical learning theory, learnability, uniform convergence, stability, regularized loss minimization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 3552381 AGENTMAP: A Conceptual Meta-Model of Interacting Simulations
Authors: Thomas M. Prinz Wilhelm R. Rossak, Kai Gebhardt
Abstract:
A straightforward and intuitive combination of single simulations into an aggregated master-simulation is not trivial. There are lots of problems, which trigger-specific difficulties during the modeling and execution of such a simulation. In this paper we identify these problems and aim to solve them by mapping the task to the field of multi agent systems. The solution is a new meta-model named AGENTMAP, which is able to mitigate most of the problems and to support intuitive modeling at the same time. This meta-model will be introduced and explained on basis of an example from the e-commerce domain.
Keywords: Multi Agent System, Agent-based Simulation, Distributed Systems, Meta-models.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 18782380 Multi-Criteria Based Robust Markowitz Model under Box Uncertainty
Authors: Pulak Swain, A. K. Ojha
Abstract:
Portfolio optimization is based on dealing with the problems of efficient asset allocation. Risk and Expected return are two conflicting criteria in such problems, where the investor prefers the return to be high and the risk to be low. Using multi-objective approach we can solve those type of problems. However the information which we have for the input parameters are generally ambiguous and the input values can fluctuate around some nominal values. We can not ignore the uncertainty in input values, as they can affect the asset allocation drastically. So we use Robust Optimization approach to the problems where the input parameters comes under box uncertainty. In this paper, we solve the multi criteria robust problem with the help of E- constraint method.Keywords: Portfolio optimization, multi-objective optimization, E-constraint method, box uncertainty, robust optimization.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 6222379 Positive Solutions for Semipositone Discrete Eigenvalue Problems via Three Critical Points Theorem
Authors: Benshi Zhu
Abstract:
In this paper, multiple positive solutions for semipositone discrete eigenvalue problems are obtained by using a three critical points theorem for nondifferentiable functional.Keywords: Discrete eigenvalue problems, positive solutions, semipositone, three critical points theorem
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 12532378 Computational Networks for Knowledge Representation
Authors: Nhon Van Do
Abstract:
In the artificial intelligence field, knowledge representation and reasoning are important areas for intelligent systems, especially knowledge base systems and expert systems. Knowledge representation Methods has an important role in designing the systems. There have been many models for knowledge such as semantic networks, conceptual graphs, and neural networks. These models are useful tools to design intelligent systems. However, they are not suitable to represent knowledge in the domains of reality applications. In this paper, new models for knowledge representation called computational networks will be presented. They have been used in designing some knowledge base systems in education for solving problems such as the system that supports studying knowledge and solving analytic geometry problems, the program for studying and solving problems in Plane Geometry, the program for solving problems about alternating current in physics.Keywords: Artificial intelligence, artificial intelligence and education, knowledge engineering, knowledge representation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 22182377 Security Analysis on Anonymous Mutual Authentication Protocol for RFID Tag without Back-End Database and its Improvement
Authors: Songyi Kim, Kwangwoo Lee, Seungjoo Kim, Dongho Won
Abstract:
RFID (Radio Frequency IDentification) system has been widely used in our life, such as transport systems, passports, automotive, animal tracking, human implants, library, and so on. However, the RFID authentication protocols between RF (Radio Frequency) tags and the RF readers have been bring about various privacy problems that anonymity of the tags, tracking, eavesdropping, and so on. Many researchers have proposed the solution of the problems. However, they still have the problem, such as location privacy, mutual authentication. In this paper, we show the problems of the previous protocols, and then we propose a more secure and efficient RFID authentication protocol.Keywords: RFID, mutual authentication, serverless, anonymity.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19342376 An Ontology for Knowledge Representation and Applications
Authors: Nhon Do
Abstract:
Ontology is a terminology which is used in artificial intelligence with different meanings. Ontology researching has an important role in computer science and practical applications, especially distributed knowledge systems. In this paper we present an ontology which is called Computational Object Knowledge Base Ontology. It has been used in designing some knowledge base systems for solving problems such as the system that supports studying knowledge and solving analytic geometry problems, the program for studying and solving problems in Plane Geometry, the knowledge system in linear algebra.Keywords: Artificial intelligence, knowledge representation, knowledge base system, ontology.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21592375 Work Structuring and the Feasibility of Application to Construction Projects in Vietnam
Authors: Viet-Hung Nguyen, Luh-Maan Chang
Abstract:
Design should be viewed concurrently by three ways as transformation, flow and value generation. An innovative approach to solve design – related problems is described as the integrated product - process design. As a foundation for a formal framework consisting of organizing principles and techniques, Work Structuring has been developed to guide efforts in the integration that enhances the development of operation and process design in alignment with product design. Vietnam construction projects are facing many delays, and cost overruns caused mostly by design related problems. A better design management that integrates product and process design could resolve these problems. A questionnaire survey and in – depth interviews were used to investigate the feasibility of applying Work Structuring to construction projects in Vietnam. The purpose of this paper is to present the research results and to illustrate the possible problems and potential solutions when Work Structuring is implemented to construction projects in Vietnam.Keywords: integrated product – process design, Work Structuring, construction projects, Vietnam
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16922374 A Modified Decoupled Semi-Analytical Approach Based On SBFEM for Solving 2D Elastodynamic Problems
Authors: M. Fakharian, M. I. Khodakarami
Abstract:
In this paper, a new trend for improvement in semianalytical method based on scale boundaries in order to solve the 2D elastodynamic problems is provided. In this regard, only the boundaries of the problem domain discretization are by specific subparametric elements. Mapping functions are uses as a class of higherorder Lagrange polynomials, special shape functions, Gauss-Lobatto- Legendre numerical integration, and the integral form of the weighted residual method, the matrix is diagonal coefficients in the equations of elastodynamic issues. Differences between study conducted and prior research in this paper is in geometry production procedure of the interpolation function and integration of the different is selected. Validity and accuracy of the present method are fully demonstrated through two benchmark problems which are successfully modeled using a few numbers of DOFs. The numerical results agree very well with the analytical solutions and the results from other numerical methods.
Keywords: 2D Elastodynamic Problems, Lagrange Polynomials, G-L-Lquadrature, Decoupled SBFEM.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19862373 The Design of Self-evolving Artificial Immune System II for Permutation Flow-shop Problem
Authors: Meng-Hui Chen, Pei-Chann Chang, Wei-Hsiu Huang
Abstract:
Artificial Immune System is adopted as a Heuristic Algorithm to solve the combinatorial problems for decades. Nevertheless, many of these applications took advantage of the benefit for applications but seldom proposed approaches for enhancing the efficiency. In this paper, we continue the previous research to develop a Self-evolving Artificial Immune System II via coordinating the T and B cell in Immune System and built a block-based artificial chromosome for speeding up the computation time and better performance for different complexities of problems. Through the design of Plasma cell and clonal selection which are relative the function of the Immune Response. The Immune Response will help the AIS have the global and local searching ability and preventing trapped in local optima. From the experimental result, the significant performance validates the SEAIS II is effective when solving the permutation flows-hop problems.Keywords: Artificial Immune System, Clonal Selection, Immune Response, Permutation Flow-shop Scheduling Problems
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16072372 Numerical Computation of Sturm-Liouville Problem with Robin Boundary Condition
Authors: Theddeus T. Akano, Omotayo A. Fakinlede
Abstract:
The modelling of physical phenomena, such as the earth’s free oscillations, the vibration of strings, the interaction of atomic particles, or the steady state flow in a bar give rise to Sturm- Liouville (SL) eigenvalue problems. The boundary applications of some systems like the convection-diffusion equation, electromagnetic and heat transfer problems requires the combination of Dirichlet and Neumann boundary conditions. Hence, the incorporation of Robin boundary condition in the analyses of Sturm-Liouville problem. This paper deals with the computation of the eigenvalues and eigenfunction of generalized Sturm-Liouville problems with Robin boundary condition using the finite element method. Numerical solution of classical Sturm–Liouville problem is presented. The results show an agreement with the exact solution. High results precision is achieved with higher number of elements.Keywords: Sturm-Liouville problem, Robin boundary condition, finite element method, eigenvalue problems.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 29952371 Method for Solving Fully Fuzzy Assignment Problems Using Triangular Fuzzy Numbers
Authors: Amit Kumar, Anila Gupta, Amarpreet Kaur
Abstract:
In this paper, a new method is proposed to find the fuzzy optimal solution of fuzzy assignment problems by representing all the parameters as triangular fuzzy numbers. The advantages of the pro-posed method are also discussed. To illustrate the proposed method a fuzzy assignment problem is solved by using the proposed method and the obtained results are discussed. The proposed method is easy to understand and to apply for finding the fuzzy optimal solution of fuzzy assignment problems occurring in real life situations.
Keywords: Fuzzy assignment problem, Ranking function, Triangular fuzzy numbers.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16982370 Solving Fuzzy Multi-Objective Linear Programming Problems with Fuzzy Decision Variables
Authors: Mahnaz Hosseinzadeh, Aliyeh Kazemi
Abstract:
In this paper, a method is proposed for solving Fuzzy Multi-Objective Linear Programming problems (FMOLPP) with fuzzy right hand side and fuzzy decision variables. To illustrate the proposed method, it is applied to the problem of selecting suppliers for an automotive parts producer company in Iran in order to find the number of optimal orders allocated to each supplier considering the conflicting objectives. Finally, the obtained results are discussed.Keywords: Fuzzy multi-objective linear programming problems, triangular fuzzy numbers, fuzzy ranking, supplier selection problem.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14142369 Solution Approaches for Some Scheduling Problems with Learning Effect and Job Dependent Delivery Times
Authors: M. Duran Toksarı, B. Uçarkuş
Abstract:
In this paper, we propose two algorithms to optimally solve makespan and total completion time scheduling problems with learning effect and job dependent delivery times in a single machine environment. The delivery time is the extra time to eliminate adverse effect between the main processing and delivery to the customer. In this paper, we introduce the job dependent delivery times for some single machine scheduling problems with position dependent learning effect, which are makespan are total completion. The results with respect to two algorithms proposed for solving of the each problem are compared with LINGO solutions for 50-jobs, 100-jobs and 150- jobs problems. The proposed algorithms can find the same results in shorter time.Keywords: Delivery times, learning effect, makespan, scheduling, total completion time.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15512368 Payment for Pain: Differences between Hypothetical and Real Preferences
Authors: J. Trarbach, S. Schosser, B. Vogt
Abstract:
Decision-makers tend to prefer the first alternative over subsequent alternatives which is called the primacy effect. To reliably measure this effect, we conducted an experiment with real consequences for preference statements. Therefore, we elicit preferences of subjects using a rating scale, i.e. hypothetical preferences, and willingness to pay, i.e. real preferences, for two sequences of pain. Within these sequences, both overall intensity and duration of pain are identical. Hence, a rational decision-maker should be indifferent, whereas the primacy effect predicts a stronger preference for the first sequence. What we see is a primacy effect only for hypothetical preferences. This effect vanishes for real preferences.
Keywords: Decision making, primacy effect, real incentives, willingness to pay.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 872