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 tabu search-based solution procedure designed specifically for a certain class of single-machine scheduling problems with a non-regular performance measure is developed and found to perform better than the simulated annealing approach for the variance minimization problem.
54 citations
TL;DR: The computational complexity of single machine scheduling subject to inventory constraints is determined for all special cases and for several special cases when the objective is either to minimize total weighted completion time or to minimize the number of tardy jobs.
54 citations
TL;DR: A new model of joint start-time dependent learning and position dependent aging effects into single-machine scheduling problems and it is shown that all the studied problems can be optimally solved by polynomial time algorithms.
54 citations
TL;DR: This study introduces a new deterioration model where the actual processing time of a job depends not only on the starting time of the job but also on its scheduled position, and shows that both problems are solvable in O(n log n) time.
Abstract: In many real-life scheduling situations, the jobs deteriorate at a certain rate while waiting to be processed. This study introduces a new deterioration model where the actual processing time of a job depends not only on the starting time of the job but also on its scheduled position. The objective is to find the optimal schedule such that the makespan or total completion time is minimised. This study first shows that both problems are solvable in On log n time. This study further shows that in both cases there exists an optimal schedule that is the shortest processing time, longest processing time, or V-shaped with respect to the job normal processing times, depending on the relationships between problem parameters.
54 citations
TL;DR: This work proposes to use dynamic programming in the process of obtaining new generation solutions in the genetic algorithm, and calls it a genetic DP algorithm, to evaluate the effectiveness of this approach to deal with computationally hard problems.
54 citations