• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 2
  • Tagged with
  • 2
  • 2
  • 2
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Analysis Of Critical Factors Affecting Customer Satisfaction In Modular Kitchen Sector

Ozer, Semih 01 May 2009 (has links) (PDF)
This study starts with the review of the literature in customer satisfaction, customer satisfaction methods and models. After selecting a proper customer satisfaction method and model, the study conducts a survey and a questionnaire among the customers and professionals in the modular kitchen sector. The aim of the study is to analyze the factors affecting customer satisfaction and finding out the ones related with the modular kitchen sector. After applying the survey, the relations between the inputs and outputs of the satisfaction are analyzed with the overall satisfaction itself. The strong and weak factors are determined and a proper CRM tool is build-up to realize a decision-support and forecast tool in the study, which can be seen as a beginning for the companies in the real sector in this business to build a much more detailed and ERP integrated software and to use them. The results of the survey are compared with the similar studies from the literature.
2

A Study In Combinatorial Auctions

Bilge, Betul 01 August 2004 (has links) (PDF)
By the emergence of electronic commerce and low transaction costs on the Internet, an interest in the design of new auction mechanisms has been arisen. Recently many researchers in computer science, economics, business, and game theory have presented many valuable studies on the subject of online auctions, and auctions theory. When faced from a computational perspective, combinatorial auctions are perhaps the most challenging ones. Combinatorial auctions, that is, auctions where bidders can bid on combinations of items, tend to lead to more efficient allocations than traditional auction mechanisms in multi-item multi-unit situations where the agents&rsquo / valuations of the items are not additive. However, determining the winners to maximize the revenue is NP-complete. In this study, we first analyze the existing approaches for combinatorial auction problem. Based on this analysis, we then choose three different approaches, which are search approach, descending simultaneous auctions approach, and IP (Integer Programming) formulation approach to build our models. The performances of the models are compared using computer simulations, where we model bandwidth allocation system. Finally a combinatorial auction tool is built which can be used for online auctions and e-procurement systems.

Page generated in 0.0408 seconds