Please use this identifier to cite or link to this item: https://doi.org/10.1061/(ASCE)0887-3801(2002)16:3(165)
Title: Production scheduling for precast plants using a flow shop sequencing model
Authors: Chan, W.T. 
Hu, H.
Keywords: Algorithms
Concrete, precast
Management methods
Manufacturing facilities
Productivity
Scheduling
Issue Date: Jul-2002
Source: Chan, W.T., Hu, H. (2002-07). Production scheduling for precast plants using a flow shop sequencing model. Journal of Computing in Civil Engineering 16 (3) : 165-174. ScholarBank@NUS Repository. https://doi.org/10.1061/(ASCE)0887-3801(2002)16:3(165)
Abstract: There are two alternatives for production organization in precast factories - namely, the comprehensive method and the specialized method. Production scheduling under the specialized alternative has been found to be a difficult optimization problem if heterogeneous elements are involved. A flow shop sequencing model that incorporates actual constraints encountered in practice is proposed for this difficult case of precast production scheduling. The model is solved using a genetic algorithm (GA). The traditional minimize makespan and the more practical minimize tardiness penalty objective functions are optimized separately, as well as simultaneously using a normalized weighted GA. Comparisons between the GA and classical heuristic rules show that the GA can obtain good schedules for the model, giving a family of solutions that are at least as good as those produced by the use of heuristic rules. © ASCE,.
Source Title: Journal of Computing in Civil Engineering
URI: http://scholarbank.nus.edu.sg/handle/10635/66030
ISSN: 08873801
DOI: 10.1061/(ASCE)0887-3801(2002)16:3(165)
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

30
checked on Dec 11, 2017

WEB OF SCIENCETM
Citations

19
checked on Dec 11, 2017

Page view(s)

46
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.