Journal ArticleDOI
Lower bounds for single‐machine scheduling problems
Reza Ahmadi,Uttarayan Bagchi +1 more
Reads0
Chats0
TLDR
The article compares six available lower bounds in the literature and shows that the lower bound based on the optimal solution to the preemptive version of the problem is the dominant lower bound.Abstract:
This article addresses deterministic, nonpreemptive scheduling of n jobs with unequal release times on a single machine to minimize the sum of job completion times. This problem is known to be NP-hard. The article compares six available lower bounds in the literature and shows that the lower bound based on the optimal solution to the preemptive version of the problem is the dominant lower bound.read more
Citations
More filters
Book ChapterDOI
A Review of Machine Scheduling: Complexity, Algorithms and Approximability
TL;DR: This work focuses on deterministic machine scheduling for which it is assumed that all data that define a problem instance are known with certainty.
Journal ArticleDOI
A branch‐and‐bound algorithm to minimize total flow time with unequal release dates
Proceedings ArticleDOI
Approximability and nonapproximability results for minimizing total flow time on a single machine
TL;DR: In this article, the authors present a polynomial-time approximation algorithm with a sublinear worst-case performance guarantee of O(n 1/2- √ n ) for any constant √ 0.
Journal ArticleDOI
Approximability and Nonapproximability Results for Minimizing Total Flow Time on a Single Machine
TL;DR: The positive result is the first approximation algorithm with a sublinear worst-case performance guarantee of $O(\sqrt{n})$ and the negative result demonstrates that unless P=NP, no polynomial-time approximation algorithm for minimum total flow time can have a worst- case performance guarantees of O(n) for any $\eps>0$.
Journal ArticleDOI
A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem
F. Della Croce,Vincent t'Kindt +1 more
TL;DR: A polynomial time heuristic algorithm is proposed which applies the recently introduced Recovering Beam Search (RBS) approach and it is shown that the total number of considered nodes is bounded by n where n is the jobsize.
References
More filters
Book
Introduction to sequencing and scheduling
TL;DR: In this article, the authors present an introduction to Sequencing and Scheduling in the context of the Operational Research Society (ORS) and the International Journal of Distributed Sensor Networks (ILS).
Book ChapterDOI
Complexity of machine scheduling problems
TL;DR: In this paper, the authors survey and extend the results on the complexity of machine scheduling problems and give a classification of scheduling problems on single, different and identical machines and study the influence of various parameters on their complexity.
Journal ArticleDOI
An algorithm for single machine sequencing with release dates to minimize total weighted completion time
A. M. A. Hariri,Chris N. Potts +1 more
TL;DR: The computational results indicate that the version of the lower bound using improved constraints is superior to the original version, which includes several dominance rules, and is tested on problems with up to fifty jobs.
Journal ArticleDOI
Scheduling of a single machine to minimize total weighted completion time subject to release dates
TL;DR: Some dominance sufficient conditions among sequences are obtained and a branch and bound algorithm is proposed to solve the n/1/rj ΣjwjCj problem under the assumptions of nonpreemptive sequencing and sequence independent processing times.