Maximizing the weighted number of just-in-time jobs in a distributed flow-shop scheduling system

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

ملخص

We study a set of scheduling problems in a distributed flow-shop scheduling system consisting of several flow-shop production systems (factories) working in parallel. Our objective is to assign the jobs to the factories, and to devise a job schedule for each of the factories such that the weighted number of jobs completed in just-in-time mode is maximized. We classify computational complexity of the problems, including the special cases of unit weights and job- or machine-independent processing times.

اللغة الأصليةإنجليزيّة أمريكيّة
الصفحات (من إلى)274-283
عدد الصفحات10
دوريةNaval Research Logistics
مستوى الصوت70
رقم الإصدار3
المعرِّفات الرقمية للأشياء
حالة النشرنُشِر - 1 أبريل 2023

All Science Journal Classification (ASJC) codes

  • !!Modeling and Simulation
  • !!Ocean Engineering
  • !!Management Science and Operations Research

بصمة

أدرس بدقة موضوعات البحث “Maximizing the weighted number of just-in-time jobs in a distributed flow-shop scheduling system'. فهما يشكلان معًا بصمة فريدة.

قم بذكر هذا