Approximation algorithms for some discrete-continuous scheduling problems
The considered problem is formulated in a popular way as follows: \(m\) refueling terminals driven by a common power source (a pump) are used to refueling a given fleet of \(n\) boats. The makespan should be minimized for boats and the refueling facilities. The authors consider discrete- continuous scheduling problems of the mentioned above type in which simultaneous search for a sequence of jobs on parallel machines and an allocation of a continuous resource among independent jobs are done with the goal to minimize the makespan. Two approximation algorithms are presented and analysed.
scientific article; zbMATH DE number 626449