ویراساینس.
سند علمی

Some scheduling problems with deteriorating jobs and learning effects

Dar-Li Yang, Wen-Hung Kuo

چکیده

Although scheduling with deteriorating jobs and learning effect has been widely investigated, scheduling research has seldom considered the two phenomena simultaneously. However, job deterioration and learning co-exist in many realistic scheduling situations. In this paper we introduce a new scheduling model in which both job deterioration and learning exist simultaneously. The actual processing time of a job depends not only on the processing times of the jobs already processed but also on its scheduled position. For the single-machine case, we derive polynomial-time optimal solutions for the problems to minimize makespan and total completion time. In addition, we show that the problems to minimize total weighted completion time and maximum lateness are polynomially solvable under certain agreeable conditions. For the case of an m-machine permutation flowshop, we present polynomial-time optimal solutions for some special cases of the problems to minimize makespan and total completion time.

اسناد مشابه

  • Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects

    سند علمی۲۰۰۸Inf. Sci.T. C. Edwin Cheng, Chin-Chia Wu, Wen-Chiung Lee

    In this paper we introduce a new scheduling model with learning effects in which the actual processing time of a job is a function of the total normal processing times of the jobs already processed and of the job’s scheduled position. We show that the single-machine problems to m

  • Scheduling Resumable Deteriorating Jobs

    سند علمی۲۰۰۸Alexander Kononov

    We consider the following single-machine time-dependent scheduling problem with constraints on the machine availability. There is given a set of independent and deteriorating jobs Jj , 1 ≤ j ≤ n, to be processed on a single machine, starting from time t0 > 0. The processing time

  • Two-agent group scheduling with deteriorating jobs on a single machine

    سند علمی۲۰۱۰Peng Liu, Lixin Tang, Xiaoye Zhou

    This paper considers the two-agent scheduling problems with deteriorating jobs and group technology on a single machine, where the objective is to minimize the total completion time of the first agent with the restriction that the maximum cost of the second agent cannot exceed a

  • Job shop scheduling problem based on learning effects, flexible maintenance activities and transportation times

    مقاله۲۰۱۹Journal of Industrial and Systems Engineeringhamed mousavipoor, Hiwa Farughi, Fardin Ahmadizar

    Nowadays, scholars do their best to study more practical aspects of classical problems. Job shop Scheduling Problem (JSSP) is an important and interesting problem in scheduling literature which has been studied from different aspects so far. Considering assumptions like learning

  • A note on due-date assignment and single-machine scheduling with deteriorating jobs

    سند علمی۲۰۰۴Applied Mathematics and ComputationW.-H. Kuo, Dar-Li Yang

    We study a scheduling problem with deteriorating jobs, i.e., jobs whose processing times are an increasing function of their start times. We consider the case of a single machine and linear job-independent deterioration. The problem is to determine an optimal combination of the d

  • Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time

    سند علمی۲۰۱۵JORSMingbao Cheng, Pandu R. Tadikamalla, Jennifer Shang, Bixi Zhang

    This paper considers a two-machine flow shop scheduling problem with deteriorating jobs in which the processing times of jobs are dependent on their starting times in the sequence. The objective is to minimize the weighted sum of makespan and total completion time. To analyse the