Current position: Home >> Scientific Research >> Paper Publications

Scheduling deteriorating jobs with a learning effect on unrelated parallel machines

Release Time:2019-03-09  Hits:

Indexed by: Journal Article

Date of Publication: 2014-11-01

Journal: APPLIED MATHEMATICAL MODELLING

Included Journals: EI、SCIE

Volume: 38

Issue: 21-22

Page Number: 5231-5238

ISSN: 0307-904X

Key Words: Scheduling; Unrelated parallel machines; Learning effect; Deteriorating jobs

Abstract: In this study we consider unrelated parallel machines scheduling problems with learning effect and deteriorating jobs, in which the actual processing time of a job is a function of joint time-dependent deterioration and position-dependent learning. The objective is to determine the jobs assigned to corresponding each machine and the corresponding optimal schedule to minimize a cost function containing total completion (waiting) time, total absolute differences in completion (waiting) times and total machine load. If the number of machines is a given constant, we show that the problems can be solved in polynomial time under the time-dependent deterioration and position-dependent learning model. (C) 2014 Elsevier Inc. All rights reserved.

Prev One:Single machine common flow allowance scheduling with deteriorating jobs and a rate-modifying activity

Next One:Single-machine bicriterion group scheduling with deteriorating setup times and job processing times