Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/14407
Title: Optimal scheduling in film production to minimize talent hold cost
Authors: Cheng, TCE 
Diamond, JE
Lin, BMT
Keywords: Branch-and-bound algorithms
NP-hardness
Scheduling
Issue Date: 1993
Publisher: Springer
Source: Journal of optimization theory and applications, 1993, v. 79, no. 3, p. 479-492 How to cite?
Journal: Journal of optimization theory and applications 
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.
URI: http://hdl.handle.net/10397/14407
ISSN: 0022-3239
EISSN: 1573-2878
DOI: 10.1007/BF00940554
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

14
Last Week
0
Last month
1
Citations as of Nov 7, 2018

WEB OF SCIENCETM
Citations

11
Last Week
0
Last month
0
Citations as of Nov 9, 2018

Page view(s)

206
Last Week
0
Last month
Citations as of Nov 12, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.