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: The ''Earliest Non-Idling'' property is introduced as a sufficient condition so that an algorithm solving the original problem also solves its non-idling variant and it is shown that preemptive problems do have that property.
24 citations
TL;DR: The theoretical basis of the sensitivity analysis is developed from previous work by the author and Gittins and is presented in terms of a single machine scheduling model, denoted {Rj, ρj, α, 1 ≤ j ≤ N}.
Abstract: We seek to evaluate the effect which departures from assumed parameter values have upon the performance of scheduling strategies. Most of the material is presented in terms of a single machine scheduling model, denoted {Rj, ρj, α, 1 ≤ j ≤ N}. The theoretical basis of the sensitivity analysis is developed from previous work by the author and Gittins.
24 citations
TL;DR: A heuristic method is proposed for solving the problem of sequencing jobs in a machine with programmed preventive maintenance and sequence-dependent set-up times, which hybridizes multi-start strategies with Tabu Search.
Abstract: In this paper we study a problem of sequencing jobs in a machine with programmed preventive maintenance and sequence-dependent set-up times. The problem combines two NP-hard problems, so we propose a heuristic method for solving it, which hybridizes multi-start strategies with Tabu Search. We compare our method with the only published metaheuristic algorithm for this problem on a set of 420 instances. The comparison favors the method developed in this work, showing that is able to find high quality solutions in very short computational times.
24 citations
01 Jan 1996
TL;DR: This paper discusses how Dantzig Wolfe decomposition techniques can be applied to alleviate the di culties associated with the size of time indexed formulations and that the application of these techniques still allows the use of cut generation techniques.
Abstract: Time indexed formulations for single machine scheduling problems have received a lot of attention because the linear program relaxations provide strong bounds Unfortunately time indexed formulations have one major disadvantage their size Even for relatively small instances the number of constraints and the number of variables can be large In this paper we discuss how Dantzig Wolfe decomposition techniques can be applied to alleviate the di culties associated with the size of time indexed formulations and that the application of these techniques still allows the use of cut generation techniques
24 citations
TL;DR: Several theoretical results which can be ranked in a series of similar investigations of NP-hardness of equal-processing-time single-machine scheduling problems without precedence relations are obtained.
24 citations