Ömer S. Benli

Learn More
Constraint programming is a relatively new approach for solving combinatorial optimization problems. This approach is especially effective for large scale scheduling problems with side conditions. University course scheduling problem is one of the hard problems in combinatorial optimization. Furthermore, the specific requirements of each institution make it(More)
The models presented in this study are based on lot streaming paradigm and make use of the basic model-ing framework of constraint satisfaction. The problem modeled is the following: Several production lots, each consisting of a number of units, are to be processed in a job shop. Each production lot, or its sublot of given size, has a deadline. The problem(More)
Nonparametric analysis of blocked ordered categories data: some examples revisited, D. Comparison of two common estimators of the ratio of the means of independent normal variables in agricultural research, Effectiveness of high interest rate policy on exchange rates: a reexamination of the Asian financial crisis, Loss protection in pairs trading through(More)
  • 1