BUIR logo
Communities & Collections
All of BUIR
  • English
  • Türkçe
Log In
Please note that log in via username/password is only available to Repository staff.
Have you forgotten your password?
  1. Home
  2. Browse by Subject

Browsing by Subject "complexity"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Integrated scheduling of production and logistics operations of a multi-plant manifacturer serving a single customer area
    (2009) Çelen, Merve
    Increasing market competition forces manufacturers to continuously reduce their leadtimes by minimizing the total time spent in both production and distribution. Some studies in the relevant literature indicate that scheduling production and logistics operations in a coordinated manner leads to improved results. This thesis studies the problem of scheduling production and distribution operations of a manufacturer serving a single customer area from multiple identical production plants dispersed at different geographical locations. The products are transported to the customer area by a single capacitated truck. The setting is inspired by the operations of a leading soft drink manufacturer, and the objective is set in line with their needs as the minimization of the total completion time of the jobs. The completion time of a job is defined as the time it reaches at the customer area. We consider both this general problem and four special cases motivated by common practical applications. We prove that both the main problem and three of its special cases are NP-hard at least in the ordinary sense. We develop mixed integer programming (MIP) models for all these problems and propose a pseudo-polynomial dynamic programming mechanism for the remaining special case. Since the MIP models are able to provide optimal solutions only for small instances in a reasonable amount of time, heuristics are also proposed to solve larger instances. Fast lower bounds are developed to facilitate the performance assessment of these heuristics in medium and large instances. Evidence from extensive computational experimentation suggests that the proposed heuristics are both efficient and effective.
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Relationships between assessements of residential movie interiors, attributes of assumed residents and respondent characteristics
    (2009) Tanrıverdi, Yaprak
    The aim of this study was to explore the relationships between assessments of residential movie interiors, personal attributes of assumed residents and respondent characteristics. The study was conducted with 113 students from the Department of Interior Architecture and Environmental Design of Bilkent University. Nine residential movie clips were presented to the participants and they were asked to fill out a questionnaire sheet which consisted of three parts: Items involving space qualities, personal attributes of assumed residents, and relatedness and happiness of the respondents. Residential spaces rated as unfamiliar were rated as more exciting and were preferred over those rated as familiar. Furthermore, respondents having related self-construals reported more happiness and they perceived assumed residents as being happier and more trustworthy. No significant relationship was found between the complexity ratings of the movie clips and the evaluations of the residential spaces portrayed. This might have been because other variables besides complexity could not be controlled due to the nature of the stimuli.

About the University

  • Academics
  • Research
  • Library
  • Students
  • Stars
  • Moodle
  • WebMail

Using the Library

  • Collections overview
  • Borrow, renew, return
  • Connect from off campus
  • Interlibrary loan
  • Hours
  • Plan
  • Intranet (Staff Only)

Research Tools

  • EndNote
  • Grammarly
  • iThenticate
  • Mango Languages
  • Mendeley
  • Turnitin
  • Show more ..

Contact

  • Bilkent University
  • Main Campus Library
  • Phone: +90(312) 290-1298
  • Email: dspace@bilkent.edu.tr

Bilkent University Library © 2015-2025 BUIR

  • Privacy policy
  • Send Feedback