FLOW SHOP GROUP SCHEDULING WITH LIMITED BUFFER CAPACITY AND DIFFERENT WORKFORCE
G. Celano, A. Costa, S. Fichera
2011
Abstract
A permutational flowshop group scheduling problem (GSP) with sequence dependent set-up times, finite interoperational buffer capacity and workers with different skills has been investigated in this paper. The set-up times are influenced by the sequence of groups and the worker skill level; the manufacturing tasks on a part are completely automated and the working times do not depend on the operator’s skill. The minimization of the completion time is the objective of the group scheduling. A Genetic Algorithm is proposed as an efficient tool to solve the investigated problem; a benchmark of problems has been generated to investigate the influence of the inter-operational buffer capacity and the worker skill level on the completion time.
References
- Diginesi S.; Kock A., Mummolo G., Rooda J., (2009). The effect of dynamic worker behavior on flow line performance. International Journal of Production Economics, 120 (2), 368-377.
- Fowler J., Wirojanagud P., Gel E., (2008). Heuristics for workforce planning with worker differences. European Journal of Operational Research, 190 (3), 724-740.
- França, P. M., Gupta, J. N. D., Mendes, A. S., Moscato, P., Veltink, K. J., (2005). Evolutionary algorithms for scheduling a flowshop manufacturing cell with sequence dependent family set-ups. Computers & Industrial Engineering, 48 (3), 491-506.
- McDonald T., Ellisb K., Van Akenb E., Koellingb C., (2009). Development and application of a worker assignment model to evaluate a lean manufacturing cell. International Journal of Production Research, 47 (9), 2427-2447.
- Nowicki, E., (1999). The permutation flow shop with buffers. A tabu search approach. European Journal of Operational Research, 116, 205-219.
- Qian, B., Wang, L., Huang, D., Wang, W., Wang, X., (2009). An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers. Computers & Operations Research, 36, 209- 233.
- Schaller, J. E., (2000). A comparison of heuristics for family and job scheduling in a flow-line manufacturing cell. International Journal of Production Research, 38(2), 287-308.
- Shridar, J., Rajendran, C., (1994). A genetic algorithm for family and job scheduling in a flow-line manufacturing cell. Computers and Industrial Engineering, 27, 469-472.
- Vakharia, A. J., Chang, Y. L, (1990). A simulated annealing approach to scheduling a manufacturing cell. Naval Research Logistics, 37, 559-577.
- Wang, L., Zhang, L., Zheng, D. Z., (2006). An effective hybrid genetic algorithm for flow shop scheduling with limited buffers. Computers & Operations Research, 33, 2960-2971.
- Wemmerlov, U., Vakharia, A. J., (1991). Job and family scheduling of a flow-line manufacturing cell: a simulation study. IIE Transactions, 23(4), 383-392.
Paper Citation
in Harvard Style
Celano G., Costa A. and Fichera S. (2011). FLOW SHOP GROUP SCHEDULING WITH LIMITED BUFFER CAPACITY AND DIFFERENT WORKFORCE . In Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 2: MSIE, (ICINCO 2011) ISBN 978-989-8425-75-1, pages 486-491. DOI: 10.5220/0003648704860491
in Bibtex Style
@conference{msie11,
author={G. Celano and A. Costa and S. Fichera},
title={FLOW SHOP GROUP SCHEDULING WITH LIMITED BUFFER CAPACITY AND DIFFERENT WORKFORCE},
booktitle={Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 2: MSIE, (ICINCO 2011)},
year={2011},
pages={486-491},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003648704860491},
isbn={978-989-8425-75-1},
}
in EndNote Style
TY - CONF
JO - Proceedings of the 8th International Conference on Informatics in Control, Automation and Robotics - Volume 2: MSIE, (ICINCO 2011)
TI - FLOW SHOP GROUP SCHEDULING WITH LIMITED BUFFER CAPACITY AND DIFFERENT WORKFORCE
SN - 978-989-8425-75-1
AU - Celano G.
AU - Costa A.
AU - Fichera S.
PY - 2011
SP - 486
EP - 491
DO - 10.5220/0003648704860491