Interactive flow-shop scheduling

Date

1989

Author

Düz, Gülin

Metadata

Show full item record

Item Usage Stats

44
views

0
downloads

URI

https://hdl.handle.net/11511/6317

Collections

Graduate School of Natural and Applied Sciences, Thesis

Suggestions

OpenMETU
Core

AUTOMATIC BUILDING DETECTION WITH FEATURE SPACE FUSION USING ENSEMBLE LEARNING Senaras, Caglar; Yuksel, Baris; Ozay, Mete; Yarman-Vural, Fatos (2012-07-27) This paper proposes a novel approach to building detection problem in satellite images. The proposed method employs a two layer hierarchical classification mechanism for ensemble learning. After an initial segmentation, each segment is classified by N different classifiers using different features at the first layer. The class membership values of the segments, which are obtained from different base layer classifiers, are ensembled to form a new fusion space, which forms a linearly separable simplex. Then, ...
Adaptive Harmony Search Method for Structural Optimization Hasançebi, Oğuzhan; Saka, Mehmet Polat (American Society of Civil Engineers (ASCE), 2010-04-01) This paper presents an adaptive harmony search algorithm for solving structural optimization problems. The harmony memory considering rate and pitch adjusting rate are conceived as the two main parameters of the technique for generating new solution vectors. In the standard implementation of the technique appropriate constant values are assigned to these parameters following a sensitivity analysis for each problem considered. The success of the optimization process is directly related on a chosen parameter ...
Dynamic resource allocation in virtualized networks for network slicing Canpolat, Ceren; Güran Schmidt, Şenan Ece.; Department of Electrical and Electronics Engineering (2020) The developments of 5G wireless technology, enables serving to various vertical industries through sharing a common infrastructure. To this end, multi-tenancy support of these diverse industries are realized on virtualized networks with the help of network slicing. The introduction of sharing brings many challenges such as QoS satisfaction, fairness and performance isolation among slices. The diversity of these slices mainly lies in their data rate requests and user populations. The slices with high data ra...
Automatic landmark discovery for learning agents under partial observability DEMİR, ALPER; Cilden, Erkin; Polat, Faruk (Cambridge University Press (CUP), 2019-08-02) In the reinforcement learning context, a landmark is a compact information which uniquely couples a state, for problems with hidden states. Landmarks are shown to support finding good memoryless policies for Partially Observable Markov Decision Processes (POMDP) which contain at least one landmark. SarsaLandmark, as an adaptation of Sarsa(lambda), is known to promise a better learning performance with the assumption that all landmarks of the problem are known in advance.
Robust Inventory Routing Under Demand Uncertainty Solyali, Oguz; Cordeau, Jean-Francois; Laporte, Gilbert (2012-08-01) This paper introduces a robust inventory routing problem where a supplier distributes a single product to multiple customers facing dynamic uncertain demands over a finite discrete time horizon. The probability distribution of the uncertain demand at each customer is not fully specified. The only available information is that these demands are independent and symmetric random variables that can take some value from their support interval. The supplier is responsible for the inventory management of its custo...

Citation Formats

G. Düz, “Interactive flow-shop scheduling,” Middle East Technical University, 1989.