Heuristics for Dynamic Scheduling of Multi-Class Base-Stock Controlled Systems

Date

2005-05-20

Author

Kat, Bora
Avşar, Zeynep Müge

Metadata

Show full item record

Item Usage Stats

61
views

0
downloads

Dynamic scheduling of an exponential single-server facility processing different types of items one by one is studied for the case of Poisson demand arrivals. Inventories of the items are managed by base-stock policies and backordering is allowed. Structure of the optimal scheduling policy is investigated numerically with respect to a weighted average of the fill rates. Performance of the optimal policy is compared to those of two well-known policies, Longest Queue and First-Come-First-Served, and alternative policies are generated by heuristics in order to approximate the optimal policy.

URI

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

Conference Name

Heuristics for Dynamic Scheduling of Multi-Class Base-Stock Controlled Systems ( 20 - 25 Mayıs 2005)

Collections

Graduate School of Natural and Applied Sciences, Conference / Seminar

Suggestions

OpenMETU
Core

Heuristics for operational fixed job scheduling problems with working and spread time constraints Eliiyi, Deniz Tursel; Azizoğlu, Meral (Elsevier BV, 2011-07-01) Operational fixed job scheduling problems select a set of jobs having fixed ready and processing times and schedule the selected jobs on parallel machines so as to maximize the total weight. In this study, we consider working time and spread time constrained versions of the operational fixed job scheduling problems. The working time constraints limit the total processing load on each machine. The spread time constraints limit the time between the start of the first job and the finish of the last job on each...
A genetic algorithm for the resource constrained project scheduling problem Özleyen, Erdem; Sönmez, Rifat; Department of Civil Engineering (2011) The resource-constrained project scheduling problem (RCPSP) aims to find a schedule of minimum makespan by starting each activity such that resource constraints and precedence constraints are respected. However, as the problem is NP-hard (Non-Deterministic Polynomial-Time Hard) in the strong sense, the performance of exact procedures is limited and can only solve small-sized project networks. In this study a genetic algorithm is proposed for the RCPSP. The proposed genetic algorithm (GA) aims to find near-o...
Optimization of onshore steel drilling rigs using the convergence rate approach integrated metaheuristic search algorithms Salatin, Reza; Hasançebi, Oğuzhan; Mertol, Halit Cenan; Department of Civil Engineering (2018) Despite the exceptional ability of the metaheuristics in locating the optimum solution of discrete optimization problems, the volume of the required analyses through these methods is burdensome. Optimization of large-scale structures having numerous load cases, as well as complex geometries, therefore, is not considered practical in construction industry. In current study, however, an effort has been made to pave the way for the industrialization of the structural optimization by enabling the traditional me...
Heuristics for a continuous multi-facility location problem with demand regions Dinler, Derya; Tural, Mustafa Kemal; İyigün, Cem (Elsevier BV, 2015-10) We propose mathematical programming formulations of the single and multiple facility versions of the problem considered. The single facility location problem is formulated as a second order cone programming (SOCP) problem, and hence is solvable in polynomial time. The multiple facility location problem is NP-hard in general and can be formulated as a mixed integer SOCP problem. This formulation is weak and does not even solve medium-size instances. To solve larger instances of the problem we propose three h...
AN APPROXIMATE SOLUTION FOR THE RESEQUENCING PROBLEM IN PACKET-SWITCHING NETWORKS BILGEN, S; ALTINTAS, O (1994-02-01) An approximation heuristic is proposed for solving the heterogeneous multi-server queueing problem associated with the analysis of resequencing of packets travelling over multiple physical links to a packet-switching network. Even though a method for obtaining the exact solution exists, its processing time and memory requirements vary exponentially in terms of the number of servers and render it infeasible even for moderately-sized systems. Precision of the proposed approximatio...

Citation Formats

B. Kat and Z. M. Avşar, “Heuristics for Dynamic Scheduling of Multi-Class Base-Stock Controlled Systems,” Zakinthos, Yunanistan, 2005, p. 217 , Accessed: 00, 2021. [Online]. Available: https://hdl.handle.net/11511/70805.