ISSN: 1896-382X
eISSN: 2353-2866
OAI
DOI: 10.18276/epu.2016.122-35
Issue archive /
nr 122 2016
Metaheuristic algorithms for scheduling on parallel machines with variable set-up times
| Authors: |
Radosław
Rudek
Wrocław University of Economics Agnieszka Wielgus Wrocław University of Technology |
| Keywords: | scheduling parallel machines setup times learning |
| Data publikacji całości: | 2016 |
| Page range: | 10 (369-378) |
Abstract
In order to meet growing demands of the market modern manufacturing and service environments must offer an increasingly broad range of services or products as well as ensure their required amount and short lead times. It can be done by the application of universal machines or workers which are able to perform different tasks. On the other hand, human activity environments are often affected by learning. Therefore, in this paper, we analyse related problems, which can be expressed as the makespan minimization scheduling problem on identical parallel machines with variable setup times affected by learning of workers. To provide an efficient schedule, we propose metaheuristic algorithms. Their potential applicability is verified numerically.
Download file
Article file
Bibliography
| 1. | Allahverdi, A. (2015). The third comprehensive survey on scheduling problems with setup times/costs. European Journal of Operational Research, 246, pp. 345–378. |
| 2. | Biskup, D. (2008). A state-of-the-art review on scheduling with learning effects. Euro-pean Journal of Operational Research, 188, pp. 315–329. |
| 3. | Kirkpatrick, S. and Gelatt, C. D. and Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220, pp. 671–680. |
| 4. | Kuo, W.-H. and Hsu, C.-J. and Yang, D.-L. (2011). Some unrelated parallel machine scheduling problems with past-sequence-dependent setup time and learning effects. Computers & Industrial Engineering, 61, pp. 179–183. |
| 5. | Pinedo, M. (2012). Scheduling: Theory, Algorithms and Systems (4rd ed.). New York: Springer, 2012. |
| 6. | Rudek, R. (2013). On single processor scheduling problems with learning dependent on the number of processed jobs. Applied Mathematical Modelling, 37, pp. 1523–1536. |