Browsing by Keywords "Heuristic methods"
Now showing items 1-20 of 47
-
An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
(Taylor & Francis, 1999)Meeting due dates as a reflection of customer satisfaction is one of the scheduling criteria that is frequently encountered in today's manufacturing environments. The natural quantification of this qualitative goal involves ... -
Analysis of Lagrangian lower bounds for a graph partitioning problem
(Institute for Operations Research and the Management Sciences (INFORMS), 1999)Recently, Ahmadi and Tang (1991) demonstrated how various manufacturing problems can be modeled and solved as graph partitioning problems. They use Lagrangian relaxation of two different mixed integer programming formulations ... -
Approximations in compensator design: a duality
(The Institution of Engineering and Technology (IET), 2002)In classical controller design, poles fat to the left of dominant poles are sometimes ignored. Similarly, in some proportional-integral compensation techniques, the controller zero is placed close to the origin and design ... -
An archiving model for a hierarchical information storage environment
(Elsevier, 2000)We consider an archiving model for a database consisting of secondary and tertiary storage devices in which the query rate for a record declines as it ages. We propose a `dynamic' archiving policy based on the number of ... -
Assembly line balancing using genetic algorithms
(Kluwer Academic Publishers, 2000)Assembly Line Balancing (ALB) is one of the important problems of production/operations management area. As small improvements in the performance of the system can lead to significant monetary consequences, it is of utmost ... -
A beam search algorithm to optimize robustness under random machine breakdowns and processing time variability
(2007)The vast majority of the machine scheduling research assumes complete information about the scheduling problem and a static environment in which scheduling systems operate. In practice, however, scheduling systems are ... -
A beam search-based algorithm and evaluation of scheduling approaches for fexible manufacturing systems
(Taylor & Francis, 1998)This paper presents a new algorithm for the flexible manufacturing system (FMS) scheduling problem. The proposed algorithm is a heuristic based on filtered beam search. It considers finite buffer capacity, routing and ... -
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 ... -
Comparison and combination of two novel commercial detection methods
(2004)Detection and removal of commercials plays an important role when searching for important broadcast news video material. In this study, two novel approaches are proposed based on two distinctive characteristics of commercials, ... -
Customer order scheduling problem: a comparative metaheuristics study
(Springer, 2007)The customer order scheduling problem (COSP) is defined as to determine the sequence of tasks to satisfy the demand of customers who order several types of products produced on a single machine. A setup is required whenever ... -
Designing a road network for hazardous materials shipments
(Elsevier, 2007)We consider the problem of designating hazardous materials routes in and through a major population center. Initially, we restrict our attention to a minimally connected network (a tree) where we can predict accurately the ... -
Designing emergency response networks for hazardous materials transportation
(2007)Undesirable consequences of dangerous goods incidents can be mitigated by quick arrival of specialized response teams at the accident site. We present a novel methodology to determine the optimal design of a specialized ... -
A distance-limited continuous location-allocation problem for spatial planning of decentralized systems
(Elsevier, 2017)We introduce a new continuous location-allocation problem where the facilities have both a fixed opening cost and a coverage distance limitation. The problem has wide applications especially in the spatial planning of water ... -
Dynamic lot sizing and tool management in automated manufacturing systems
(Elsevier, 2002)The overall aim of this study is to show that there is a critical interface between the lot sizing and tool management decisions, and these two problems cannot be viewed in isolation. We propose "ve alternative algorithms ... -
Exact and heuristic approaches based on noninterfering transmissions for joint gateway selection, time slot allocation, routing and power control for wireless mesh networks
(Elsevier, 2017)Wireless mesh networks (WMNs) provide cost-effective alternatives for extending wireless communication over larger geographical areas. In this paper, given a WMN with its nodes and possible wireless links, we consider the ... -
Fast optimal load balancing algorithms for 1D partitioning
(Academic Press, 2004)The one-dimensional decomposition of nonuniform workload arrays with optimal load balancing is investigated. The problem has been studied in the literature as the "chains-on-chains partitioning" problem. Despite the rich ... -
Generalizing predicates with string arguments
(Springer New York LLC, 2006-06)The least general generalization (LGG) of strings may cause an over-generalization in the generalization process of the clauses of predicates with string arguments. We propose a specific generalization (SG) for strings to ... -
Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories
(Academic Press, 2007)We consider the problem of scheduling an application on a computing system consisting of heterogeneous processors and data repositories. The application consists of a large number of file-sharing otherwise independent ... -
An integrated approach for airline scheduling, aircraft fleeting and routing with cruise speed control
(Elsevier, 2016)To place an emphasis on profound relations among airline schedule planning problems and to mitigate the effect of unexpected delays, we integrate schedule design, fleet assignment and aircraft routing problems within a ... -
Job shop scheduling with beam search
(Elsevier Science B.V., Amsterdam, Netherlands, 1999)Beam Search is a heuristic method for solving optimization problems. It is an adaptation of the branch and bound method in which only some nodes are evaluated in the search tree. At any level, only the promising nodes are ...
