This paper studies the inventory of cash as a renewable resource in single machine scheduling problem. The status is incorporated to objective function. Average and minimum available maximum average deficiency are contemplated subject worst-case scenario that for each job cost [price] paid [received] entirely at start [end] processing job. For objective, either proof NP-Hardness or optimal rule...

Many real-world scheduling problems are subject to change, and scheduling solutions should be robust to those changes. We consider a single-machine scheduling problem where the processing time of each activity is characterized by a normally-distributed random variable, and we attempt to minimize flowtime. We develop an initial constraint model for generating the β-robust schedule the schedule t...

In this paper we survey recent results on the precedence constraint single machine scheduling problem to minimize the weighted sum of completion times. We show how we can benefit from known results in dimension theory of partial orders to obtain improved approximate solutions when precedence constraints have low fractional dimension. We believe that dimension theory of partial orders could be o...

We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation algorithms is considered one of the ten most prominent open problems in scheduling theory. Recently, research has focused on special cases of the problem, mostly by restricting the set of precedence constraints to special classe...

Many scheduling dispatching rules are intuitive and processes which people utilize in every day life. As an example, when faced with a variety of tasks due at different times one often implements the earliest due date scheduling rule: the next task worked on is the one with the earliest due date. Other common scheduling dispatching rules have the nice property of being easy to understand, there...

We study the single machine scheduling problem with controllable job processing times to minimize a linear combination of the total weighted job completion time and the total weighted processing time compression. We show that this scheduling problem is a positive half-product minimization problem. Positive half-products make up an interesting subclass of half-products and are introduced in this...

In this paper we present a set of benchmark instances and a benchmark instance generator for a single-machine scheduling problem known as the weighted tardiness scheduling problem with sequence-dependent setups. Furthermore, we argue that it is an ideal benchmark problem for soft computing in that it is computationally hard and does not lend itself well to exact solution procedures. Additionall...

We prove that the bicriteria single-machine scheduling problem of minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Our result settles a long-standing open problem.

This paper examines how setups, due-dates and the mix of standardized and customized products affect the scheduling of a single machine operating in a dynamic and stochastic environment. We restrict ourseh'es to the class of d}'namic cyclic policies, where the machine busy/idle policy and lot-sizing decisions are controlled in a dynamic fashion, but different products must be produced in a fixe...

In a real manufacturing system, a machine may need multiple maintenance activities to improve its production efficiency due to the effects of aging or deteriorating. This paper considers scheduling with aging or deteriorating effects and deteriorating maintenance activities simultaneously on a single machine. We assume that the machine may be subject to several maintenance activities during the...