標題: OPTIMAL SCHEDULING IN FILM PRODUCTION TO MINIMIZE TALENT HOLD COST
作者: CHENG, TCE
DIAMOND, JE
LIN, BMT
資訊工程學系
Department of Computer Science
關鍵字: SCHEDULING;BRANCH-AND-BOUND ALGORITHMS;NP-HARDNESS
公開日期: 1-Dec-1993
摘要: 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.
URI: http://dx.doi.org/10.1007/BF00940554
http://hdl.handle.net/11536/2746
ISSN: 0022-3239
DOI: 10.1007/BF00940554
期刊: JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS
Volume: 79
Issue: 3
起始頁: 479
結束頁: 492
Appears in Collections:Articles


Files in This Item:

  1. A1993MR31500003.pdf