OPTIMAL SCHEDULING IN FILM PRODUCTION TO MINIMIZE TALENT HOLD COST
| dc.citation.epage | 492 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 479 | en_US |
| dc.citation.volume | 79 | en_US |
| dc.citation.woscount | 4 | |
| dc.contributor.author | CHENG, TCE | en_US |
| dc.contributor.author | DIAMOND, JE | en_US |
| dc.contributor.author | LIN, BMT | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:04:15Z | |
| dc.date.available | 2014-12-08T15:04:15Z | |
| dc.date.issued | 1993-12-01 | en_US |
| dc.description.abstract | The problem of minimizing the cost due to talent hold days in the production of a feature film is considered. A combinatorial model is developed for the sequencing of shooting days in a film shoot. The problem is shown to be strongly NP-hard. A branch-and-bound solution algorithm and a heuristic solution method for large instances of the problem (15 shooting days or more) are developed and implemented on a computer. A number of randomly generated problem instances are solved to study the power and speed of the algorithms. The computational results reveal that the heuristic solution method is effective and efficient in obtaining near-optimal solutions. | en_US |
| dc.identifier.doi | 10.1007/BF00940554 | en_US |
| dc.identifier.issn | 0022-3239 | en_US |
| dc.identifier.journal | JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1007/BF00940554 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/2746 | |
| dc.identifier.wosnumber | WOS:A1993MR31500003 | |
| dc.language.iso | en_US | en_US |
| dc.subject | SCHEDULING | en_US |
| dc.subject | BRANCH-AND-BOUND ALGORITHMS | en_US |
| dc.subject | NP-HARDNESS | en_US |
| dc.title | OPTIMAL SCHEDULING IN FILM PRODUCTION TO MINIMIZE TALENT HOLD COST | en_US |
| dc.type | Article | en_US |