Abstract
In this paper, we consider single machine scheduling problems with controllable processing time (resource allocation), truncated job-dependent learning and deterioration effects. The goal is to find the optimal sequence of jobs and the optimal resource allocation separately for minimizing a cost function containing makespan (total completion time, total absolute differences in completion times) and/or total resource cost. For two different processing time functions, i.e., a linear and a convex function of the amount of a common continuously divisible resource allocated to the job, we solve them in polynomial time respectively.
Original language | English |
---|---|
Pages (from-to) | 1025-1039 |
Number of pages | 15 |
Journal | Journal of Industrial and Management Optimization |
Volume | 13 |
Issue number | 2 |
DOIs | |
Publication status | Published - 1 Apr 2017 |
Keywords
- Deterioration job
- Learning effect
- Resource allocation
- Scheduling
ASJC Scopus subject areas
- Business and International Management
- Strategy and Management
- Control and Optimization
- Applied Mathematics