Skip to main navigation Skip to search Skip to main content

Single-machine scheduling with convex resource allocation, learning effects, job deterioration, and setup times.

Project: RESEARCH PROJECT

Project Details

Description

This paper addresses several multicriteria single machine scheduling problems wherein a job processing time is either a convex or linear function of the amount of resource assigned to the job, learning and ageing are job-dependent and position-based, job deterioration linearly depends on the job starting time, and the job's setup time is proportional to the duration of the already processed jobs. The goal is to jointly determine the optimal resource allocations and the optimal sequence with respect to the total resource cost and a composite cost function of some criteria. We formulate the proposed multicriteria problems as constrained and unconstrained combinatorial optimisation models and introduce polynomial time algorithms to derive the optimal solutions.

StatusFinished
Effective start/end date1/07/14 → 30/06/15

Keywords

  • Scheduling
  • resource allocation
  • learning
  • deterioration
  • setup time.

Fingerprint

Explore the research topics touched on by this project. These labels are generated based on the underlying awards/grants. Together they form a unique fingerprint.