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 combination of earliness and flowtime is used to represent total inventory costs in this paper, and some preliminary results are presented illustrating the complexity of solving this problem.
21 citations
TL;DR: In this paper, the authors show how a sequential irrigation schedule for a tertiary unit can be interpreted as a single machine scheduling problem with earliness, tardiness, and a common deadline.
Abstract: This paper shows how a sequential irrigation schedule for a tertiary unit can be interpreted as a single machine scheduling problem with earliness, tardiness, and a common deadline. An integer program solution is presented for this irrigation scheduling problem. Two different models are presented to reflect different management options at the tertiary level. The first model allows jobs to be scheduled noncontiguously. In the second model only contiguous jobs are allowed. The second model has three submodels reflecting the various ways in which contiguous jobs can be scheduled over a fixed interval. Earlier work in determining unit costs of earliness/tardiness is reviewed and an alternative improved method is suggested. The models presented in this paper are applied to a tertiary unit with 16 users, both as a single interval and multi-interval irrigation scheduling problem. An alternative integer program is also presented which although computationally more efficient can only be used for single period scheduling problems. The models developed in this paper can be used to solve small scheduling problems and also to calibrate the heuristics as presented in the companion paper.
21 citations
TL;DR: This paper aims to find the optimal location of the maintenance activity and the optimal job sequence for minimizing the makespan as well as the total completion time and develops polynomial time solutions for all the studied problems.
Abstract: This paper investigates single-machine scheduling problems with the aging or deteriorating effect under an optional maintenance activity consideration. We assume that the maintenance duration depends on its starting time. We aim to find the optimal location of the maintenance activity and the optimal job sequence for minimizing the makespan as well as the total completion time. We develop polynomial time solutions for all the studied problems. We also discuss some special cases and show that they can be optimally solved by lower order algorithms.
21 citations
TL;DR: The computational results demonstrate the efficiency of the approach for solving ALP, which can simultaneously improve punctual performance, enhance runway utilization, reduce air traffic controller workload, and maintain equity among airlines.
21 citations
TL;DR: A new polynomial-time heuristic is proposed based on a number of necessary conditions for a schedule to minimize mean flow time, and its performance is compared with some existing heuristics.
Abstract: This paper examines the problem of scheduling jobs on a single machine with set-up times. The jobs are divided into mutually exclusive classes and a set-up task is required when processing switches from a job of one class to a job of another class. The set-up times are assumed to be sequence independent. A number of necessary conditions for a schedule to minimize mean flow time have previously been stated, but do not uniquely define the optimal solution, and the problem is apparently NP-complete. We propose a new polynomial-time heuristic, based on these conditions, and compare its performance with some existing heuristics.
20 citations