Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
Approximation algorithms for combinatorial problems J Comput | 1974 | |||
Proc IFIP Cong. | 1974 | |||
j. Comput. Syst. Sc~. 10, ~ (Jan | 1975 | |||
Pennsylvania State U. | 1974 | |||
Computationally related problems SIAM J. Com~ut $, 4 (Dec | 1974 |
Title | Journal | Journal Categories | Citations | Publication Date |
---|---|---|---|---|
A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops | Annals of Operations Research |
| 2024 | |
Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines | Journal of Combinatorial Optimization |
| 2024 | |
Trimming-the-state-space mechanism embedded branch-and-bound algorithm for two-parallel machines scheduling with availability constraints | Computers & Industrial Engineering |
| 2024 | |
Quantum annealing-driven branch and bound for the single machine total weighted number of tardy jobs scheduling problem | Future Generation Computer Systems |
| 2024 | |
Worst-case analysis of LPT scheduling on a small number of non-identical processors | Information Processing Letters |
| 2024 |