An improved hybrid model for the generic hoist scheduling problem

Đã lưu trong:

Chi tiết về thư mục
Xuất bản năm:	Annals of Operations Research vol. 115, no. 1 (Sep 2002), p. 173
Tác giả chính:	Riera, Daniel
Tác giả khác:	Yorke-Smith, Neil
Được phát hành:	Springer Nature B.V.
Những chủ đề:	Computer programming Models Scheduling Studies Employment Logic programming Hybridization Mathematical programming Integer programming Algorithms Cranes & hoists Operations research
Truy cập trực tuyến:	Citation/Abstract Full Text Full Text - PDF
Các nhãn:	Thêm thẻ Không có thẻ, Là người đầu tiên thẻ bản ghi này!

Miêu tả
Bài tóm tắt:	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]
số ISSN:	0254-5330 1572-9338
Nguồn:	ABI/INFORM Global