Three-stage flow-shop scheduling with assembly operations to minimize the weighted sum of product completion times

European Journal of Operational Research

Volumn 161, Issue 3, 2005, Pages 754-770

  Yokoyama, Masao ^a   Santos, Daryl L ^b  

^a FUKUSHIMA UNIVERSITY   (Japan)

^b BINGHAMTON UNIVERSITY   (United States)

Author keywords

Assembly operation; Branch and bound; Flow shop; Machining operation; Scheduling

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; HEURISTIC METHODS; MACHINING; MILLING (MACHINING); SCHEDULING;

ASSEMBLY OPERATIONS; BRANCH AND BOUNDS; FLOW-SHOP; MACHINING OPERATIONS;

OPERATIONS RESEARCH;

EID: 7444246192     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2003.09.016     Document Type: Article

References (15)

1. Cheng T.C.E. Analysis of material flow in a job shop with assembly operations. International Journal of Production Research. 28(7):1990;1369-1383.
2. Cheng T.C.E., Wang G. Scheduling the fabrication and assembly of components in a two-machine flowshop. IIE Transactions. 31:1999;135-143.
3. Cummings McCoy D.H., Egbelu P.J. Minimizing production flow time in a process and assembly jobshop. International Journal of Production Research. 36(8):1998;2315-2332.
4. Doctor S.R., Cavalier T.M., Egbelu P.J. Scheduling for machining and assembly in a job-shop environment. International Journal of Production Research. 31(6):1993;1275-1297.
5. French S. Sequencing and Scheduling, an Introduction to the Mathematics of the Job Shop. 1982;Ellis Horwood Ltd. England.
6. Fry T.D., Olife M.D., Minor E.D., Keong Leong G. The effect of product structure and sequencing rule on assembly shop performance. International Journal of Production Research. 27(4):1989;671-686.
7. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, San Francisco.
8. Hariri A.M.A., Potts C.N. A branch and bound algorithm for the two-stage assembly scheduling problem. European Journal of Operational Research. 103(3):1997;547-556.
9. Huang P.Y. A comparative study of priority dispatching rules in a hybrid assembly/job shop. International Journal of Production Research. 22(3):1984;375-387.
10. Lee C.Y., Cheng T.C.E., Lin B.M.T. Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem. Management Science. 39(5):1993;616-625.
11. Philipoon P.R., Russell R.S., Fry T.D. A preliminary investigation of multi-attribute based sequencing rules for assembly shops. International Journal of Production Research. 29(4):1991;739-753.
12. Potts C.N., Sevast'Janov S.V., Strusevich V.A., Van Wassenhove L.N., Zwaneveld C.M. The two-stage assembly scheduling problem: Complexity and approximation. Operations Research. 43(2):1995;346-355.
13. Rinnooy Kan A.H.G. Machine Scheduling Problems. 1976;Martinus Nijhoff, Hague.
14. I. Roa, D. Santos, Flow shops with non-identical multiple processors: A study on makespans, in: Proceedings of the 5th Annual International Conference on Industrial Engineering - Theories, Applications, and Practice, ISBN 0-9654599-5-0, Paper Number 403, Hsinchu, Taiwan, December 2000.
15. Yokoyama M. Hybrid flow-shop scheduling with assembly operations. International Journal of Production Economics. 73(2):2001;103-116.