Scheduling multistage hybrid flowshops with multiprocessor tasks by an effective heuristic

International Journal of Production Research

Volumn 47, Issue 13, 2009, Pages 3525-3538

  Ying, Kuo Ching ^a   Lin, Shih Wei ^b  

^a HUAFAN UNIVERSITY   (Taiwan)

^b CHANG GUNG UNIVERSITY   (Taiwan)

Author keywords

Heuristic; Hybrid flowshop; Scheduling

Indexed keywords

BENCH-MARK PROBLEMS; COMPUTATIONAL EXPERIMENT; COMPUTATIONAL RESULTS; HYBRID FLOW SHOP; HYBRID FLOW SHOP SCHEDULING; METAHEURISTIC; MULTIPROCESSOR TASKS; SCHEDULING PROBLEM;

COMPUTATIONAL EFFICIENCY; HEURISTIC ALGORITHMS; INDUSTRIAL APPLICATIONS; MULTIPROCESSING SYSTEMS; PROBLEM SOLVING; TABU SEARCH;

HEURISTIC METHODS;

EID: 70449629231     PISSN: 00207543     EISSN: 1366588X     Source Type: Journal    
DOI: 10.1080/00207540701871085     Document Type: Article

References (19)

1. Arthanari, T.S. and Ramamurthy, K.G., 1971. An extension of two machines sequencing problem. Operations Research, 8 (1), 10-22.
2. Campbell, H.G., Dudek, R.A. and Smith, M.L., 1970. A heuristic algorithm for the n-job, m-machine sequencing problem. International Journal of Management Science, 16 (10), B630-B637.
3. Guinet, A., Solomon, M.M., Kedia, P.K. and Dussauchoy, A., 1996. A computational study of heuristics for two-stage flexible flowshops. International Journal of Production Research, 34 (5), 1399-1415.
4. Gupta, J.N.D., 1988. Two-stage, hybrid flowshop scheduling problem. Journal of the Operational Research Society, 39 (4), 359-364
5. Gupta, J.N.D., Hariri, A.M.A. and Potts, C.N., 1997. Scheduling for a two-stage hybrid flow shop with parallel machines at the first stage. Annals of Operations Research, 69 (1), 171-191.
6. Janiak, A., Kozan, E., Lichtenstein, M. and Oguz, C., 2007. Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion. International Journal of Production Economics, 105 (2), 407-424.
7. Linn, R. and Zhang, W., 1999. Hybrid flow shop scheduling: A survey. Computers and Industrial Engineering, 37 (1-2), 57-61.
8. Nawaz, M., Enscore, E.E. and Ham, I., 1983. A heuristic algorithm for the m-machine, n-job flow shop sequencing problem. International Journal of Management Science, 11 (1), 91-95.
9. Oguz, C., Fikret, E.M., Edwin, C.T.C. and Fung, Y.F., 2003. Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. European Journal of Operational Research, 149 (2), 390-403.
10. Oguz, C., Zinder, Y., Ha, D.V., Janiak, A. and Lichtenstein, M., 2004. Hybrid flow-shop scheduling problems with multiprocessor task systems. European Journal of Operational Research, 152 (1), 115-131.
11. Palmer, D.S., 1965. Sequencing jobs through a multi-stage process in the minimum total time-a quick method of obtaining a near optimum. Operational Research Quarterly, 16 (1), 101-107.
12. Raghu, T.S. and Rajendran, C., 1993. An efficient dynamic dispatching rule for scheduling in a job shop. International Journal of Production Economics, 32 (3), 301-313.
13. Rajendran, C. and Chaudhunri, D., 1992. A multi-stage parallel-processor flowshop problem with minimum flowtime. European Journal of Operational Research, 57 (1), 111-122
14. Riane, F. and Artiba, A., 1999. Scheduling multistage flowshop problem: A brief review. In Proceedings of the International Conference on Industrial Engineering and Production Management, 12-15 July 1999, Glasgow, Scotland, 323-335.
15. Sivrikaya S Erifoglu, F. and Tiryaki, I.U., 2002. Multiprocessor task scheduling in multistage hybrid flowshops: A simulated annealing approach. In Proceedings of the 2nd International Conference on Responsive Manufacturing, 270-274.
16. Sivrikaya S, Erifoglu, F. and Ulusoy, G., 2004. Multiprocessor task scheduling in multistage hybrid flowshops: A genetic algorithm approach. Journal of the Operational Research Society, 55 (5), 504-512.
17. Vignier, A., Dardilhac, D., Dezalay, D. and Proust, C., 1996. A branch and bound approach to minimize the total completion time in a k-stage hybrid flowshop. In Proceedings of 1996 IEEE Conference on Emerging Technologies and Factory Automation, 18-21 November, Kauai, Hawaii, 215-220.
18. Vignier, A., Commdeur, P. and Proust, C., 1997. New lower bound for the hybrid flowshop scheduling problem. In IEEE 6th International Conference on Emerging Technologies and Factory Automation Proceedings, 9-12 September, Los Angeles, California, 446-451.
19. Ying, K.-C. and Lin, S.-W., 2006. Multiprocessor task scheduling in multistage hybrid flow-shops: An ant colony system approach. International Journal of Production Research, 44 (6), 3161-3177.