Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity

Min Ji, Danli Yao, Qinyun Yang, Edwin Tai Chiu Cheng

Research output: Journal article publicationJournal articleAcademic researchpeer-review

8 Citations (Scopus)

Abstract

In this paper, we consider scheduling of deteriorating jobs on a single machine with slack (SLK) due date assignment, resource allocation, and a rate-modifying activity. The rate-modifying activity can change jobs' processing rates such that the actual processing time of a job depends on whether the job is processed before or after the rate-modifying activity. In addition, the actual processing time of a job also depends on its position in a processing sequence (i.e., the aging effect) and the amount of resource allocated to it. The objective is to determine the optimal sequence, optimal common flow allowance, optimal resource allocation, and optimal location of the rate-modifying activity to minimize a total penalty function comprising the earliness, tardiness, common flow allowance, and resource allocation costs. We consider two variants of the problem associated with two different processing time functions and provide a polynomial-time algorithm to solve each variant.
Original languageEnglish
Pages (from-to)997-1015
Number of pages19
JournalInternational Transactions in Operational Research
Volume22
Issue number6
DOIs
Publication statusPublished - 1 Jan 2015

Keywords

  • Aging effect
  • Common flow allowance
  • Rate-modifying activity
  • Resource allocation
  • Single-machine scheduling

ASJC Scopus subject areas

  • Business and International Management
  • Computer Science Applications
  • Strategy and Management
  • Management Science and Operations Research
  • Management of Technology and Innovation

Cite this