Topic
Single-machine scheduling
About: Single-machine scheduling is a research topic. Over the lifetime, 2473 publications have been published within this topic receiving 56288 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: A case study is described in this paper, in which the scheduling was carried out without the determination of the main cost factors, namely, the set up costs of the machine and the inventory holding cost of the product.
Abstract: The multi-product single machine scheduling problem is not new in the literature. The usual method of solution offered consists of determining the Economic Batch Quantities (EBQ) and then finding an acceptable way of scheduling these quantities on the single facility. However, past experience shows that EBQs cannot be scheduled in the same solution because of some limitations, mostly when a product produced earlier has run out of stock. Eventually, an acceptable batch quantity has to be selected that will satisfy a set of given conditions or objectives. Before calculating the EBQ, it is generally necessary to determine the main cost factors, namely, the set up cost of the machine and the inventory holding cost of the product. A case study is described in this paper, in which the scheduling was carried out without the determination of these costs. However, deviations from this solution may have to be considered. A simple way of calculating the costs incurred by such deviations is described.
20 citations
TL;DR: In this article, the bivariate characterization of stochastic ordering relations given by Shanthikumar and Yao (1991) is based on collections of bivariate functions, where g(x, y) and g(y, x) satisfy certain properties.
Abstract: The bivariate characterization of stochastic ordering relations given by Shanthikumar and Yao (1991) is based on collections of bivariate functions g(x, y), where g(x, y) and g(y, x) satisfy certain properties. We give an alternate characterization based on collections of pairs of bivariate functions, g 1(x, y) and g 2(x, y), satisfying certain properties. This characterization allows us to extend results for single machine scheduling of jobs that are identical except for their processing times, to jobs that may have different costs associated with them.
20 citations
TL;DR: This paper proved that the weighted smallest basic processing time first (WSPT) rule and the earliest due date first (EDD) rule constructed the optimal sequence under some special cases, respectively.
20 citations
TL;DR: It is proved that the problem is NP-hard, even if the length of the operator non-availability period is smaller than the processing time of any job, and an algorithm with a tight worst-case ratio is presented.
20 citations
TL;DR: This article has derived two dominance criteria and used them in the development of a new pseudopolynomial algorithm, an implicit enumeration scheme based on a binary branching strategy, which is superior to those of De, Ghosh and Wells and Kubiak in terms of computational complexity.
20 citations