Flowshop scheduling model for bespoke precast concrete production planning

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.

[1]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

[2]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[3]  Graham McMahon,et al.  The two-machine flow shop problem with arbitrary precedence relations , 1993 .

[4]  J. I. Min,et al.  Scheduling in a two-machine flowshop with batch processing machine(s) for earliness/tardiness measure under a common due date , 2001, Eur. J. Oper. Res..

[5]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[6]  P. Chang,et al.  The development of gradual-priority weighting approach for the multi-objective flowshop scheduling problem , 2002 .

[7]  Sheik Meeran,et al.  Deterministic job-shop scheduling: Past, present and future , 1999, Eur. J. Oper. Res..

[8]  Nashwan Dawood,et al.  Development Framework of an Artificial Intelligence Planner Framework for Bespoke Precast Concrete Production , 2003 .

[9]  N. Dawood,et al.  DEVELOPMENT OF AN ARTIFICIAL INTELLIGENCE PLANNER FRAMEWORK FOR BESPOKE PRECAST CONCRETE PRODUCTION , 2003 .

[10]  Sou-Sen Leu,et al.  Ga-based resource-constrained flow-shop scheduling model for mixed precast production , 2002 .

[11]  Clyde L. Monma,et al.  Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times , 1993, Oper. Res..

[12]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[13]  Sou-Sen Leu,et al.  OPTIMAL REPETITIVE SCHEDULING MODEL WITH SHAREABLE RESOURCE CONSTRAINT , 2001 .

[14]  C. Rajendran.  Heuristics for scheduling in flowshop with multiple objectives , 1995 .

[15]  Weng Tat Chan,et al.  Production Scheduling for Precast Plants using a Flow Shop Sequencing Model , 2002 .

[16]  Hisao Ishibuchi,et al.  A multi-objective genetic local search algorithm and its application to flowshop scheduling , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[17]  L Sou Sen,et al.  OPTIMAL REPETITIVE SCHEDULING MODEL WITH SHAREABLE RESOURCE CONSTRAINT , 2001 .

[18]  David K. Smith,et al.  The application of the simulated annealing algorithm to the solution of the n/m/Cmax flowshop problem , 1990, Comput. Oper. Res..

[19]  Richard J. Linn,et al.  Hybrid flow shop scheduling: a survey , 1999 .

[20]  John W. Fowler,et al.  A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machines , 2003, Comput. Oper. Res..

[21]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[22]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[23]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[24]  Reha Uzsoy,et al.  Rolling horizon procedures for dynamic parallel machine scheduling with sequence-dependent setup times. , 1995 .

[25]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

[26]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[27]  Ali Allahverdi,et al.  Scheduling on a two-machine flowshop subject to random breakdowns with a makespan objective function , 1995 .