Browsing by Keywords "Heuristics"
Now showing items 120 of 32

Analytical loading models in flexible manufacturing systems
(Elsevier, 1993)It would be difficult to efficiently implement a manufacturing system without solving its design and operational problems. Based on this framework, a system configuration and tooling problem is modeled. The model turns out ... 
Application mapping algorithms for meshbased networkonchip architectures
(Springer New York LLC, 201503)Due to shrinking technology sizes, more and more processing elements and memory blocks are being integrated on a single die. However, traditional communication infrastructures (e.g., bus or pointtopoint) cannot handle ... 
Bicriteria multiresource generalized assignment problem
(John Wiley & Sons, 2014)In this study,we consider a bicriteria multiresource generalized assignment problem. Our criteria are the total assignment load and maximum assignment load over all agents. We aim to generate all nondominated objective ... 
Climbing depthbounded discrepancy search for solving hybrid flow shop problems
(Inderscience Publishers, 2007)This paper investigates how to adapt some discrepancybased search methods to solve Hybrid Flow Shop (HFS) problems in which each stage consists of several identical machines operating in parallel. The objective is ... 
A comparative study of computational procedures for the resource constrained project scheduling problem
(Elsevier, 1994)Performance of two new integer programming based heuristics together with some special purpose algorithms for project scheduling are tested from a computational point of view. The objective of the study is to compare the ... 
A comparison of fixed and dynamic pricing policies in revenue management
(2013)We consider the problem of selling a fixed capacity or inventory of items over a finite selling period. Earlier research has shown that using a properly set fixed price during the selling period is asymptotically optimal ... 
Computational aspects of the maximum diversity problem
(Elsevier, 1996)We address two variations of the maximum diversity problem which arises when m elements are to be selected from an nelement population based on interelement distances. We study problem complexity and propose randomized ... 
Constrained mincut replication for Kway hypergraph partitioning
(Institute for Operations Research and the Management Sciences (I N F O R M S), 2014)Replication is a widelyused technique in information retrieval and database systems for providing fault tolerance and reducing parallelization and processing costs. Combinatorial models based on hypergraph partitioning ... 
Data dependent worst case bound improving techniques in zeroone programming
(1991)A simple perturbation of data is suggested for use in conjunction with approximation algorithms for the purpose of improving the available bounds (upper and lower), and the worst case bounds. The technique does not require ... 
Debris removal during disaster response: a case for Turkey
(Elsevier, 2016)Debris occurs from the ruin and wreckage of structures during a disaster. Proper removal of debris is of great importance because it blocks roads and prohibits emergency aid teams from accessing disasteraffected regions. ... 
Dynamic lot sizing for a warm/cold process: heuristics and insights
(Elsevier, 201309)We consider the dynamic lot sizing problem for a warm/cold process where the process can be kept warm at a unit variable cost for the next period if more than a prespecified quantity has been produced. Exploiting the ... 
The dynamic lotsizing problem with convex economic production costs and setups
(Elsevier, 201409)In this work the uncapacitated dynamic lotsizing problem is considered. Demands are deterministic and production costs consist of convex costs that arise from economic production functions plus setup costs. We formulate ... 
Effects of ignorance and information on judgments and decisions
(Society for Judgment and Decision Making, 2011)We compared Turkish and English students’ soccer forecasting for English soccer matches. Although the Turkish students knew very little about English soccer, they selected teams on the basis of familiarity with the team ... 
An exact approach to minimize single machine total weighted tardiness problem with unequal release dates
(Bilkent University, 1998)In this research, the problem of scheduling a set of jobs on a single machine to minimize total weighted tardiness with unequal release dates is considered. We present a new dominance rule by considering the time depending ... 
Matchup scheduling under a machine breakdown
(Elsevier, 1999)When a machine breakdown forces a modified flow shop (MFS) out of the prescribed state, the proposed strategy reschedules part of the initial schedule to match up with the preschedule at some point. The objective is to ... 
Meeting correlated spare part demands with optimal transshipments
(IGI Global, 2010)This paper studies spare part transshipments between two service part facilities whose demands are correlated. Transshipments are used to reduce severity of part stock outs. Facilities are run by an inventory manager (IM) ... 
A methodology for solving singlemodel, stochastic assembly line balancing problem
(Pergamon Press, 1999)In this paper, a methodology is developed to solve the singlemodel, stochastic assembly line balancing problem for the objective of minimizing the total labor cost and the expected incompletion cost arising from tasks not ... 
A new dominance rule for the total weighted tardiness problem
(Taylor & Francis, 1999)We present a new dominance rule for the single machine total weighted tardiness problem with job dependent penalties. The proposed dominance rule provides a sufficient condition for local optimality. We show that if any ... 
A new dominance rule to minimize total weighted tardiness on a single machine
(Bilkent University, 1996)We present a new dominance rule for the single machine total weighted tardiness problem with job dependent penalties. The proposed dominance rule provides a sufficient condition for local optimality, i.e. if any ... 
A new dominance rule to minimize total weighted tardiness with unequal release dates
(Elsevier, 2001)We present a new dominance rule by considering the timedependent orderings between each pair of jobs for the single machine total weighted tardiness problem with release dates. The proposed dominance rule provides a ...