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: In this study, a two-stage stochastic-programming method is utilised for the optimal solution of the single machine scheduling problem and a Genetic Algorithm approach is proposed to solve the large-size problems approximately.
Abstract: In this study, we consider stochastic single machine scheduling problem. We assume that setup times are both sequence dependent and uncertain while processing times and due dates are deterministic....
18 citations
••
TL;DR: A lower bound of (@?LD@?+2)/(@?LD @?+1) for the case where LD>=1 and 3/2 for the cases where 0=0 is proved.
18 citations
••
TL;DR: It is shown that the makespan problem on a single machine for a set of tasks with two distinct deadlines and identical decreasing rates of processing times is NP-complete.
Abstract: The makespan problem on a single machine for a set of tasks with two distinct deadlines and identical decreasing rates of processing times is considered in this paper. Ho et al. [1] have proposed a model of a task system in which the processing time of a task decreases with its starting time. When the decreasing rate is identical, the computational complexity of the makespan problem with two distinct deadlines is posed as an open problem. In this paper we show that the problem is NP-complete. It follows that both the corresponding flow time problem and maximum lateness problem are also NP-complete.
18 citations
••
TL;DR: A semi-online algorithm is designed and it is proved that it has a competitive ratio of [email protected]^[email protected], which is shown to be the best performance achieved by any deterministic semi- online algorithm for the problem.
18 citations
••
TL;DR: This work considers single-machine scheduling and slack due-date assignment problems simultaneously with the position-dependent aging effect and deteriorating maintenance to find jointly the optimal common slack time, the optimal maintenance position, and the optimal schedule such that the sum of the total earliness, the total tardiness, the common slackTime costs is minimized.
Abstract: We consider single-machine scheduling and slack due-date assignment problems simultaneously with the position-dependent aging effect and deteriorating maintenance. In order to counteract the aging effect on the machine, we assume that at most one maintenance is allowed throughout the planning horizon and the maintenance can be performed immediately after the processing of any job is completed. The maintenance duration is dependent on its starting time. The objective is to find jointly the optimal common slack time, the optimal maintenance position, and the optimal schedule such that the sum of the total earliness, the total tardiness, and the common slack time costs is minimized. We propose polynomial time algorithms for all the problems studied.
18 citations