Abstract
In this paper, we consider the problem of extended permutation flowshop scheduling with the intermediate buffers. The Kanban flowshop problem considered involves dual-blocking by both part type and queue size acting on machines, as well as on material handling. The objectives considered in this study include the minimization of mean completion time of containers, mean completion time of part types, and the standard deviation of mean completion time of part types. An attempt is made to solve the multi-objective problem by using a proposed genetic algorithm, called the “non-dominated and normalized distance-ranked sorting multi-objective genetic algorithm” (NDSMGA). In order to evaluate the NDSMGA, we have made use of randomly generated flowshop scheduling problems with input and output buffer constraints in the flowshop. The non-dominated solutions for these problems are obtained from each of the existing methods, namely multi-objective genetic local search (MOGLS), elitist non-dominated sorting genetic algorithm (ENGA), gradual priority weighting genetic algorithm (GPWGA), modified MOGLS, and the NDSMGA. These non-dominated solutions are combined to obtain a net non-dominated solution set for a given problem. Contribution in terms of number of solutions to the net non-dominated solution set from each of these algorithms is tabulated, and the results reveal that a substantial number of non-dominated solutions are contributed by the NDSMGA.
Similar content being viewed by others
References
Ishibuchi H, Murata T (1998) A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Trans Syst Man Cybernetics Part C Appl Rev 28:392–403
Bagchi T (1999) Multi objective scheduling by genetic algorithms. Kluwer, Boston
Chang PC, Hsieh JC, Lin SG (2002) The development of gradual priority weighting approach for the multi-objective flowshop scheduling problem. Int J Prod Econ 79:171–183
Ishibuchi H, Yoshida T, Murata T (2003) Balance between genetic search and local search in memetic algorithms for multi-objective permutation flowshop scheduling. IEEE Trans Evol Comput 7:204–223
Garey MR, Johnson DS, Sethi R (1976) The complexity of flow-shop and job-shop scheduling. Math Oper Res 1:117–129
Hall NG, Sriskandarajah C (1996) A survey of machine scheduling problems with blocking and no-wait in process. Oper Res 44:510–525
Papadimitriou C, Kanellakis P (1980) Flowshop scheduling with limited temporary storage. J ACM 27:533–549
Leisten R (1990) Flowshop sequencing problems with limited buffer storage. Int J Prod Res 28:2085–2100
Berkley BJ (1992) A review of the Kanban production control research literature. Prod Oper Manage 1:393– 411
Weng MX (2000) Scheduling flowshops with limited buffer spaces. In: Proceedings of the Winter Simulation Conference, pp 1359–1363, ISSN 0743-1902, www.direct.bl.uk
Brucker P, Heitmann S, Hurink JL (2003) Flowshop problems with intermediate buffers. OR Spectrum 25:549–574
Monden Y (1983) Toyota production system: a practical approach to production management. Industrial Engineering and Management Press, Atlanta, GA
Hemamalini B, Rajendran C (2000) Determination of the number of containers, production Kanbans and withdrawal Kanbans; and scheduling in Kanban flowshops – part 1. Int J Prod Res 38:2529–2548
Berkley BJ (1996) A simulation study of container size in two-card Kanban system. Int J Prod Res 34:3417–3445
Philipoom PR, Rees LP, Taylor III BW (1996) Simultaneously determining the number of Kanbans, container sizes and the final-assembly sequence of products in a just-in-time shop. Int J Prod Res 34:51–69
Sharadapriyadarshini B, Rajendran C (1997) Heuristics for scheduling in a Kanban system with dual blocking mechanisms. Eur J Oper Res 103:439–452
Rajendran C (1999) Formulations and heuristics for scheduling in a Kanban flowshop to minimize the sum of weighted flowtime, weighted tardiness and weighted earliness of containers. Int J Prod Res 37:1137–1158
Nawaz M, Enscore Jr EE, Ham I (1983) A heuristic algorithm for the m-machine, n-job flowshop sequencing problem. OMEGA 11:91–95
Rajendran C (1993) Heuristic algorithm for scheduling in a flowshop to minimize total flowtime. Int J Prod Econ 29:65–73
Deb K (2001) Multi-objective optimization using evolutionary algorithms, 1st ed. Wiley, New York
Taillard E (1993) Benchmarks for basic scheduling problems. Eur J Oper Res 64:278–285
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Deva Prasad, S., Krishnaiah Chetty, O. & Rajendran, C. A genetic algorithmic approach to multi-objective scheduling in a Kanban-controlled flowshop with intermediate buffer and transport constraints. Int J Adv Manuf Technol 29, 564–576 (2006). https://doi.org/10.1007/s00170-005-2517-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-005-2517-0