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 Author

Browsing by Author "Erel, Erdal"

Filter results by typing the first few letters
Now showing 1 - 5 of 5
  • Results Per Page
  • Sort Options
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Development of cost model for the single-model stochastic assembly line balancing problem
    (1990) Sarin, S. C.; Erel, Erdal
    In this paper we develop a cost model for the single-model stochastic assembly line balancing problem for the objective of minimizing the total labour cost (dicated by the number of stations on the line) and the expected incompletion cost arising from tasks not completed within the prescribed cycle time. Its use is demonstrated in a dynamic programming procedure which is implemented using a bounding strategy to curtail storage and computational requirements. The solutions obtained are compared with those obtained using the procedure of Kottas and Lau (1973, 1981).
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Management information systems in family planning: experience of a developing country
    (Federation Internationale d'Information et de Documentation, 1992) Onkal, Dilek; Erel, Erdal
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Robust optimization for the discrete time-cost tradeoff problem with cost uncertainty
    (Springer International Publishing, 2015) Hazır, Öncü; Haouari, Mohamed; Erel, Erdal
    Projects are subject to various sources of uncertainty that hamper reaching project targets; hence, it is crucial importance to use effective approaches to generate robust project schedules, which are less vulnerable to disruptions caused by uncontrollable factors. In this vein, this chapter examines analytical models and algorithms of robust multi-mode project scheduling, specifically, the robust discrete time-cost tradeoff problem (DTCTP). The models and algorithms presented in this chapter can support project managers from a wide range of industries in scheduling activities to minimize deviations from project goals. Furthermore, some surrogate measures that aim at providing an accurate estimate of the schedule robustness are developed and related experimental results are presented. Finally, some potential research areas are proposed and discussed. © Springer International Publishing Switzerland 2015.
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Robust optimization for the discrete time-cost tradeoff problem with cost uncertainty
    (Springer, 2015) Hazır, Ö.; Haouari, M.; Erel, Erdal; Schwindt, C.; Zimmermann, J.
    Projects are subject to various sources of uncertainty that hamper reaching project targets; hence, it is crucial importance to use effective approaches to generate robust project schedules, which are less vulnerable to disruptions caused by uncontrollable factors. In this vein, this chapter examines analytical models and algorithms of robust multi-mode project scheduling, specifically, the robust discrete time-cost tradeoff problem (DTCTP). The models and algorithms presented in this chapter can support project managers from a wide range of industries in scheduling activities to minimize deviations from project goals. Furthermore, some surrogate measures that aim at providing an accurate estimate of the schedule robustness are developed and related experimental results are presented. Finally, some potential research areas are proposed and discussed.
  • Loading...
    Thumbnail Image
    ItemOpen Access
    Sequencing jobs on a single machine with a common due date and stochastic processing times
    (1991) Sarin, S. C.; Erel, Erdal; Steiner, G.
    This paper presents a procedure for sequencing jobs on a single machine with jobs having a common due date and stochastic processing times. The performance measure to be optimized is the expected incompletion cost. Job processing times are normally distributed random variables, and the variances of the processing times are proportional to their means. The optimal sequences are shown to have a W- or V-shape. Based on this property computationally attractive solution methods are presented.

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