Back to Search
Start Over
Single machine scheduling problems with controllable processing times and total absolute differences penalties
- Source :
- European Journal of Operational Research. 177:638-645
- Publication Year :
- 2007
- Publisher :
- Elsevier BV, 2007.
-
Abstract
- In this paper, we consider single machine scheduling problem in which job processing times are controllable variables with linear costs. We concentrate on two goals separately, namely, minimizing a cost function containing total completion time, total absolute differences in completion times and total compression cost; minimizing a cost function containing total waiting time, total absolute differences in waiting times and total compression cost. The problem is modelled as an assignment problem, and thus can be solved with the well-known algorithms. For the case where all the jobs have a common difference between normal and crash processing time and an equal unit compression penalty, we present an O(n log n) algorithm to obtain the optimal solution.
- Subjects :
- Mathematical optimization
Information Systems and Management
business.product_category
Single-machine scheduling
General Computer Science
Real-time computing
Management Science and Operations Research
Industrial and Manufacturing Engineering
Variable cost
Scheduling (computing)
Controllability
Paper machine
Modeling and Simulation
Minification
business
Assignment problem
Time complexity
Mathematics
Subjects
Details
- ISSN :
- 03772217
- Volume :
- 177
- Database :
- OpenAIRE
- Journal :
- European Journal of Operational Research
- Accession number :
- edsair.doi.dedup.....9a291e54f9824f3355f369b34c60002e