Browsing by Keywords "Scheduling"
Now showing items 1-20 of 119
-
Adaptive compute-phase prediction and thread prioritization to mitigate memory access latency
(Association for Computing Machinery, 2014)The full potential of chip multiprocessors remains unex- ploited due to the thread oblivious memory access sched- ulers used in off-chip main memory controllers. This is especially pronounced in embedded systems due to ... -
An analysis of cyclic scheduling problems in robot centered cells
(2012)The focus of this study is a robot centered cell consisting of m computer numerical control (CNC) machines producing identical parts. Two pure cycles are singled out and further investigated as prominent cycles in minimizing ... -
Analysis of maintenance policies for M machines with deteriorating performance
(Taylor & Francis, 2000)In this paper, we consider the maintenance scheduling of a group of M identical machines, the performance of which deteriorates with usage. Examples of such situations are frequently found in the heavy machine tooling, ... -
Analysis of order review/release problems in production systems
(Elsevier Science B.V., Amsterdam, Netherlands, 1999)Order Review/Release (ORR) activities have mostly been ignored in past job shop research. In most previous studies, arriving jobs are immediately released to the shop floor without considering any information about the ... -
Analysis of reactive scheduling problems in a job shop environment
(Elsevier, 2000)In this paper, we study the reactive scheduling problems in a stochastic manufacturing environment. Specifically, we test the several scheduling policies under machine breakdowns in a classical job shop system. In addition, ... -
Analytical modeling of multi-channel optical burst switching with multiple traffic classes
(Bilkent University, 2011)In this thesis, we study an Optical Burst Switching (OBS) node with links carrying multiple wavelength channels (called hereafter channels) with multiple traffic classes. We assume that offset-based service differentiation ... -
Auction based scheduling for distributed systems
(Bilkent University, 2005)Businesses deal with huge databases over a geographically distributed supply network. When this is combined with scheduling and planning needs, it becomes too difficult to handle. Recently, Fast Consumer Goods sector ... -
Auction based scheduling for distributed systems
(2006)Businesses deal with huge databases over a geographically distributed supply network. When this is combined with scheduling and planning needs, it becomes too difficult to handle. Recently, Fast Consumer Goods sector tends ... -
Batch scheduling to minimize maximum lateness
(Elsevier, 1997)We address the single-machine batch scheduling problem which arises when there are job families and setup requirements exist between these families; our objective is to minimize the maximum lateness. As our main result, ... -
Batch scheduling to minimize the weighted number of tardy jobs
(Pergamon Press, 2007)In this paper, we address a single-machine scheduling problem with due dates and batch setup times to minimize the weighted number of tardy jobs. We give a pseudo-polynomial dynamic program and a fully-polynomial approximation ... -
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 ... -
Beam search based algorithm for scheduling machines and AGVs in an FMS
(Publ by IIE, Norcross, GA, United States, 1993)This paper presents a beam search based scheduling algorithm for a random FMS. The proposed algorithm considers finite buffer capacity, routing and sequence flexibilities and generates machine and AGV schedules in varying ... -
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 ... -
Benefits of forecasting and energy storage in isolated grids with large wind penetration – The case of Sao Vicente
(Elsevier, 2017)For electric grids that rely primarily on liquid fuel based power generation for energy provision, e.g. one or more diesel gensets, measures to allow a larger fraction of intermittent sources can pay-off since the displaced ... -
Bicriteria robotic cell scheduling with controllable processing times
(Taylor & Francis, 2011)The current study deals with a bicriteria scheduling problem arising in an m-machine robotic cell consisting of CNC machines producing identical parts. Such machines by nature possess the process flexibility of altering ... -
Big-data streaming applications scheduling based on staged multi-armed bandits
(Institute of Electrical and Electronics Engineers, 2016)Several techniques have been recently proposed to adapt Big-Data streaming applications to existing many core platforms. Among these techniques, online reinforcement learning methods have been proposed that learn how to ... -
Climbing depth-bounded discrepancy search for solving hybrid flow shop problems
(Inderscience Publishers, 2007)This paper investigates how to adapt some discrepancy-based search methods to solve Hybrid Flow Shop (HFS) problems in which each stage consists of several identical machines operating in parallel. The objective is ... -
Common due date early
(Bilkent University, 2013)This study considers a scheduling problem with position-dependent deteriorating jobs and a maintenance activity in a single machine. Even in the absence of maintenance activity and deterioration problem is NP-hard. A ... -
A comparative study of computational procedures for resource constrained project scheduling problem
(Bilkent University, 1991)Customarily, the project sclheduling problem is thought in the context of PERT and CPM. Although widely used and powerful, these techniques do not take into account a basic feature of the problem, that is resource limitations. ... -
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 ...
