Parallel-machine scheduling with controllable processing times and rate-modifying activities to minimise total cost involving total completion time and job compressions

Dar Li Yang, Edwin Tai Chiu Cheng, Suh Jenq Yang

Research output: Journal article publicationJournal articleAcademic researchpeer-review

32 Citations (Scopus)


In this paper, we consider unrelated parallel-machine scheduling involving controllable processing times and rate-modifying activities simultaneously. We assume that the actual processing time of a job can be compressed by allocating a greater amount of a common resource to process the job. We further assume that each machine may require a rate-modifying activity during the scheduling horizon. The objective is to determine the optimal job compressions, the optimal positions of the rate-modifying activities and the optimal schedule to minimise a total cost function that depends on the total completion time and total job compressions. If the number of machines is a given constant, we propose an efficient polynomial time algorithm to solve the problem.
Original languageEnglish
Pages (from-to)1133-1141
Number of pages9
JournalInternational Journal of Production Research
Issue number4
Publication statusPublished - 16 Feb 2014


  • controllable processing time
  • rate-modifying activity
  • scheduling
  • unrelated parallel-machine

ASJC Scopus subject areas

  • Strategy and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Cite this