An application of parallel virtual machine framework to film production problem
From MaRDI portal
Publication:1569971
DOI10.1016/S0898-1221(00)00129-2zbMath0953.68631OpenAlexW2086089765MaRDI QIDQ1569971
Shyong Jian Shyu, Bertrand M. T. Lin
Publication date: 9 July 2000
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0898-1221(00)00129-2
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
- Efficiency considerations in the implementation of parallel branch-and- bound
- Optimal scheduling in film production to minimize talent hold cost
- The PVM concurrent computing system: Evolution, experiences, and trends
- Heterogeneous network computing: The next generation
- Feature Article—Reporting Computational Experiments with Parallel Algorithms: Issues, Measures, and Experts' Opinions
This page was built for publication: An application of parallel virtual machine framework to film production problem