Single-machine scheduling with time-and-resource-dependent processing times

Cai Min Wei, Ji Bo Wang, Ping Ji

Research output: Journal article publicationJournal articleAcademic researchpeer-review

49 Citations (Scopus)

Abstract

We consider single-machine scheduling problems in which the processing time of a job is a function of its starting time and its resource allocation. The objective is to find the optimal sequence of jobs and the optimal resource allocation separately. We concentrate on two goals separately, namely, minimizing a cost function containing makespan, total completion time, total absolute differences in completion times and total resource cost; minimizing a cost function containing makespan, total waiting time, total absolute differences in waiting times and total resource cost. We show that the problems remain polynomially solvable under the proposed model.
Original languageEnglish
Pages (from-to)792-798
Number of pages7
JournalApplied Mathematical Modelling
Volume36
Issue number2
DOIs
Publication statusPublished - 1 Feb 2012

Keywords

  • Deteriorating jobs
  • Resource allocation
  • Scheduling
  • Single-machine

ASJC Scopus subject areas

  • Modelling and Simulation
  • Applied Mathematics

Cite this