Abstract
Given a set of n independent jobs with deterministic processing times and the same ready times, the problem is to find the optimal processing-time multiple k+ for the TWK-power due-date assignment method, and the optimal job sequence σ+ to minimize a total cost function. It is found that k+ is a function of job sequence and σ+ should be in SPT sequence. After the theoretical treatment, a numerical example is given for discussion.
Original language | English |
---|---|
Pages (from-to) | 1-7 |
Number of pages | 7 |
Journal | International Journal of Systems Science |
Volume | 18 |
Issue number | 1 |
DOIs | |
Publication status | Published - 1 Jan 1987 |
Externally published | Yes |
ASJC Scopus subject areas
- Control and Systems Engineering
- Theoretical Computer Science
- Computer Science Applications