Browsing by Keywords "Scheduling"
Now showing items 21-40 of 118
-
Customer order scheduling on a single machine with family setup times: complexity and algorithms
(Elsevier, 2007)We consider a situation where C customers each order various quantities (possibly zero in some cases) of products from P different families, which can be produced on a continuously available machine in any sequence (requiring ... -
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 ... -
Data replication versus timing constraints in distributed database systems
(ACM, 1994-03)In a database system supporting a real-time application, each transaction is associated with a timing constraint, typically in the form of a deadline. Replicated database systems possess desirable features for real-time ... -
Design and scheduling of periodic review kanban systems
(Bilkent University, 1997)In the last years, the term just in-time (JIT) has become a common term in repretitive manufacturing systems. It can be defined as the ideal of having the necessary amount of material available where it is needed and ... -
Development of cost model for the single-model stochastic assembly line balancing problem
(1990)In this paper we develop a cost model for the single-model stochastic assembly line balancing problem for the objective of minimizing the total labour cost (dicated by the number of stations on the line) and the expected ... -
Due date and cost-based FMS loading, scheduling and tool management
(Taylor & Francis, 2007)In this study, we consider flexible manufacturing system loading, scheduling and tool management problems simultaneously. Our aim is to determine relevant tool management decisions, which are machining conditions selection ... -
Dynamic lot sizing and scheduling in cellular manufacturing systems using hybrid simulation analytic model
(International Journal of Industrial Engineering, 1995)In most of the production systems, lot-sizing and scheduling decisions are made at different levels of hierarchy; although there is a strong interaction between these decisions. Furthermore, most of the existing models do ... -
Dynamic lot-sizing and scheduling in a cellular manufacturing system
(Bilkent University, 1993)In most of the production systems, lot-sizing and scheduling decisions are given in different levels of hierarchy, however there is a strong interaction between these decisions. Most of the existing models do not utilize ... -
Effect of load, processing time and due date variation on the effectiveness of scheduling rules
(Taylor & Francis, 2002)In real manufacturing environments, variations in production factors (i.e. pro- cessing time, demand, due-dates) are inevitable facts. All these dynamic changes, together with random disturbances (e.g. machine breakdowns) ... -
An efficient algorithm for the single machine total tardiness problem
(Taylor & Francis, 2001)This paper presents an exact algorithm for the single machine total tardiness problem (1// L T;). We present a new synthesis of various results from the literature which leads to a compact and concise representation of job ... -
EHPBS: Energy harvesting prediction based scheduling in wireless sensor networks
(IEEE, 2013)The clustering algorithms designed for traditional sensor networks have been adapted for energy harvesting sensor networks (EHWSN). However, in these algorithms, the intra-cluster MAC protocols to be used were either not ... -
Exact analytical model of age of information in multi-source status update systems with per-source queueing
(IEEE, 2022-05-27)We study a multisource status update system with Poisson information packet arrivals and exponentially distributed service times. The server is equipped with a waiting room holding the freshest packet from each source ... -
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 ... -
An exact approach to minimizing total weighted tardiness with release dates
(Kluwer Academic Publishers, 2000)The study deals with scheduling a set of independent jobs with unequal release dates to minimize total weighted tardiness on a single machine. We propose new dominance properties that are incorporated in a branch and bound ... -
FPTAS for half-products minimization with scheduling applications
(Elsevier, 2008)A special class of quadratic pseudo-boolean functions called "half-products" (HP) has recently been introduced. It has been shown that HP minimization, while NP-hard, admits a fully polynomial time approximation scheme ... -
Generating short-term observation schedules for space mission projects
(Kluwer Academic Publishers, 1999)In this paper, we propose a new dispatching rule and a set of local search algorithms based on the filtered beam search, GRASP and simulated annealing methodologies to construct short-term observation schedules of space ... -
Goal programming approach to solve the timetabling problem at Turkish Military Academy
(Bilkent University, 2004)The aim of this study is to propose a goal programming model to solve the timetabling problem at Turkish Military Academy. Since the problem is NPcomplete, it’s not easy to find an optimal solution all the time. It takes ... -
Hedging production schedules against uncertainty in manufacturing environment with a review of robustness and stability research
(Taylor & Francis, 2009)Scheduling is a decision-making process that is concerned with the allocation of limited resources to competing tasks (operations of jobs) over a time period with the goal of optimising one or more objectives. In theory, ... -
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 ... -
Inequity averse optimization in operational research
(Elsevier, 2015)There are many applications across a broad range of business problem domains in which equity is a concern and many well-known operational research (OR) problems such as knapsack, scheduling or assignment problems have been ...
