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: An attempt has been made to develop a simple heuristic to minimize the total tardiness in a single machine scheduling problem with n independent jobs, each having its processing time and due date.
Abstract: This paper discusses a simple heuristic to minimize the total tardiness in a single machine scheduling problem. The problem of minimizing total tardiness in single machine scheduling is a combinatorial problem. Hence, heuristic development for such problems is inevitable. In this paper, an attempt has been made to develop a simple heuristic, alternatively called greedy heuristic, to minimize the total tardiness in a single machine scheduling problem with n independent jobs, each having its processing time and due date. Further, its solution accuracy is compared with the optimal solution of a set of randomly generated problems using an ANOVA experiment. From the ANOVA experiment, it is observed that the solution of the simple heuristic proposed in this paper does not differ significantly from the optimal solution at a significance level of 0.05.
29 citations
01 Jan 2005
TL;DR: A survey and a uniform presentation of several approximation results for single machine scheduling with total weighted completion time objective from the last years which rely on the concept of α-points.
Abstract: Many approximation results for single machine scheduling problems rely on the conversion of preemptive schedules into (preemptive or non-preemptive) solutions. The initial preemptive schedule is usually an optimal solution to a combinatorial relaxation or a linear programming relaxation of the scheduling problem under consideration. It therefore provides a lower bound on the optimal objective function value. However, it also contains structural information which is useful for the construction of provably good feasible schedules. In this context, list scheduling in order of so-called α-points has evolved as an important and successful tool. We give a survey and a uniform presentation of several approximation results for single machine scheduling with total weighted completion time objective from the last years which rely on the concept of α-points.
29 citations
18 Oct 2008
TL;DR: A survey of multi-objective scheduling models that have appeared in the literature or are to appear is given and the comprehensive review of recent study on them is summarized.
Abstract: In this paper we give a survey of multi-objective scheduling that have appeared in the literature or are to appear. Firstly, some basic concepts about multi-objective optimization and prevalent approaches for multi-objective optimization are given. Then, several multi-objective scheduling models are introduced and the comprehensive review of recent study on them is summarized. Finally, the trend of multi-objective scheduling are discussed.
29 citations
TL;DR: This paper addresses the problem of scheduling jobs on a single machine with cyclical machine availability periods, and proposes new approximate solution procedures for the problem, similar to the classical bin packing problem.
29 citations
TL;DR: This paper addresses single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times and shows that the problem under the model where the two criteria are integrated into a single criterion is polynomially solvable.
Abstract: This paper addresses single-machine scheduling and due-window assignment with common flow allowances and resource-dependent processing times. Due-window assignment with common flow allowances means...
29 citations