Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/ F

Authors:
Walter H. Kohler;Kenneth Steiglitz
Affiliations:
Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA;Department of Electrical Engineering, Princeton University, Princeton, NJ
Venue:
Journal of the ACM (JACM)
Year:
1975

Citing 3
Cited 7

An Approach to Solving Linear Discrete Optimization Problems

Journal of the ACM (JACM)
Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems

Journal of the ACM (JACM)
Exact and approximate algorithms for permutation problems

Exact and approximate algorithms for permutation problems

The Power of Dominance Relations in Branch-and-Bound Algorithms

Journal of the ACM (JACM)
Lower bounds for minimizing total completion time in a two-machine flow shop

Journal of Scheduling
Practical Multiprocessor Scheduling Algorithms for Efficient Parallel Processing

IEEE Transactions on Computers
A Preliminary Evaluation of the Critical Path Method for Scheduling Tasks on Multiprocessor Systems

IEEE Transactions on Computers
Worst case analysis of a new lower bound for flow shop weighted completion time problem

COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
A two-machine flowshop problem with two agents

Computers and Operations Research
Two-machine flowshop scheduling with truncated learning to minimize the total completion time

Computers and Industrial Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract