Notes on scheduling non-simultaneously released jobs with restricted processing times on uniform machines
We consider a basic optimization problem where non-simultaneously released jobs are to be scheduled on m uniform machines. The objective is to minimize the maximum job completion time. For the special case of the problem with equal-length jobs, in Dessouky et al . [ Statistica Neerlandica 44 (1990)...
Saved in:
| Published in: | R.A.I.R.O. Recherche opérationnelle Vol. 59; no. 5; pp. 2405 - 2418 |
|---|---|
| Main Author: | |
| Format: | Journal Article |
| Language: | English |
| Published: |
01.09.2025
|
| ISSN: | 0399-0559, 2804-7303 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!