Spatial scheduling and workforce assignment problem in block assembly shop of shipbuilding. (English) Zbl 1294.90027
Summary: For shipbuilding, spatial scheduling and workforce assignment are two important issues for the operation management in block assembly shops. Spatial scheduling is to decide where and when to assemble blocks, while workforce assignment is to assign working teams to the blocks. Traditionally, they are made separately at different levels in the production management framework. The combining of such decisions presents additional complexity and new problems. This paper proposes an approach that solves jointly the spatial scheduling problem and the workforce assignment problem. The objective is to improve the coordination among working teams and increase the productivity of assembly shops. A spatial layout strategy is designed according to extreme point and deep bottom left strategies. By using genetic algorithm, a solution method is developed based on the spatial layout strategy and several assignment and sequence rules. Some computational experiments are conducted to evaluate the performance of the presented algorithm and compare it with other commonly used methods. Computational results validate the effectiveness and efficiency of the proposed algorithm.
MSC:
| 90B35 | Deterministic scheduling theory in operations research |
| 90B80 | Discrete location and assignment |
Keywords:
shipbuilding; combinatorial optimization; spatial scheduling; workforce assignment; genetic algorithmReferences:
| [1] | DOI: 10.1007/s10479-008-0461-8 · Zbl 1201.90109 · doi:10.1007/s10479-008-0461-8 |
| [2] | DOI: 10.1287/ijoc.11.1.78 · Zbl 1034.90506 · doi:10.1287/ijoc.11.1.78 |
| [3] | DOI: 10.1287/ijoc.1070.0250 · Zbl 1243.90088 · doi:10.1287/ijoc.1070.0250 |
| [4] | DOI: 10.1016/j.ejor.2007.06.063 · Zbl 1161.90012 · doi:10.1016/j.ejor.2007.06.063 |
| [5] | DOI: 10.1016/j.ejor.2010.03.030 · Zbl 1205.90121 · doi:10.1016/j.ejor.2010.03.030 |
| [6] | Goldberg D. E., Genetic Algorithms in Search, Optimization, and Machine Learning (1989) · Zbl 0721.68056 |
| [7] | Koh S. G., IE Interface 12 pp 586– |
| [8] | DOI: 10.1016/0957-4174(96)00010-3 · doi:10.1016/0957-4174(96)00010-3 |
| [9] | DOI: 10.1016/S0377-2217(96)00205-6 · Zbl 0930.90028 · doi:10.1016/S0377-2217(96)00205-6 |
| [10] | DOI: 10.1137/0219059 · Zbl 0711.68061 · doi:10.1137/0219059 |
| [11] | Loris F., European Journal of Operational Research 126 pp 340– |
| [12] | Lozano P. T., IEEE Transactions on Computers 32 pp 108– |
| [13] | DOI: 10.1016/j.rcim.2009.06.001 · doi:10.1016/j.rcim.2009.06.001 |
| [14] | Najid N. M., Proceedings of the IEEE International Conference on Systems, Man and Cybernetics 5 pp 89– |
| [15] | DOI: 10.1016/0360-8352(96)00004-6 · doi:10.1016/0360-8352(96)00004-6 |
| [16] | DOI: 10.1080/095372802760108309 · doi:10.1080/095372802760108309 |
| [17] | DOI: 10.1007/978-1-4612-1098-6 · doi:10.1007/978-1-4612-1098-6 |
| [18] | DOI: 10.1080/09511920701819163 · doi:10.1080/09511920701819163 |
| [19] | DOI: 10.1109/TSMCB.2004.842412 · doi:10.1109/TSMCB.2004.842412 |
| [20] | DOI: 10.1016/j.ejor.2011.01.021 · doi:10.1016/j.ejor.2011.01.021 |
| [21] | DOI: 10.1080/00207541003709536 · doi:10.1080/00207541003709536 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
