Infinity substitute in exactly minimizing total tardiness in tight-tardy progressive 1-machine scheduling by idling-free preemptions of equal-length jobs
A schedule ensuring the exactly minimal total tardiness can be found by the respective integer linear programming problem with infinities. In real computations, the infinity which shows that the respective states are either forbidden or impossible is substituted with a sufficiently great positive in...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
V. N. Karazin Kharkiv National University
2019-12-01
|
| Series: | Вісник Харківського національного університету імені В.Н. Каразіна. Серія: Математичне моделювання, інформаційні технології, автоматизовані системи управління |