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 weighted combination approach to treat the two-agent single-machine scheduling problem with two competing agents on a single machine, which provides two branch-and-bound algorithms to solve the problem and presents two genetic algorithms to obtain near-optimal solutions.
15 citations
TL;DR: The makespan minimization problem with job-dependent learning effects can be solved in O(nlog n) time by sequencing the jobs according to the shortest processing time (SPT) order if the observation that the job- dependent learning rates are correlated with the level of sophistication of the jobs is utilized.
15 citations
TL;DR: In this paper, a fast ascent direction algorithm for the Lagrangian dual problem of the single-machine scheduling problem of minimizing total weighted completion time subject to precedence constraints is proposed, which is relatively simple if a scheduling problem is formulated in terms of the job completion times rather than as an 0-1 linear program.
Abstract: We design a fast ascent direction algorithm for the Lagrangian dual problem of the single-machine scheduling problem of minimizing total weighted completion time subject to precedence constraints. We show that designing such an algorithm is relatively simple if a scheduling problem is formulated in terms of the job completion times rather than as an 0-1 linear program. Also, we show that upon termination of such an ascent direction algorithm we get a dual decomposition of the original problem, which can be exploited to develop approximative and enumerative approaches for it. Computational results exhibit that in our application the ascent direction leads to good Lagrangian lower and upper bounds.
15 citations
TL;DR: This paper reviews the problems of Boolean non-linear programming related to the half-product problem and focuses on the development of fully polynomial-time approximation schemes, especially of those with strongly polynometric time, and on their applications to various scheduling problems.
Abstract: This paper reviews the problems of Boolean non-linear programming related to the half-product problem. All problems under consideration have a similar quadratic non-separable objective function. For these problems, we focus on the development of fully polynomial-time approximation schemes, especially of those with strongly polynomial time, and on their applications to various scheduling problems.
15 citations
TL;DR: This paper proposes a scatter search algorithm which uses path relinking in its core and is enhanced with some procedures to speed-up the neighbors’ evaluation and with some diversification and intensification techniques, the latter taking some elements from iterated local search.
Abstract: Single machine scheduling problems have many real-life applications and may be hard to solve due to the particular characteristics of some production environments. In this paper, we tackle the single machine scheduling problem with sequence-dependent setup times with the objective of minimizing the weighted tardiness. To solve this problem, we propose a scatter search algorithm which uses path relinking in its core. This algorithm is enhanced with some procedures to speed-up the neighbors' evaluation and with some diversification and intensification techniques, the latter taking some elements from iterated local search. We conducted an experimental study across a well-known set of instances to analyze the contribution of each component to the overall performance of the algorithm, as well as to compare our proposal with the state-of-the-art metaheuristics, obtaining competitive results. We also propose a new benchmark with larger and more challenging instances and provide the first results for them.
15 citations