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: Experimental results show that the robust sequences perform better than nominal sequences, especially when the due dates are relatively loose, and this is the first time in the relevant literature that a DRO approach is adopted to minimize the total tardiness criterion for machine scheduling.
25 citations
TL;DR: This paper reviews two problems of Boolean non-linear programming: the Symmetric Quadratic Knapsack Problem and the Half-Product Problem, and focuses on the development of fully polynomial-time approximation schemes.
Abstract: This paper reviews two problems of Boolean non-linear programming: the Symmetric Quadratic Knapsack Problem and the Half-Product Problem. The problems are related since they have a similar quadratic non-separable objective function. For these problems, we focus on the development of fully polynomial-time approximation schemes, especially of those with strongly polynomial time, and on their applications to various scheduling problems.
25 citations
TL;DR: In this article, the authors consider the problem of minimizing the total tardiness of a job set while keeping the number of tardy jobs to its minimum value, and present a simple algorithm to obtain an optimal sequence when the set of Tardy jobs is specified.
Abstract: We consider the scheduling problem to minimize the total tardiness of a job set keeping the number of tardy jobs to its minimum value. A simple algorithm is presented to obtain an optimal sequence when the set of tardy jobs is specified. A set of properties is presented that explores the structure induced by the minimum number of tardy jobs requirement. The general problem is solved optimally by employing an efficient Branch & Bound (B&B) search that takes advantage of the theory developed. We identify special cases where the Moore-Hodgson algorithm can be applied to find the optimal tardy job set. Computational experiments show that the B&B algorithm solves relatively large instances in just a few seconds, on a personal computer.
25 citations
TL;DR: A genetic approach based on a random key alphabet and several algorithms based on this approach that incorporates all the considered features is the new heuristic of choice for small and medium size instances.
Abstract: In this paper, we consider the single machine scheduling problem with quadratic earliness and tardiness costs, and no machine idle time. We propose a genetic approach based on a random key alphabet and present several algorithms based on this approach. These versions differ on the generation of both the initial population and the individuals added in the migration step, as well as on the use of local search. The proposed procedures are compared with the best existing heuristics, as well as with optimal solutions for the smaller instance sizes. The computational results show that the proposed algorithms clearly outperform the existing procedures and are quite close to the optimum. The improvement over the existing heuristics increases with both the difficulty and the size of the instances. The performance of the proposed genetic approach is improved by the initialization of the initial population, the generation of greedy randomized solutions, and the addition of the local search procedure. Indeed, the more sophisticated versions can obtain similar or better solutions and are much faster. The genetic version that incorporates all the considered features is the new heuristic of choice for small and medium size instances.
25 citations
TL;DR: The effectiveness of the algorithm is evaluated and it is shown that in many cases the algorithm picks an optimal order.
24 citations