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: This work gives efficient algorithms to find a feasible schedule, if any, which minimizes the final completion time under the assumption such that for r"i > r"j, d"i >= d"j.
273 citations
TL;DR: This study introduces a time-dependent learning effect into a single-machine scheduling problem and shows that it remains polynomially solvable for the objective, i.e., minimizing the total completion time on a single machine.
252 citations
TL;DR: Strong NP-hardness of the makespan minimization problem for two different models of job processing time is proved for makespan, total completion time and total weighted completion time.
Abstract: The paper is devoted to some single machine scheduling problems, where job processing times are defined by functions dependent on their positions in the sequence. It is assumed that each job is available for processing at its ready time. We prove some properties of the special cases of the problems for the following optimization criteria: makespan, total completion time and total weighted completion time. We prove strong NP-hardness of the makespan minimization problem for two different models of job processing time. The reductions are done from the well-known 3-Partition Problem. In order to solve the makespan minimization problems, we suggest the Earliest Ready Date algorithms, for which the worst-case ratios are calculated. We also prove that the makespan minimization problem with job ready times is equivalent to the maximum lateness minimization problem.
242 citations
01 Jan 2002
TL;DR: A general framework for using real time information to improve scheduling decisions is developed, which allows us to trade off the quality of the revised schedule against the production disturbance which results from changing the planned schedule.
Abstract: In many production processes real time information may be obtained from process control computers and other monitoring systems, but most existing scheduling models are unable to use this information to effectively influence scheduling decisions in real time. In this paper we develop a general framework for using real time information to improve scheduling decisions, which allows us to trade off the quality of the revised schedule against the production disturbance which results from changing the planned schedule. We illustrate how our framework can be used to select a strategy for using real time information for a single machine scheduling model and discuss how it may be used to incorporate real time information into scheduling the complex production processes of steel continuous caster planning. 2002 Elsevier Science B.V. All rights reserved.
237 citations
TL;DR: In this paper, a general framework for using real-time information to improve scheduling decisions is developed, which allows us to trade off the quality of the revised schedule against the production disturbance which results from changing the planned schedule.
226 citations