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
••
15 Feb 2011TL;DR: Four basic problems and their solution methods are described: total weighted completion time, maximum of nondecreasing cost functions, weighted number of tardy jobs, and total weighted tardiness.
Abstract: The single machine scheduling problem is foundational to the study of production scheduling in general. This article describes four basic problems and their solution methods: total weighted completion time, maximum of nondecreasing cost functions (which includes the maximum lateness problem and the problem with precedence constraints), weighted number of tardy jobs, and total weighted tardiness. Additional problems considered include those with both earliness and tardiness penalties, and those with release dates and preemptions.
Keywords:
single machine scheduling;
weighted completion time;
maximum lateness;
total tardiness;
number of tardy jobs;
release dates;
preemption;
regular measures
23 citations
••
TL;DR: It is shown that the single machine scheduling problem with rejection is W[1]-hard for the first parameter, while it is fixed-parameterized tractable for all other parameters.
23 citations
••
TL;DR: In this paper, a branch-and-bound based algorithm was proposed to solve the single machine scheduling problem with the constraints of prespecified ready and due times and the assumption of sequence-dependent setup times.
23 citations
••
TL;DR: In this article, the problem of scheduling a set of n jobs on a single machine to minimize weighted absolute deviation of completion times from a common due date is studied. But it is assumed that weights of jobs are proportional to their processing times, and it is shown that the problem can be solved efficiently for a sufficiently large due date.
23 citations
••
TL;DR: This work considers the problem of schedulingn jobs without preemption on a single machine to maximize total profit, where profit is given by a nonincreasing, concave separable function of job starting times and gives a heuristic in which jobs are sequenced optimally relative to a specific linear approximation of the profit, function.
Abstract: We consider the problem of schedulingn jobs without preemption on a single machine to maximize total profit, where profit is given by a nonincreasing, concave separable function of job starting times. A heuristic is given in which jobs are sequenced optimally relative to a specific linear approximation of the profit, function. This heuristic always obtains at least 2/3 of the optimal profit, and examples exist where the heuristic obtains only 2/3 of the optimal profit. A large class of alternative linearizations is considrred and shown to give arbitrarily bad results.
23 citations