تخطي إلى التنقل الرئيسي تخطي إلى البحث تخطي إلى المحتوى الرئيسي

Scheduling with Job-Dependent Setup Times and Learning Effects on a Single Machine.

المشروع: RESEARCH PROJECT

تفاصيل المشروع

Description

We study a single machine scheduling problem with job-dependent setup times and learning effects. The setup times are past-sequence-dependent defined as the unique functions of the length of the already processed jobs, and the learning effects are log-linear showing that the actual processing times are unique functions of the positions of jobs in a sequence. The goal is to determine the optimal sequence that minimizes each of the objective functions: the total weighted completion times, the total absolute differences in waiting times, the sum of the ?th (?>0) power of completion times, the maximum lateness, the maximum tardiness, and the total tardiness. We will show that special cases of the resulting problems are solvable optimally in polynomial time; however, the general cases cannot be tackled polynomially. Consequently, we will develop branch-and-bound methods to derive the optimal sequences with respect to the total weighted completion times and the total absolute differences in waiting times, and heuristic methods to approximate the solutions with respect to the other four objective functions. Extensive computational results will be also presented to demonstrate the performance of the proposed branch-and-bound and heuristic methods on various size problem instances.
الحالةمنتهي
تاريخ البدء/النهاية الساري1/09/12 → 31/08/13

بصمة

استكشف موضوعات البحث التي تناولها هذا المشروع. يتم إنشاء هذه الملصقات بناءً على الجوائز/المنح الأساسية. فهما يشكلان معًا بصمة فريدة.