On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost
Authors:
- 1 January 2012
- book chapter
- Published by Springer Nature
- p. 482-493
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Primal-Dual Approximation Algorithm for Min-Sum Single-Machine Scheduling ProblemsLecture Notes in Computer Science, 2011
- Universal Sequencing on a Single Machine2010
- Increasing Speed Scheduling and Flow SchedulingLecture Notes in Computer Science, 2010
- Server Scheduling to Balance Priorities, Fairness, and Average Quality of ServiceSIAM Journal on Computing, 2010
- Online weighted flow time and deadline schedulingJournal of Discrete Algorithms, 2006
- An improved precedence rule for single machine sequencing problems with quadratic penaltyEuropean Journal of Operational Research, 2000
- Approximation schemes for minimizing average weighted completion time with release dates1999
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey1979
- The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound SolutionManagement Science, 1978
- Various optimizers for single‐stage productionNaval Research Logistics Quarterly, 1956