Strong NP-hardness of two-machine flow-shop scheduling with periodic due dates(具有等间隔工期的2台机器流水作业调度问题的强NP难性)
we consider three two-machine flow-shop scheduling problems with periodic due dates, where each due date is assigned not to a specific job but to the processing order and the lengths of the intervals between two consecutive due dates are identical. The objectives are to minimize the maximum tardines...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Zhejiang University Press
2024-09-01
|
| Series: | Zhejiang Daxue xuebao. Lixue ban |
| Subjects: | |
| Online Access: | https://doi.org/10.3785/j.issn.1008-9497.2024.05.010 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|