research
∙
12/02/2022
A 4/3· OPT+2/3 approximation for big two-bar charts packing problem
Two-Bar Charts Packing Problem is to pack n two-bar charts (2-BCs) in a ...
share
research
∙
04/08/2020
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes
We consider the routing flow shop problem with two machines on an asymme...
research
∙
09/23/2019
LP-based algorithms for multistage minimization problems
We consider a multistage framework introduced recently where, given a ti...
research
∙
11/28/2018
Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems
We consider a problem of scheduling rigid parallel jobs on variable spee...
research
∙
03/17/2017