Search Results - "Keha, Ahmet"

MIRPLib – A library of maritime inventory routing problem instances: Survey, core model, and benchmark results by Papageorgiou, Dimitri J., Nemhauser, George L., Sokol, Joel, Cheon, Myun-Seok, Keha, Ahmet B.

“…•A large class of deterministic maritime inventory routing problems is studied.•We provide a comprehensive literature survey of this class.•We introduce a core…”
Get full text

Mixed integer programming formulations for single machine scheduling problems by Keha, Ahmet B., Khowala, Ketan, Fowler, John W.

“…In this paper, the computational performance of four different mixed integer programming (MIP) formulations for various single machine scheduling problems is…”
Get full text

Minimum distance computation of LDPC codes using a branch and cut algorithm by Keha, A., Duman, T.

“…We give a branch-and-cut algorithm for finding the minimum distance of a binary linear block code. We give two integer programming (IP) models and study the…”
Get full text

A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization by Keha, Ahmet B, de Farias, Ismael R., Jr, Nemhauser, George L

“…We give a branch-and-cut algorithm for solving linear programs (LPs) with continuous separable piecewise-linear cost functions (PLFs). Models for PLFs use…”
Get full text

Using genetic algorithms for single-machine bicriteria scheduling problems by Köksalan, Murat, Burak Keha, Ahmet

“…We consider two bicriteria scheduling problems on a single machine: minimizing flowtime and number of tardy jobs, and minimizing flowtime and maximum…”
Get full text

Minimizing makespan with multiple-orders-per-job in a two-machine flowshop by Laub, Jeffrey D., Fowler, John W., Keha, Ahmet B.

“…We investigate a new scheduling problem, multiple-orders-per-job (MOJ), in the context of a two-machine flowshop. Lower bounds for the makespan performance…”
Get full text

Interval-indexed formulation based heuristics for single machine total weighted tardiness problem by Colak Altunc, Arife Burcu, Keha, Ahmet Burak

“…In this paper, we solve the single machine total weighted tardiness problem by using integer programming and linear programming based heuristic algorithms…”
Get full text

Evaluation of heuristics for a class-constrained lot-to-order matching problem in semiconductor manufacturing by Boushell, Thomas G., Fowler, John W., Keha, Ahmet B., Knutson, Kraig R., Montgomery, Douglas C.

“…While semiconductors are being used in an increasing number of products, semiconductor manufacturers continually look for ways to make their processes more…”
Get full text

Flexible solutions to maritime inventory routing problems with delivery time windows by Zhang, Chengliang, Nemhauser, George, Sokol, Joel, Cheon, Myun-Seok, Keha, Ahmet

“…•We develop a general Lagrangian heuristic scheme to deal with optimization under uncertainty where soft constraints are used to promote solution…”
Get full text

Scheduling interfering job sets on parallel machines by Balasubramanian, Hari, Fowler, John, Keha, Ahmet, Pfund, Michele

“…We consider bicriteria scheduling on identical parallel machines in a nontraditional context: jobs belong to two disjoint sets, and each set has a different…”
Get full text

Single machine scheduling with interfering job sets by Khowala, Ketan, Fowler, John, Keha, Ahmet, Balasubramanian, Hari

“…We consider two single machine bicriteria scheduling problems in which jobs belong to either of two different disjoint sets, each set having its own…”
Get full text

Models for representing piecewise linear cost functions by Keha, Ahmet B., de Farias, Ismael R., Nemhauser, George L.

“…We study formulations of linear programs with piecewise linear objective functions with and without additional binary variables. We show that the two…”
Get full text

Nonconvex, lower semicontinuous piecewise linear optimization by Vielma, Juan Pablo, Keha, Ahmet B., Nemhauser, George L.

“…A branch-and-cut algorithm for solving linear problems with continuous separable piecewise linear cost functions was developed in 2005 by Keha et al. This…”
Get full text

Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times by Swaminathan, Rajesh, Pfund, Michele E., Fowler, John W., Mason, Scott J., Keha, Ahmet

“…This paper is motivated by the problem of meeting due dates in a flowshop production environment with jobs with different weights and uncertain processing…”
Get full text

A polyhedral study of nonconvex piecewise linear optimization by Keha, Ahmet B

“…Piecewise linear functions are widely used to approximate nonlinear functions. However, when minimizing (maximizing) a piecewise linear function (PLF), it is…”
Get full text

A branch and cut algorithm for finding the minimum distance of a linear block code by Keha, A., Duman, T.M.

“…We give a branch-and-cut algorithm for finding the minimum distance of a binary linear error correcting code. We give two integer programming (IP) models and…”
Get full text