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 0–1 quadratic programming formulation of this problem, in which the processing time is a binary function of a common start time due date, and the objective is to minimize the sum of the weighted completion times.
106 citations
TL;DR: It is shown that the schedule produced by the largest growth rate rule is unbounded for the model, although it is an optimal solution for the scheduling problem with deteriorating jobs and no learning.
105 citations
TL;DR: The purpose here is to simultaneously sequence jobs and schedule maintenance activity to optimize regular performance measures and study problems with objective functions such as expected makespan, total expected completion time, maximum expected lateness, and expected maximum lateness.
105 citations
TL;DR: Several examples of one‐machine problems in which the minimization of expected cost subject to stochastic breakdowns of the machine can be successfully attacked analytically are provided.
Abstract: We provide several examples of one-machine problems in which the minimization of expected cost subject to stochastic breakdowns of the machine can be successfully attacked analytically. In particular for the weighted flow-time model, we derive strong bounds on the difference between the optimal static policy and the WSPT policy and discuss an example in which the WSPT policy is not optimal.
104 citations
TL;DR: A single-machine scheduling problem with power-down mechanism to minimize both total energy consumption and maximum tardiness and a basic e − constraint method is proposed to obtain the complete Pareto front of the problem.
104 citations