Worst-Case Analysis of an Approximation Algorithm for Single Machine Scheduling Problem
Saved in:
| Main Author: | Natalia Grigoreva |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Polish Information Processing Society
2021-09-01
|
| Series: | Annals of computer science and information systems |
| Online Access: | https://annals-csis.org/Volume_25/drp/pdf/66.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Best Possible Approximation Algorithms for Single Machine Scheduling with Increasing Linear Maintenance Durations
by: Xuefei Shi, et al.
Published: (2014-01-01) -
Multiprocessor Scheduling Problem with Release and Delivery Times
by: Natalia Grigoreva
Published: (2020-09-01) -
Approximation Algorithms and an FPTAS for the Single Machine Problem with Biased Tardiness Penalty
by: G. Moslehi, et al.
Published: (2014-01-01) -
A Combinatorial Approximation Algorithm for the Vector Scheduling with Submodular Penalties on Parallel Machines
by: Bihui Cheng, et al.
Published: (2023-01-01) -
A new metaheuristic algorithm for solving multi-objective single-machine scheduling problems
by: Khraibet Tahani Jabbar, et al.
Published: (2025-02-01)