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]
আইএসএসএন:	0254-5330 1572-9338
সম্পদ:	ABI/INFORM Global