Author of the publication

A note on the algorithm LPT-FF for a flowshop scheduling with two batch-processing machines.

, , and . Optim. Lett., 10 (1): 109-118 (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Minimizing total job completion time in MapReduce scheduling., , , , and . Comput. Ind. Eng., (2021)A General Edit Distance between RNA Structures., , , and . J. Comput. Biol., 9 (2): 371-388 (2002)Rnall: an Efficient Algorithm for Predicting Rna Local Secondary Structural Landscape in Genomes., , and . J. Bioinform. Comput. Biol., 4 (5): 1015-1032 (2006)Algorithms for Communication Scheduling in Data Gathering Network with Data Compression., , , , , and . Algorithmica, 80 (11): 3158-3176 (2018)Improved Approximation Algorithms for Path Vertex Covers in Regular Graphs., , , and . Algorithmica, 82 (10): 3041-3064 (2020)Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles., , , , , and . Theor. Comput. Sci., (2021)Smoothed heights of tries and patricia tries., , and . Theor. Comput. Sci., (2016)A Further Improved Approximation Algorithm for Breakpoint Graph Decomposition., and . J. Comb. Optim., 8 (2): 183-194 (2004)Path cover with minimum nontrivial paths and its application in two-machine flow-shop scheduling with a conflict graph., , , , , , , and . J. Comb. Optim., 43 (3): 571-588 (2022)Planar graphs are acyclically edge (Δ+ 5)-colorable., and . CoRR, (2023)