Flowshop scheduling model for bespoke precast concrete production planning

Construction Management and Economics

Volumn 23, Issue 1, 2005, Pages 93-105

  Benjaoran, Vacharapoom ^a   Dawood, Nashwan ^a   Hobbs, Brian ^a  

^a TEESSIDE UNIVERSITY   (United Kingdom)

Author keywords

Bespoke precast concrete; Flowshop scheduling; Genetic algorithm; Production planning

Indexed keywords

GENETIC ALGORITHMS; MATHEMATICAL MODELS; OPTIMIZATION; PARAMETER ESTIMATION; PLANNING; PROJECT MANAGEMENT; SCHEDULING;

IDLE TIME; PRECAST MOULDS; PRODUCTION PLANNING; TIME ESTIMATION;

CONCRETE PRODUCTS;

CONCRETE;

EID: 13944259031     PISSN: 01446193     EISSN: None     Source Type: Journal    
DOI: 10.1080/0144619042000287732     Document Type: Article

References (28)

1. Allahverdi, A. and Mittenthal, J. (1995) Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function. European Journal of Operational Research, 81(2), 376-87.
2. Allahverdi, A., Gupta, J.N.D. and Aldowaisan, T. (1999) A review of scheduling research involving setup considerations. Omega, International Journal of Management Science, 27(2), 219-39.
3. Benjaoran, V. and Dawood, N. (2003) Development of an artificial intelligence planner framework for bespoke precast concrete production, Proceeding of the 11th Annual Conference of International Group for Lean Construction, Blackburg, Virginia, USA, 22-24 July.
4. Campbell, H.G., Dudek, R.A. and Smith, M.L. (1970) A heuristic algorithm for the n job, m machine sequencing problem. Management Science, 16(10), 630-7.
5. Chan, W.T. and Hu, H. (2002) Production scheduling for precast plants using a flow shop sequencing model. Journal of Computing in Civil Engeering, 16(3), 165-74.
6. Chang, P., Hsieh, J. and Lin, S. (2002) The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem. International Journal of Production Economics, 79(3), 171-83.
7. Cochran, J.K., Horng, S.M. and Fowler, J.W. (2003) A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines. Computers and Operations Research, 30(7 , 1087-102.
8. Cooper, D.R. and Schindler, P.S. (2001) Business Research Methods, 7th edn, McGraw-Hill, Boston.
9. Dannenbring, D.G. (1977) An evaluation of flow shop sequencing heuristics. Management Science, 23(11), 1174-82.
10. Goldberg, D.E. (1989) Genetic Algorithms in Search, Optimisation, and Machine Learning, Addison-Wesley, Reading.
11. Gupta, J.N.D. (1971) A functional heuristic algorithm for the flowshop scheduling problem. Operational Research Quarterly, 22(1), 39-47.
12. Hall, N.G. and Sriskandarajah, C. (1996) A survey of machine scheduling problems with blocking and no-wait in process. Operations Research 44(3), 510-25.
13. Ishibuchi, H. and Murata, T. (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Transactions on Systems, Man, and Cybernetics - Part C: Applications and Reviews, 28(3), 392-403.
14. Jain, A.S. and Meeran, S. (1999) Deterministic job-shop scheduling: past, present and future. European Journal of Operational Research 113(2), 390-434.
15. Johnson, S.M. (1954) Optimal two- and three-stage production schedules with set up times included. Naval Research Logistics Quarterly, 1, 61-8.
16. Leu, S. and Hwang, S. (2001) Optimal repetitive scheduling model with sharable resource constraint. Journal of Construction Engineering and Management, 127(4), 270-80.
17. Leu, S. and Hwang, S. (2002) GA-based resource-constrained flow-shop scheduling model for mixed precast production. Automation in Construction, 11(4), 439-52.
18. Lim, C.J. and McMahon, G.B. (1994) The three-machine flow-shop problem with arbitrary precedence relations. European Journal of Operational Research, 78(2), 216-23.
19. Linn, R. and Zhang, W. (1999) Hybrid flow shop scheduling: A survey. Computers and Industrial Engineering, 37(1-2), 57-61.
20. Monma, C.L. and Potts, C.N. (1993) Analysis of heuristics for pre-emptive parallel machine scheduling with batch setup times. Operations Research, 41(5), 981-93.
21. Murata, T., Ishibuchi, H. and Tanaka, H. (1996) Multi-objective genetic algorithm and its applications to flowshop scheduling. Computers and Industrial Engineering, 30(4), 957-68.
22. Nawaz, M., Enscore, E.E. and Ham, I. (1983) A heuristic algorithm for m-machine, n-job flowshop sequencing problem. Omega, 11(1), 91-5.
23. Ogbu, F.A. and Smith, D.K. (1990) The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem. Computers and Operations Research, 17(3), 243-53.
24. Ovacik, I.M. and Uzsoy, R. (1995) Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. International Journal of Production Research, 33(11), 3173-92.
25. Palmer, D.S. (1965) Sequencing jobs through a multi-stage process in the minimum total time - A quick method of obtaining a near optimum. Operations Research Quarterly, 16(1), 101-7.
26. Rajendran, C. (1995) Heuristics for scheduling in flowshop with multiple objective. European Journal of Operational Research, 82(3), 540-55.
27. Sung, C. S. and Min, J.I. (2001) Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date. European Journal of Operational Research, 131 1), 95-106.
28. Warszawski, A. (1990) Industrialization and Robotics in Building: A Managerial Approach, Harper & Row, New York.