Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads

نتاج البحث: نشر في مجلةمقالةمراجعة النظراء

2 اقتباسات (Scopus)

ملخص

We study minmax due-date based on common flow-allowance assignment and scheduling problems on a single machine, and extend known results in scheduling theory by considering convex resource allocation. The total cost function of a given job consists of its earliness, tardiness and flow-allowance cost components. Thus, the common flow-allowance and the actual jobs’ processing times are decision variables, implying that the due-dates and actual processing times can be controlled by allocating additional resource to the job operations. Consequently, our goal is to optimize a cost function by seeking the optimal job sequence, the optimal job-dependent due-dates along with the actual processing times. In all addressed problems we aim to minimize the maximal cost among all the jobs subject to a constraint on the resource consumption. We start by analyzing and solving the problem with position-independent workloads and then proceed to position-dependent workloads. Finally, the results are generalized to the method of common due-window. For all studied problems closed form solutions are provided, leading to polynomial time solutions.

اللغة الأصليةالإنجليزيّة
الصفحات (من إلى)79-97
عدد الصفحات19
دوريةJournal of Combinatorial Optimization
مستوى الصوت43
رقم الإصدار1
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - يناير 2022

بصمة

أدرس بدقة موضوعات البحث “Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا