Approximation algorithms for some discrete-continuous scheduling problems
type: Item
instance of: scholarly article
title: Approximation algorithms for some discrete-continuous scheduling problems
zbMATH Open document ID: 0813.68109
author: Joanna Józefowska
author: Jan Węglarz
published in: Bulletin of the Polish Academy of Sciences. Technical Sciences
publication date: 1994-08-29T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 626449
zbMATH Keywords: discrete-continuous scheduling problems
reviewed by: Anatoly V. Anisimov
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 626449