Scheduling Problem of Movie Scenes Based on Three Meta-Heuristic Algorithms
Movie scenes scheduling problem (MSSP) is the NP-hard. It refers to the process of film shooting through the reasonable sequence of film scenes to minimize the total cost of film shooting. Studying scheduling problem of this kind is based on the location of the scene shooting, the cost of the scene...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2020-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/9044871/ |