Journal ArticleDOI
The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions
TLDR
This note contains an 0(n log n) time-bounded implementation and extentions for a procedure developed by Sidney for the two-machine maximum flow time problem with series-parallel precedence constraints.Abstract:
This note contains an 0(n log n) time-bounded implementation and extentions for a procedure developed by Sidney for the two-machine maximum flow time problem with series-parallel precedence constraints.read more
Citations
More filters
Sequencing and scheduling: algorithms and complexity
TL;DR: This survey focuses on the area of deterministic machine scheduling, and reviews complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops.
Journal ArticleDOI
A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
TL;DR: Several well-documented applications of no-wait and blocking scheduling models are described and some ways in which the increasing use of modern manufacturing methods gives rise to other applications are illustrated.
Book ChapterDOI
Chapter 9 Sequencing and scheduling: Algorithms and complexity
TL;DR: Different types of sequencing and scheduling problems are discussed, and different types of algorithms and the concepts of complexity theory are described.
Journal ArticleDOI
Sequencing with Series-Parallel Precedence Constraints
Clyde L. Monma,Jeffrey B. Sidney +1 more
TL;DR: A natural subclass of problems for which a total preference ordering of the jobs exists for all subsequences of jobs is considered, and an efficient general algorithm is found for these sequencing problems with series-parallel precedence constraints.
Journal ArticleDOI
Minimizing the makespan in a two-machine cross-docking flow shop problem
Feng Chen,Chung Yee Lee +1 more
TL;DR: A branch-and-bound algorithm is constructed that can optimally solve problems with up to 60 jobs within a reasonable amount of time and is developed with an error-bound analysis.
References
More filters
Book ChapterDOI
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
Proceedings ArticleDOI
The complexity of theorem-proving procedures
TL;DR: It is shown that any recognition problem solved by a polynomial time-bounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology.
Journal ArticleDOI
Optimal two- and three-stage production schedules with setup times included
TL;DR: A simple decision rule is obtained in this paper for the optimal scheduling of the production so that the total elapsed time is a minimum.
Journal ArticleDOI
On the Computational Complexity of Combinatorial Problems
TL;DR: A large class of classical combinatorial problems, including most of the difficult problems in the literature of network flows and computational graph theory, are shown to be equivalent, in the sense that either all or none of them can be solved in polynomial time.
Book ChapterDOI
Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
TL;DR: In this paper, it was shown that the problem is NP-complete if there are arbitrary precedence constraints, but can be solved in O( n log n ) time if precedence constraints are series parallel.