An improved hybrid model for the generic hoist scheduling problem

Збережено в:

Бібліографічні деталі
Опубліковано в::	Annals of Operations Research vol. 115, no. 1 (Sep 2002), p. 173
Автор:	Riera, Daniel
Інші автори:	Yorke-Smith, Neil
Опубліковано:	Springer Nature B.V.
Предмети:	Computer programming Models Scheduling Studies Employment Logic programming Hybridization Mathematical programming Integer programming Algorithms Cranes & hoists Operations research
Онлайн доступ:	Citation/Abstract Full Text Full Text - PDF
Теги:	Додати тег Немає тегів, Будьте першим, хто поставить тег для цього запису!

Опис
Короткий огляд:	The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a unified model has been developed with the problem description and solution method separated. We provide an improved model and new preprocessing stages where, as before, solutions and proof of optimality are provided by a hybrid CLP-MIP algorithm. The new algorithm is more scalable and robust. We give empirical results for a range of problem classes on benchmark problems from several sources. [PUBLICATION ABSTRACT]
ISSN:	0254-5330 1572-9338
Джерело:	ABI/INFORM Global