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.
- Resource level minimization in the discrete-continuous scheduling
- Discrete-continuous scheduling problems -- mean completion time results
- On a methodology for discrete-continuous scheduling
- Discrete-continuous scheduling to minimize the makespan for power processing rates of jobs
- scientific article; zbMATH DE number 955199
- On the complexity of scheduling tasks with discrete starting times
- Discrete-continuous scheduling problems -- mean completion time results
- Exact and approximation algorithms for the operational fixed interval scheduling problem
- An experimental study of LP-based approximation algorithms for scheduling problems
- scientific article; zbMATH DE number 444983 (Why is no real title available?)
- scientific article; zbMATH DE number 850325 (Why is no real title available?)
- scientific article; zbMATH DE number 7267489 (Why is no real title available?)
- Theory and Applications of Models of Computation
This page was built for publication: Approximation algorithms for some discrete-continuous scheduling problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1332457)
