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

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

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

Full text

Pdf (622 KB)

Source

Journal of the ACM (JACM) archive
Volume 22 , Issue 1 (January 1975) table of contents

Pages: 106 - 114

Year of Publication: 1975

ISSN:0004-5411

Authors

Walter H. Kohler	Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, MA
Kenneth Steiglitz	Department of Electrical Engineering, Princeton University, Princeton, NJ

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 23, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/321864.321872 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	ASHOUR, S. An experimental ~nvestlgaUon and comparative evaluation of flow-shop scheduling techmques Oper Res 18, 3 (May-June 1970), 541-549
	2	CONWAY, R. W., MAXWELL, W L, ANn MILLER, L W. Theory of Scheduling. Addison-Wesley, Reading, Mass., 1967
	3	DAY, J E, AND HOTTENSTEIN, M P Rewew of sequencing research. Naval Res Logistics Quart 17, 1 (March 1970), 11-40
	4	ELMA~HRABY, S E The machine sequencing problem-review and extensions Naval Res Logzst~cs Quart 15, 2 (June 1968), 205-232.
	5	GUPT&, J N.D. Economic aspects of production scheduhng systems J. Oper Res 8oc Japan 18, 4 (March 1971), 169-193
	6	I~NXLL, E., AND SCHRAGE, L Apphcation of the branch and bound technique to some flow-shop sequencing problems Oper. Res 18, 3 (May-June 1965), 4(D-412.
	7	Walter Henry Kohler, Jr., Exact and approximate algorithms for permutation problems, 1972
	8	Walter H. Kohler , Kenneth Steiglitz, Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation Problems, Journal of the ACM (JACM), v.21 n.1, p.140-156, Jan. 1974 [doi>10.1145/321796.321808]
	9	KRON~, M., AND Sr~I~LITZ, K. Heuristic programming solution of a flowshop scheduling problem. Oper. Res. (to appear)
	10	LIN, S Computer solutions to the Traveling Salesman Problem Bell Syst Tech J ~, 10 (Dec 1965), 2245-2269
	11	MELLOR, P. A review of job shop scheduling Oper Res Quart I7, 2 (June 1966), 161-171
	12	tLmTER, S., AND SHERMAN, G Discrete optimizing J SIAM I8, 3 (Sept 1965),864-889.
	13	Richard H. Roth, An Approach to Solving Linear Discrete Optimization Problems, Journal of the ACM (JACM), v.17 n.2, p.303-313, April 1970 [doi>10.1145/321574.321584]

CITED BY 2

	Han Hoogeveen , Linda Norden , Steef Velde, Lower bounds for minimizing total completion time in a two-machine flow shop, Journal of Scheduling, v.9 n.6, p.559-568, December 2006
	Toshihide Ibaraki, The Power of Dominance Relations in Branch-and-Bound Algorithms, Journal of the ACM (JACM), v.24 n.2, p.264-279, April 1977