Journal ArticleDOI
Single-Machine Scheduling with Release Times and Tails
Reads0
Chats0
TLDR
An O(n2 log nlog P) algorithm is suggested for the case when the processing times of some jobs are restricted to either P or 2P.Abstract:
We study the problem of scheduling jobs with release times and tails on a single machine with the objective to minimize the makespan. This problem is strongly NP-hard, however it is known to be polynomially solvable if all jobs have equal processing time P. We generalize this result and suggest an O(n2 log nlog P) algorithm for the case when the processing times of some jobs are restricted to either P or 2P.read more
Citations
More filters
Journal ArticleDOI
Dynamic yard crane dispatching in container terminals with predicted vehicle arrival information
TL;DR: Two new algorithms to efficiently compute YC dispatching sequences that are provably optimal within the planning window are presented and are able to find within seconds optimal solutions for heavy workload scenarios with over 2.4x10^1^8 possible dispatches.
Journal ArticleDOI
Minimizing maximum lateness of jobs with naturally bounded job data on a single machine in polynomial time
Nodari Vakhania,Frank Werner +1 more
TL;DR: A polynomial-time solution of the version of the problem of scheduling jobs with given release times and due dates on a single machine in which the maximal job processing time and the differences between the job release times are bounded by a constant.
Journal ArticleDOI
A simulated annealing approach to minimize the maximum lateness on uniform parallel machines
TL;DR: This paper proposes a simulated annealing algorithm, named LPDT-SA, to obtain solutions with high quality for large-sized problems, which is efficient to realize the swap and insertion neighborhood, and simultaneously avoid some obvious inferior solutions.
Journal ArticleDOI
Branch less, cut more and minimize the number of late equal-length jobs on identical machines
TL;DR: The 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.
Journal ArticleDOI
Jackson's semi-preemptive scheduling on a single machine
Anis Gharbi,Mohamed Labidi +1 more
TL;DR: This work proposes an effective improvement of the well-known Jackson's preemptive schedule lower bound for the single machine scheduling problem with heads and tails, and reveals that suitably embedding the procedure within Carlier's algorithm makes feasible to solve all of the hard instances which could not be solved by its original variant.
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Journal ArticleDOI
The one-machine sequencing problem
TL;DR: In this article, the Schrage tree search problem has been shown to be NP-hard in the strong sense, and it is shown that the difference between the optimum and Schrage schedule is less than d 1.
Journal ArticleDOI
On Scheduling with Ready Times and Due Dates to Minimize Maximum Lateness
Graham McMahon,Michael Florian +1 more
TL;DR: An algorithm is developed for sequencing jobs on a single processor in order to minimize maximum lateness, subject to ready times and due dates, that has the unusual feature that a complete solution is associated with each node of the enumeration tree.