Article thumbnail

Due Date Single Machine Scheduling Problems with Nonlinear Deterioration and Learning Effects and Past Sequence Dependent Setup Times

By Hüseyin Ceylan

Abstract

We present some problems against due dates with nonlinear learning and deterioration effects and past sequence dependent setup times. In this study, two effects (learning and deterioration) are used for the same processing time. The processing time of a job is shorter if it is scheduled later, rather than in the sequence. This phenomenon is known in the literature as a “learning effect.” On the other hand, in many realistic scheduling settings, a job processed later consumes more time than the same job processed earlier—this is known as scheduling with deteriorating jobs. In the past sequence dependent setup times approach, the setup time of a job is proportionate to the sum of processing times of the jobs already scheduled. In this study, we demonstrated that some problems with due dates remain polynomially solvable. However, for some other problems, we concentrated on finding polynomially solves under their special cases

Topics: Engineering (General). Civil engineering (General), TA1-2040, Mathematics, QA1-939
Publisher: Hindawi Limited
Year: 2014
DOI identifier: 10.1155/2014/682738
OAI identifier: oai:doaj.org/article:f3527ebe7a2b4d63830f844c196e37cc
Journal:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://doaj.org/toc/1563-5147 (external link)
  • https://doaj.org/toc/1024-123X (external link)
  • http://dx.doi.org/10.1155/2014... (external link)
  • https://doaj.org/article/f3527... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.