activity
20112021
most citedA Bound for the Number of Different Basic Solutions Generated by the Simplex Method

3 citations · 5 across the 5 of their papers we have counts for

collaborators
Showing 2021Show all

1 paper · 1 filter

cs.DS2021

A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion

Susumu Hashimoto, Shinji Mizuno

This paper studies a single-machine scheduling problem with a non-renewable resource (NR-SSP) and total weighted completion time criterion. The non-renewable resource is consumed w…