مشخصات مقاله | |
ترجمه عنوان مقاله | مکانیزم تغییر شکل کاذب بین تخصیص منابع و بسته بندی با جعبه در محیط های بسته بندی |
عنوان انگلیسی مقاله | Pseudo transformation mechanism between resource allocation and bin-packing in batching environments |
انتشار | مقاله سال 2019 |
تعداد صفحات مقاله انگلیسی | 10 صفحه |
هزینه | دانلود مقاله انگلیسی رایگان میباشد. |
پایگاه داده | نشریه الزویر |
نوع نگارش مقاله |
مقاله پژوهشی (Research article) |
مقاله بیس | این مقاله بیس نمیباشد |
نمایه (index) | scopus – master journals – JCR |
نوع مقاله | ISI |
فرمت مقاله انگلیسی | |
ایمپکت فاکتور(IF) |
5.341 در سال 2017 |
شاخص H_index | 85 در سال 2019 |
شاخص SJR | 0.844 در سال 2017 |
شناسه ISSN | 0167-739X |
شاخص Quartile (چارک) | Q1 در سال 2017 |
رشته های مرتبط | مهندسی کامپیوتر |
گرایش های مرتبط | الگوریتم و محاسبات |
نوع ارائه مقاله |
ژورنال |
مجله / کنفرانس | سیستم های کامپیوتری نسل آینده – Future Generation Computer Systems |
دانشگاه | School of Computer Science and Technology, University of Science and Technology of China, Hefei 230026, China |
کلمات کلیدی | زمان بندی دسته ای، تخصیص منابع، مشکلات بسته بندی با جعبه، تغییر شکل کاذب |
کلمات کلیدی انگلیسی | Batch-scheduling, Resource allocation, Bin-packing problems, Pseudo transformation |
شناسه دیجیتال – doi |
https://doi.org/10.1016/j.future.2019.01.006 |
کد محصول | E11983 |
وضعیت ترجمه مقاله | ترجمه آماده این مقاله موجود نمیباشد. میتوانید از طریق دکمه پایین سفارش دهید. |
دانلود رایگان مقاله | دانلود رایگان مقاله انگلیسی |
سفارش ترجمه این مقاله | سفارش ترجمه این مقاله |
فهرست مطالب مقاله: |
Outline Highlights Abstract Keywords 1. Introduction 2. Preliminaries 3. Problem formulation 4. Characteristics 5. Transforming RCM into BPPs 6. Experimental study 7. Conclusions Acknowledgments References |
بخشی از متن مقاله: |
Abstract Job planning with resource allocations constitutes a classical subfield of scheduling. This research is devoted to connecting a batch-scheduling problem with resource allocations to a bin-packing problem (BPP). A mechanism of transforming the batch-scheduling problem into BPP is proposed. Based on the transformation mechanism, a heuristic is proposed by utilizing an effective approach for BPP. In order to evaluate the efficiency of the proposed heuristic, extensive experiments are carried out on the performance comparisons against several available methods. The results show that the proposed heuristic can be a strong alternative for the problem under study, which, in turn, demonstrates the effectiveness of the proposed mechanism.Introduction Scheduling with resource allocations originates from various real-life systems [1–4], where the processing or setup times are controllable by resource allocations such as money, energy, fuel or additional manpower. Since more and more people from industrial or academic areas are concerned about improving the resource efficiency, deep investigation into this subfield has high practical significance. Since its appearance in [5,6], lots of researches have been devoted to this subfield of scheduling. The following lists two criteria (other criteria can be found in [7]) that can be used to classify researches in the subfield. On the one hand, according to the machine settings, the relevant researches can be categorized as follows: single machine scheduling [8–13], parallel machine scheduling [14], flow-shop scheduling [15,16], and batch-scheduling [17–22]. On the other hand, researches in this subfield can also be classified into the following categories: scheduling without or with resource constraints. The former problem setting receives more attention in relevant researches [17,18]. The latter setting assumes that the allocations for each operation should not exceed the maximal amount. Such constraints are called technological constraints hereafter. |