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 O(n log n) time algorithm is given to solve the scheduling problem with deteriorating jobs, that is, jobs whose processing times are an increasing function of their start times.
Abstract: We study a scheduling problem with deteriorating jobs, that is, jobs whose processing times are an increasing function of their start times. We consider the case of a single machine and linear job-independent deterioration. The problem is to determine an optimal combination of the due-date and schedule so as to minimize the sum of due-date, earliness and tardiness penalties. We give an O(n log n) time algorithm to solve this problem.
83 citations
TL;DR: This work considers various single machine scheduling problems in which the processing time of a job depends either on its position in a processing sequence or on its start time, and shows that the objective function is priority-generating and therefore the corresponding scheduling problem under series-parallel precedence constraints is polynomially solvable.
Abstract: We consider various single machine scheduling problems in which the processing time of a job depends either on its position in a processing sequence or on its start time. We focus on problems of minimizing the makespan or the sum of (weighted) completion times of the jobs. In many situations we show that the objective function is priority-generating, and therefore the corresponding scheduling problem under series-parallel precedence constraints is polynomially solvable. In other situations we provide counter-examples that show that the objective function is not priority-generating.
82 citations
TL;DR: Algorithmic and computational complexity results for several single machine scheduling problems where some job characteristics are uncertain are presented, using the so-called absolute robustness criterion to select among feasible solutions.
82 citations
TL;DR: A branch-and-bound algorithm (B&B) is developed to obtain optimal solutions for the single-machine early/tardy scheduling problem and solved problems three times larger than what has been reported in the literature.
82 citations
TL;DR: In this paper, it was shown that the bicriteria single-machine scheduling problem of minimizing total completion time and maximum cost simultaneously is solvable in polynomial time.
82 citations