Minimizing the sum of completion times of n jobs over m machines in a flowshop—a branch and bound approach

AIIE Transactions

Volumn 9, Issue 3, 1977, Pages 306-311

  Bansal, S P ^a  

^a UNIVERSITY OF DELHI   (India)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84952221975     PISSN: 05695554     EISSN: None     Source Type: Journal    
DOI: 10.1080/05695557708975160     Document Type: Article

References (9)

1. Bagga, P. C. and N. K. Chakravarti, “Optimal m-Stage Production Schedule,” CORS Journal, 6, 2, 71-78 (1968).
2. Brown, A.P.G. and Z. A. Lomnicki, “Some Applications of the Branch and Bound Algorithm to the Machine Scheduling Problem,” Operational Res. Q., 17, 2, 173-186 (1966).
3. Dudck, R. A. and O. F. Teuton, Jr., “Development of M- stage Decision Rule for Scheduling n jobs through m Machines” Opns. Res., 12, 3, 471-497 (1964).
4. Gupta, J.N.D., “A General Algorithm for the nXm Flowshop Scheduling Problem,” The International Journal of Production Research, 7, 241-247 (1969).
5. Ignall, E. and L. Schrage, “Applications of the Branch and Bound Technique to Some Flow Shop Scheduling Problems,” Opns, Res., 13, x 400-412 (1965).
6. Johnson, S. M., “Optimal Two and Three Stage Production Schedule with Set up Times Included,” Naval Res. Log. Quart., No. 1, 61-68 (1954).
7. Smith, R. A. and R. A. Dudek, “A General Algorithm for Solution of n Jobs M Machines Sequencing Problems of the Flow-Shop,” Opns Res. 15, 71-82 (1967).
8. Szwarc, W., “Optimal Elimination Methods in the mXn Flowship Scheduling Troblem,” Operations Research, 21, 6, 1250-1259 (197 3).
9. Szwarc W., “Mathematical Aspects of the 3Xn Job Shop Sequencing Problem,” Naval Research Log. Q., 21, 145-153 (1974).