• A
  • A
  • A
  • АБB
  • АБB
  • АБB
  • А
  • А
  • А
  • А
  • А
Обычная версия сайта
Найдены 3 публикации
Сортировка:
по названию
по году
Статья
Belov A. A., Andrianova O. International Journal of Systems Science. 2019. Vol. 50. No. 6. P. 1303-1312.
Добавлено: 2 мая 2019
Статья
Pei J., Liu X., Pardalos P. M. et al. International Journal of Systems Science. 2015. Vol. 47. No. 4. P. 765-776.

Motivated by applications in manufacturing industry, we consider a supply chain scheduling problem, where each job is characterised by non-identical sizes, different release times and unequal processing times. The objective is to minimise the makespan by making batching and sequencing decisions. The problem is formalised as a mixed integer programming model and proved to be strongly NP-hard. Some structural properties are presented for both the general case and a special case. Based on these properties, a lower bound is derived, and a novel two-phase heuristic (TP-H) is developed to solve the problem, which guarantees to obtain a worst case performance ratio of . Computational experiments with a set of different sizes of random instances are conducted to evaluate the proposed approach TP-H, which is superior to another two heuristics proposed in the literature. Furthermore, the experimental results indicate that TP-H can effectively and efficiently solve large-size problems in a reasonable time.

Добавлено: 28 сентября 2015
Статья
Hernandez-Sanchez A., Andrianova O., Poznyak A. et al. International Journal of Systems Science. 2020. P. 1-14.
Добавлено: 21 октября 2020