Branch Less, Cut More and Schedule Jobs with Release and Delivery Times on Uniform Machines
We consider the problem of scheduling <i>n</i> jobs with identical processing times and given release as well as delivery times on <i>m</i> uniform machines. The goal is to minimize the makespan, i.e., the maximum full completion time of any job. This problem is well-known to...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-03-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/9/6/633 |