We consider single machine batching and scheduling problem in which the processing time of each job is known, but the setup time is a random variable from the distribution with an unknown parameter. Batch sizes are determined sequentially, that is, the size and jobs of the first batch are determined by using the prior knowledge and observed the value of a setup time, then the size and jobs of t...

The same kind of n jobs are processed one by one sequentially by a single machine and any number k of them may be processed as a batch. A setup time is necessary before the processing of the first job in a batch. The completion times of all the jobs in a batch are the same as the completion time of the last job in the batch and the processing time of the batch is the sum of a setup time and k t...

this paper considers the economic lot scheduling problem, that is, the problem of scheduling several products on a single facility so as to minimize holding and setup costs. combination of frequency and timing as well as production quantity make this problem np-hard. a heuristic is developed to obtain a good solution to elsp. the proposed heuristic makes use of the simulated annealing technique...

This paper proposes a novel disruptive innovation-like algorithm (DILA) for the problem of scheduling single machine with sequence-dependent family setup times to minimize total tardiness. The proposed is derived from Christensen’s (1997) theory innovation. Based on this theory, DILA proposed, which first generates two initial populations: mainstream market population and emerging population. T...

This paper presents a branch-and-bound (B&B) algorithm for minimizing the sum of completion times in a singlemachine scheduling setting with sequence-dependent family setup times. The main feature of the B&B algorithm is a new lower bounding scheme that is based on a network formulation of the problem. With extensive computational tests, we demonstrate that the B&B algorithm can solve problems ...

A possible explanation for the frequent occurrence of power-law distributions in biology and elsewhere comes from an analysis of the interplay between random time evolution and random observation or killing time. If the system population or its topological parameters grow exponentially with time, and observations on the system correspond to stopping the evolution at an exponentially distributed...

We study the problem of optimally controlling the use of sleep states in an energy-aware M/G/1 queue. In our model, we consider a family of policies where the server upon becoming idle can wait for a random period before entering, potentially randomly, any of a finite number of possible sleep states to save energy. The server becomes busy again after a possibly random number of jobs have arrive...

In this paper we consider the problem of scheduling jobs on parallel machines with setup times. The setup has to be performed by a single server. The objective is to minimize the schedule length (makespan) as well as the forced idle time. The makespan problem is known to be NP -hard even for the case of two identical parallel machines. This paper presents a pseudopolynomial algorithm for the ca...