Yazar "Turker, A. Kursad" seçeneğine göre listele

Listeleniyor 1 - 2 / 2
  • [ X ]
    Öğe
    Internet Based Intelligent Hospital Appointment System
    (Taylor & Francis Inc, 2015) Aktepe, Adnan; Turker, A. Kursad; Ersoz, Suleyman
    In today's competitive service industry, the technology in service systems is used in a wide range of areas. The service companies are now providing service via internet or via other computer based systems in an increasing trend day by day. Expert systems are good examples of these applications. Today, expert systems are used in various fields such as design, planning, imaging, diagnosis, etc. For practical use, the expert systems are also used through internet. One of the most important service system institutions is the hospital. Increasing the service quality level in hospitals, internet based appointment systems are used in several hospitals in Turkey. There are also several internet based expert system applications today contributing the improvement of service levels in several industries. In this study, an internet based expert system is created that is used in outpatient department/polyclinic direction. The system architecture, algorithm and the role of such an expert system are discussed in this paper. With the help of internet based expert appointment system at hospitals, the queues in the hospitals decline, the number of consultations decreases, the patients and doctors save time and finally the customer satisfaction and quality level increases.
  • [ X ]
    Öğe
    Scheduling Two Parallel Machines with Sequence-dependent Setups and A Single Server
    (Gazi Univ, 2011) Turker, A. Kursad; Sel, Cagri
    This paper presents a scheduling problem on parallel machines with sequence-dependent setup times and setup operations that performed by a single server. The main purpose is to get minimum makespan of the schedule. The system is formulated as genetic algorithm with problem sizes consisting of two machines and 10, 20 and 30 jobs. A genetic algorithm is developed using random data sets. The optimum results are obtained using a string based permutation algorithm which scans all alternatives. As a result, proposed algorithm is effective to solve P2,S|STsd|Cmax scheduling problem on reasonable runtime and the results of the algorithm which are close to optimum solution values. Effectiveness of the solution is presented considering approximation rates of the genetic algorithm solutions to the optimum results obtained for P2,S|STsd|Cmax problem.