A heuristic algorithm for hybrid flow-shop production scheduling to minimize the sum of the earliness andf tardiness costs

Journal of the Chinese Institute of Industrial Engineers

Volumn 25, Issue 2, 2008, Pages 105-115

  Fakhrzad, M B ^a   Heydari, Mehdi ^b  

^a YAZD UNIVERSITY   (Iran)

^b IRAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Iran)

Author keywords

Bottleneck resources; Earliness and tardiness; Hybrid flow shop; Resource leveling

Indexed keywords

BUSINESS MACHINES; COSTS; INTEGER PROGRAMMING; MACHINE SHOP PRACTICE; PRODUCTION CONTROL; SCHEDULING;

BOTTLENECK RESOURCES; EARLINESS AND TARDINESS; FLOW SHOP SCHEDULING PROBLEM; HYBRID FLOW SHOP; HYBRID FLOW SHOP SCHEDULING; IDENTICAL PARALLEL MACHINES; INTEGER LINEAR PROGRAMMING; RESOURCE LEVELING;

HEURISTIC ALGORITHMS;

EID: 50949129708     PISSN: 10170669     EISSN: 21517606     Source Type: Journal    
DOI: 10.1080/10170660809509076     Document Type: Article

References (29)

1. Aarts, E., and Lenstra, J. K., 1997. Search in Combinatorial Optimization New York:Wiley.
2. Allaoui, H., and Artiba, A., 2004. Integrating simulation and optimization to schedule a hybrid flow shop with maintenance constraints. Computers and Industrial Engineering, 47:431–450.
3. Andre's, C., Albarraci'n, J. M., Tormo, G., Vicens, E., and Garci'a-Sabater, J. P., 2005. Group technology in a hybrid flowshop environment:A case study. European Journal of Operational Research, 167:272–281.
4. Bertel, S., and Billaut, J. C., 2004. A genetic algorithm for an industrial multiprocessor flow-shop scheduling problem with recirculation. European Journal of Operational Research, 159:651–662.
5. Botta-Genoulaz, V., 2000. Hybrid flow- shop scheduling with precedence constrains and time legs to minimize maximum lateness. International Journal of Production Economics, 64:101–111.
6. Braha, S. A., and Loob, L. L., 1999. Heuristics for scheduling in a flow-shop with multiple processors. European Journal of Operational Research, 113:113–122.
7. Chang, J., Yan, W., and Shao, H., 2004. “ Scheduling a two-stage no wait hybrid flowshop with separated setup and removal times ”. In Proceedings of the American Control Conference Vol. 2, 1412–1416. Boston, MA, United States June 30-July 2
8. Chen, B., 1995. Analysis of classes of heuristics for scheduling a two-stage flow shop with parallel machines at one stage. Journal of Operation Research Society, 46:234–244.
9. Elmaghraby, S. E., and Karnub, R. E., 1995. Production control in flexible flow-shops:An example for textile manufacturing, OR Report No. 305 USA:OR & IE Dept. North Carolina State University.
10. Glover, F., 1986. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 5:533–549.
11. Glover, F., 1989. Tabu search. Part I. ORSA Journal on Computing, 1:190–206.
12. Glover, F., 1990. Tabu search. Part II. ORSA Journal on Computing, 2:4–32.
13. Gupta, J. N. D., 1988. Two-stage hybrid flow-shop scheduling problem. Journal of Operation Research Society, 39:359–364.
14. Haouari, M., and M'Hallah, R., 1997. Heuristics algorithms for the two-stage hybrid flowshop problems. Operation Research Letters, 21:43–53.
15. Hoogeveen, J., Lenestra, J. K., and Veltman, B., 1996. Preemptive scheduling in a two-stage multiprocessor flow-shop is NP-hard. European Journal of Operational Research, 89:172–175.
16. Huang, W., and Li, S., 1998. A two-stage hybrid flowshop with uniform machines and setup times. Mathematical and Computer Modeling, 27:27–45.
17. Janiak, A., and Lichtenstein, M., 2000. “ Comparison of some heuristic algorithms for the flow-shop problem with parallel machines to minimize the total earliness, tardiness and waiting time ”. In Proceedings of the symposium, OR 2000 378–383. Dresden, Germany Sep. 9–12
18. Kurz, M. E., and Askin, R. G., 2004. Scheduling flexible flow lines with sequencing-dependent setup times. European Journal of Operational Research, 159:66–82.
19. Kurz, M. E., and Askin, R. G., 2003. Comparing scheduling rules for flexible flow lines. International Journal of Production Economics, 85:371–388.
20. Kyparisis, G. J., and Koulamas, C., 2001. A note on weighted completion time minimization in a flexible flow-shop. Operation Research Letters, 29:5–11.
21. Lin, H. T., and Liao, C. J., 2003. A case study in a two-stage hybrid flow-shop with setup time and dedicated machines. International Journal of Production Economics, 86:133–143.
22. Liu, C. Y., and Chang, S. C., 2000. Scheduling flexible flow shops with sequence-dependent setup effects. IEEE Transactions on Robotics and Automation, 16:408–419.
23. Logendran, R., Carson, S., and Hanson, E., 2005. Group scheduling in flexible flow shops. International Journal of Production Economics, 96:143–155.
24. Pugazhendhi, S., Thiagarajan, S., Rajendran, C., and Anantharaman, N., 2004. Generating non-permutation schedules in flowline based manufacturing systems with sequence-dependent setup times of jobs:A heuristic approach. The International Journal of Advanced Manufacturing Technology, 23:64–78.
25. Ruiz, R., and Maroto, C., 2006. A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility. European Journal of Operational Research, 169:781–800.
26. Ruiz, R., Sivrikaya-Serifoglu, F., and Urlings, T., 2008. Modeling realistic hybrid flexible flowshop scheduling problems. Computers and Operations Research, 34:1151–1175.
27. Ruiz, R., Sivrikaya-Serifoglu, F., and Urlings, T., 2006. Evolutionary approach to realistic hybrid flexible flow-shop scheduling problems, Technical Report Spain:Polytechnic University of Valencia, Dept. of Applied Statistics and Operations Research.
28. Tian, P., Ma, J., and Zhang, D. M., 1999. Application of the simulated annealing algorithm to the combinatorial optimization problem with permutation property:an investigation of generation mechanism. European Journal of Operational Research, 118:81–94.
29. Vob, S., and Witt, A., 2007. Hybrid flow shop scheduling as a multi-mode multi-project scheduling problem with batching requirements:A real-world application. International Journal of Production Economics, 105:445–458.