IDEAS home Printed from https://ideas.repec.org/a/taf/conmgt/v23y2005i1p93-105.html
   My bibliography  Save this article

Flowshop scheduling model for bespoke precast concrete production planning

Author

Listed:
  • Vacharapoom Benjaoran
  • Nashwan Dawood
  • Brian Hobbs

Abstract

Bespoke precast concrete products are particularly designed and custom made for a construction project. The production planning of these products is complicated that considers important concerns, i.e. the reliability of the product delivery programme, the short lead-time competitiveness, and the effective utilization of purpose-built precast moulds. The planning has a high impact on the success of the production. The characteristics of the bespoke precast production are formulated with the flowshop scheduling technique so that an effective production plan can be arranged to meet these concerns. Genetic algorithm is used in the scheduling optimization. Its multi-objective function includes total flowtime, total machine idle time, and total tardiness and earliness. After the model formulation, sensitivity analyses are conducted on the three model's parameters namely the number of mould availability, the processing time changes, and the weighting of the multi-objective function. The proposed model is anticipated to support the planners to arrange economic and efficient production plans. Also, it can be used to determine the suitable number of moulds, the accuracy of the processing time estimation, and the weighting strategy of the multi-objective optimization.

Suggested Citation

  • Vacharapoom Benjaoran & Nashwan Dawood & Brian Hobbs, 2005. "Flowshop scheduling model for bespoke precast concrete production planning," Construction Management and Economics, Taylor & Francis Journals, vol. 23(1), pages 93-105.
  • Handle: RePEc:taf:conmgt:v:23:y:2005:i:1:p:93-105
    DOI: 10.1080/0144619042000287732
    as

    Download full text from publisher

    File URL: http://www.tandfonline.com/doi/abs/10.1080/0144619042000287732
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1080/0144619042000287732?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sung, C. S. & 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, Elsevier, vol. 131(1), pages 95-106, May.
    2. Allahverdi, Ali & Mittenthal, John, 1995. "Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function," European Journal of Operational Research, Elsevier, vol. 81(2), pages 376-387, March.
    3. Nicholas G. Hall & Chelliah Sriskandarajah, 1996. "A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process," Operations Research, INFORMS, vol. 44(3), pages 510-525, June.
    4. Lim, Chong John & McMahon, Graham B., 1994. "The three-machine flow-shop problem with arbitrary precedence relations," European Journal of Operational Research, Elsevier, vol. 78(2), pages 216-223, October.
    5. Rajendran, Chandrasekharan, 1995. "Heuristics for scheduling in flowshop with multiple objectives," European Journal of Operational Research, Elsevier, vol. 82(3), pages 540-555, May.
    6. Clyde L. Monma & Chris N. Potts, 1993. "Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times," Operations Research, INFORMS, vol. 41(5), pages 981-993, October.
    7. Nawaz, Muhammad & Enscore Jr, E Emory & Ham, Inyong, 1983. "A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem," Omega, Elsevier, vol. 11(1), pages 91-95.
    8. Jain, A. S. & Meeran, S., 1999. "Deterministic job-shop scheduling: Past, present and future," European Journal of Operational Research, Elsevier, vol. 113(2), pages 390-434, March.
    9. David G. Dannenbring, 1977. "An Evaluation of Flow Shop Sequencing Heuristics," Management Science, INFORMS, vol. 23(11), pages 1174-1182, July.
    10. Herbert G. Campbell & Richard A. Dudek & Milton L. Smith, 1970. "A Heuristic Algorithm for the n Job, m Machine Sequencing Problem," Management Science, INFORMS, vol. 16(10), pages 630-637, June.
    11. Chang, Pei-Chann & Hsieh, Jih-Chang & Lin, Shui-Geng, 2002. "The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem," International Journal of Production Economics, Elsevier, vol. 79(3), pages 171-183, October.
    12. Allahverdi, Ali & Gupta, Jatinder N. D. & Aldowaisan, Tariq, 1999. "A review of scheduling research involving setup considerations," Omega, Elsevier, vol. 27(2), pages 219-239, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kennedy A. G. Araújo & Tibérius O. Bonates & Bruno A. Prata & Anselmo R. Pitombeira-Neto, 2021. "Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 29(3), pages 660-693, October.
    2. Dong Wang & Guiwen Liu & Kaijian Li & Tongjing Wang & Asheem Shrestha & Igor Martek & Xiaobo Tao, 2018. "Layout Optimization Model for the Production Planning of Precast Concrete Building Components," Sustainability, MDPI, vol. 10(6), pages 1-16, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Gajpal, Yuvraj & Rajendran, Chandrasekharan, 2006. "An ant-colony optimization algorithm for minimizing the completion-time variance of jobs in flowshops," International Journal of Production Economics, Elsevier, vol. 101(2), pages 259-272, June.
    2. Varadharajan, T.K. & Rajendran, Chandrasekharan, 2005. "A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs," European Journal of Operational Research, Elsevier, vol. 167(3), pages 772-795, December.
    3. Yenisey, Mehmet Mutlu & Yagmahan, Betul, 2014. "Multi-objective permutation flow shop scheduling problem: Literature review, classification and current trends," Omega, Elsevier, vol. 45(C), pages 119-135.
    4. Smutnicki, Czeslaw, 1998. "Some results of the worst-case analysis for flow shop scheduling," European Journal of Operational Research, Elsevier, vol. 109(1), pages 66-87, August.
    5. Bagchi, Tapan P. & Gupta, Jatinder N.D. & Sriskandarajah, Chelliah, 2006. "A review of TSP based approaches for flowshop scheduling," European Journal of Operational Research, Elsevier, vol. 169(3), pages 816-854, March.
    6. Sündüz Dağ, 2013. "An Application On Flowshop Scheduling," Alphanumeric Journal, Bahadir Fatih Yildirim, vol. 1(1), pages 47-56, December.
    7. Gupta, Jatinder N.D. & Koulamas, Christos & Kyparisis, George J., 2006. "Performance guarantees for flowshop heuristics to minimize makespan," European Journal of Operational Research, Elsevier, vol. 169(3), pages 865-872, March.
    8. Ben-Daya, M. & Al-Fawzan, M., 1998. "A tabu search approach for the flow shop scheduling problem," European Journal of Operational Research, Elsevier, vol. 109(1), pages 88-95, August.
    9. Guinet, Alain & Legrand, Marie, 1998. "Reduction of job-shop problems to flow-shop problems with precedence constraints," European Journal of Operational Research, Elsevier, vol. 109(1), pages 96-110, August.
    10. Hamed Hendizadeh, S. & Faramarzi, Hamidreza & Mansouri, S.Afshin & Gupta, Jatinder N.D. & Y ElMekkawy, Tarek, 2008. "Meta-heuristics for scheduling a flowline manufacturing cell with sequence dependent family setup times," International Journal of Production Economics, Elsevier, vol. 111(2), pages 593-605, February.
    11. Ruiz, Ruben & Stutzle, Thomas, 2007. "A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem," European Journal of Operational Research, Elsevier, vol. 177(3), pages 2033-2049, March.
    12. Framinan, Jose M. & Leisten, Rainer & Ruiz-Usano, Rafael, 2002. "Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation," European Journal of Operational Research, Elsevier, vol. 141(3), pages 559-569, September.
    13. M Haouari & T Ladhari, 2003. "A branch-and-bound-based local search method for the flow shop problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1076-1084, October.
    14. Kalczynski, Pawel J. & Kamburowski, Jerzy, 2009. "An empirical analysis of the optimality rate of flow shop heuristics," European Journal of Operational Research, Elsevier, vol. 198(1), pages 93-101, October.
    15. Nowicki, Eugeniusz & Smutnicki, Czeslaw, 1996. "A fast tabu search algorithm for the permutation flow-shop problem," European Journal of Operational Research, Elsevier, vol. 91(1), pages 160-175, May.
    16. Botta-Genoulaz, Valerie, 2000. "Hybrid flow shop scheduling with precedence constraints and time lags to minimize maximum lateness," International Journal of Production Economics, Elsevier, vol. 64(1-3), pages 101-111, March.
    17. Ruiz, Ruben & Maroto, Concepcion, 2005. "A comprehensive review and evaluation of permutation flowshop heuristics," European Journal of Operational Research, Elsevier, vol. 165(2), pages 479-494, September.
    18. F T Tseng & J N D Gupta & E F Stafford, 2006. "A penalty-based heuristic algorithm for the permutation flowshop scheduling problem with sequence-dependent set-up times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(5), pages 541-551, May.
    19. Fernandez-Viagas, Victor & Talens, Carla & Framinan, Jose M., 2022. "Assembly flowshop scheduling problem: Speed-up procedure and computational evaluation," European Journal of Operational Research, Elsevier, vol. 299(3), pages 869-882.
    20. Logendran, Rasaratnam & Mai, Luen & Talkington, Diane, 1995. "Combined heuristics for bi-level group scheduling problems," International Journal of Production Economics, Elsevier, vol. 38(2-3), pages 133-145, March.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:conmgt:v:23:y:2005:i:1:p:93-105. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/RCME20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.