Branch less, cut more and minimize the number of late equal-length jobs on identical machines

Authors:
Nodari Vakhania
Affiliations:
-
Venue:
Theoretical Computer Science
Year:
2012

Citing 5
Cited 2

On the complexity of minimizing the number of late jobs in unit time open shop

Discrete Applied Mathematics
A better algorithm for sequencing with release and delivery times on identical machines

Journal of Algorithms
A Note on Scheduling Equal-Length Jobs to Maximize Throughput

Journal of Scheduling
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the 'tower of sets' property

Mathematical and Computer Modelling: An International Journal
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs

Operations Research Letters

A study of single-machine scheduling problem to maximize throughput

Journal of Scheduling
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time

Theoretical Computer Science

Quantified Score

Hi-index	5.23

Visualization

Abstract

A simple greedy-type solution for a discrete optimization problem does not guarantee the optimality if the problem is sufficiently complicated. Dynamic programming is then a commonly used method, and a direct combinatorial algorithm is its reasonable alternative. Here we propose such an algorithm with some specific features, called branch less and cut more, abbreviated blesscmore. A blesscmore algorithm, like a branch-and-bound algorithm uses a solution tree whereas the branching and cutting criteria are based on the analysis of the so-called behavior alternatives. Our O(n^3logn) blesscmore algorithm solves an earlier open problem of scheduling n equal-length jobs with release times and due-dates on a group of identical machines to minimize the number of late jobs.