An evaluation of sequencing heuristics in flow shops with multiple processors

Computers and Industrial Engineering

Volumn 30, Issue 4, 1996, Pages 681-691

  Santos, D L ^a   Hunsucker, J L ^b   Deal, D E ^b  

^a BINGHAMTON UNIVERSITY   (United States)

^b UNIVERSITY OF HOUSTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER INTEGRATED MANUFACTURING; MULTIPROCESSING SYSTEMS; OPTIMIZATION; QUEUEING THEORY; SCHEDULING;

FLOW SHOPS; MAKESPANS; MULTIPLE PROCESSORS; PERMUTATIONS; QUEUEING SEQUENCE; SEQUENCY HEURISTICS;

HEURISTIC PROGRAMMING;

EID: 0030243899     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/0360-8352(95)00184-0     Document Type: Article

References (22)

1. C. -Y. Lee and J. W. Herrmann. A three-machine scheduling problem with look-behind characteristics. Research Report 93-11, Department of Industrial & Systems Engineering, University of Florida (1993).
2. S. M. Johnson. Optimal two- and three-stage production schedules with setup times included. Nov. Res. Logist. Q. 1, 61-68 (1954).
3. D. E. Deal, T. Yang and S. J. Hallquist. Job scheduling in petrochemical production: two-stage processing with finite intermediate storage. Computers chem. Engng 18, 333-344 (1994).
4. M. S. Salvador. A solution to a special case of flow shop scheduling problems. In Symposium of the Theory of Scheduling and Applications. Springer-Verlag, New York (1973).
5. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979).
6. J. N. D. Gupta. Two-stage, hybrid flowshop scheduling problem. J. Oper. Res. Soc. 39, 359-364 (1988).
7. T. S. Arthanary and K. G. Ramaswamy. An extension of the two machine sequencing problem. Opsearch 8, 10-22 (1971).
8. D. E. Deal and J. L. Hunsucker. The two-stage flowshop scheduling problem with machines at each stage. J. Inform. Optim. Sci. 12, 407-417 (1991).
9. J. N. D. Gupta and E. A. Tunc. Schedules for a two-stage hybrid flowshop with parallel machines at the second stage. Int. J. Product. Res. 29, 1489-1502 (1991).
10. C.-Y. Lee and G. L. Vairaktarakis. Minimizing makespan in hybrid flowshops. Research Report 93-27, Department of Industrial & Systems Engineering, University of Florida (1993).
11. S. A. Brah. Scheduling in a flow shop with multiple processors. Unpublished Ph.D. Dissertation, Univeristy of Houston, Houston, TX (1988).
12. S. A. Brah and J. L. Hunsucker. Branch and bound algorithm for the flow shop with multiple processors. Eur. J. Oper. Res. 51, 88-99 (1991).
13. S. A. Brah, D. L. Santos and J. L. Hunsucker. Heuristic programming study of a flow shop with multiple processors scheduling. Paper presented at the ORSA/TIMS Joint National Meeting, New York City (1989).
14. J. C. Contreras, Scheduling of petrochemical plant shutdown activities using flowshop scheduling heuristics. Unpublished Master's thesis, University of Houston, Houston, TX (1994).
15. F.-Y. Ding and D. Kittichartphayak. Heuristics for scheduling flexible flow lines. Computers Ind. Engng 26, 27-34 (1994).
16. J. L. Hunsucker and J. R. Shah. Performance of priority rules in a due date flow shop. OMEGA 20, 73-89 (1992).
17. J. L. Hunsucker and J. R. Shah. Comparative performance analysis of priority rules in a constrained flow shop with multiple processors environment. Eur. J. Oper. Res. 72, 102-114 (1994).
18. D. L. Santos, J. L. Hunsucker and D. E. Deal. Global lower bounds for flow shops with multiple processors. Eur. J. Oper Res. 80, 112-120 (1995).
19. D. L. Santos, J. L. Hunsucker and D. E. Deal. Flowmult: permutation sequences for flow shops with multiple processors. J. Inform. Optim. Sci. 16, 351-366 (1995).
20. R. J. Wittrock. An adaptable scheduling algorithm for flexible flow lines. Opers Res. 36, 445-453 (1988).
21. M. Pinedo. Scheduling: Theory, Algorithms, and Systems. Prentice-Hall, New Jersey (1995).
22. D. S. Palmer. Sequencing jobs through a multi-stage process in the minimum total time - a quick method of obtaining a near optimum. Opers Res. Q. 16, 101-107 (1965).