Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan

Dvir Shabtay, Moshe Zofi

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

We study a single machine scheduling problem, where job processing times are controllable, and there is a fixed machine unavailability interval. We assume that the job processing time is a convex decreasing function of the amount of resource allocated to its processing operation. We further assume that there is a budget restriction on the total resource allocation cost. Our aim is to find a job schedule that minimizes the makespan. We prove that the problem is NP-hard and develop both a constant factor approximation algorithm and a fully polynomial time approximation scheme (FPTAS) for solving it. The FPTAS is obtained despite the fact that we could not design a pseudo-polynomial time algorithm for finding the optimal solution.

Original languageEnglish
Pages (from-to)191-200
Number of pages10
JournalInternational Journal of Production Economics
Volume197
DOIs
StatePublished - 1 Mar 2018

Keywords

  • Approximation algorithm
  • Controllable processing time
  • Machine unavailability period
  • Makespan
  • Resource allocation
  • Single machine scheduling

ASJC Scopus subject areas

  • Business, Management and Accounting (all)
  • Economics and Econometrics
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering

Fingerprint

Dive into the research topics of 'Single machine scheduling with controllable processing times and an unavailability period to minimize the makespan'. Together they form a unique fingerprint.

Cite this