We consider optimal scheduling of the server in a finite-population queueing system with multiple classes of customers, when preemption is allowed. A customer of class i has arrival rate i , service rate i , and holding cost ci per unit time. We derive conditions under which the c rule is optimal. © 2004 Elsevier B.V. All rights reserved.

This paper considers the two-stage flexible flowshop scheduling problem with availability constraints. We discuss the complexity and the approximability of the problem, and provide some approximation algorithms with finite and tight worst case performance bounds for some special cases of the problem.

preventive maintenance scheduling is to perform a series of tasks that prevents or minimizes production breakdowns and improves the reliability. mathematical models have been developed to solve the preventive maintenance scheduling problem. there are several limitations in the prior work in this area of research. craft combinations are assumed to be given. the craft combination problem concerns...

We consider games played on finite colored graphs for an infinite number of rounds, whose goal is to visit all colors with the same asymptotic frequency. Such games may represent scheduling problems with special fairness constraints. We show that the main corresponding decision problems are Co-NP-

This short paper introduces a code snippet in the form of an R function that enumerates all possible partitions of a finite set given the sizes of the equivalence classes. Three combinatorial problems are solved using the software: one from bioinformatics, one from scheduling theory, and one from forensic science.

This paper provides an introduction to Finite-domain Constraint Logic Programming (CLP) and its application to problems in scheduling and planning. We cover the fundamentals of CLP and indicate recent developments and trends in the eld. Some current limitations are identiied, and areas of research that may contribute to addressing these limitations are suggested.

Adaptive sensor management (scheduling) is usually formulated as a finite horizon POMDP and implemented using sequential Monte Carlo. In Monte Carlo, variance reduction is important for the reliable performance of the sensor scheduler. In this paper, we propose a Control Variate method for variance reduction when the sensor is scheduled using the Kullbach Leibler criterion.

extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...

Reed-Solomon (RS) codecs are used for error control coding in many applications such as digital audio, digital TV, software radio, CD players, and wireless and satellite communications. This paper considers software-based implementation of RS codecs where special instructions are assumed to be used to program finite field multiplication datapaths inside a domain-specific programmable digital-si...

The production costs reduction in a highly competitive environment is a critical success factor. In particular, in fields where outsourcing is used frequently and the impact of the material costs is high, a significant cost reduction can be achieved making more efficient value chain. Moreover, the use of outsourcing is a way to adjust production capacity depending on demand. Therefore the coord...