Hits:

Date:2019-03-09

Indexed by:Journal Article

Date of Publication:2009-11-01

Journal:INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY

Included Journals:Scopus、EI、SCIE

Volume:45

Issue:3-4

Page Number:336-340

ISSN:0268-3768

Key Words:Scheduling; Single-machine; Learning effect; Deteriorating jobs; Makespan

Abstract:The paper deals with the single-machine scheduling problem with a sum-of-processing-time- based learning effect and deteriorating jobs. By the effects of sum-of-processing-time-based learning and deterioration, we mean that the processing time of a job is defined by function of its starting time and total normal processing time of jobs in front of it in the sequence. It is shown that, even with the introduction of the effects of sum-of-processing-time-based learning and deterioration to job processing times, the single-machine makespan minimization problem remains polynomially solvable.