Optimal scheduling in film production to minimize talent hold cost

Cheng, T.C.E.; Diamond, Jeffrey E.; Lin, Bertrand M.T.

doi:10.1007/bf00940554

Cited by 31 publications

(46 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many scheduling papers [15][16][17][18][19][20] have similar characteristics as this paper. However, their applications are different.…”

Section: Submentioning

confidence: 83%

See 1 more Smart Citation

Overhaul Resource Planning for Rolling Stock Using MIP Models

Jiravanstit¹,

Tharmmaphornphilas²

2017

View full text Add to dashboard Cite

Abstract. In term of maintenance, parts must be maintained to satisfy operating conditions. Although, maintenance is costly and unprofitable, it is indispensable. Thus, reducing maintenance costs without reducing maintenance is one of the critical issues. Since maintenance costs mainly come from resources, they should be properly managed to minimize the cost. Hence, the goal of this paper is to find the optimal number of resources for required maintenance activities. Two mixed-integer programming models are developed. The first model is used for a long-term plan to find a proper number of resources while the second one generates a maintenance schedule for a shorter time frame to verify feasibility of the plan.

show abstract

“…Many scheduling papers [15][16][17][18][19][20] have similar characteristics as this paper. However, their applications are different.…”

Section: Submentioning

confidence: 83%

“…However, their applications are different. Cheng et al [15], Wang et al [16], and Qin et al [17] scheduled films in order to minimize waiting time of actors. Actors who involve in any pieces of film must be available when those pieces are shot.…”

Section: Submentioning

confidence: 99%

Overhaul Resource Planning for Rolling Stock Using MIP Models

Jiravanstit¹,

Tharmmaphornphilas²

2017

View full text Add to dashboard Cite

show abstract

“…One such strategy, the branch-and-bound algorithm, uses domain specific knowledge to put lower bounds on the expected cost of the different paths, and only traverses the most promising ones Winston (1979). The paper by Cheng, Diamond and Lin Cheng, Diamond and Lin (1993) provides an example of the use of the branch-and-bound algorithm for schedule optimization. In that paper, domain specific knowledge is used to determine the sequence of nodes and the bounds on the costs.…”

Section: Solution Of the Optimal Resource Allocation Problemmentioning

confidence: 99%

A Neural/Expert Based Client Server Architecture for MITE ITS

Mazzu¹,

Botros²,

Çağlayan³

1994

View full text Add to dashboard Cite

“…In the rehearsal , how to scheduling the program in order to reduce the total costs for the actors' waiting time is one of the main issues to consider. This problem is actually very similar to film shooting, workshop and project scheduling which aim to minimize the cost by reasonable scheduling [1]. Generally speaking, there are two different ways of paying for every actor's performance fee: one is that each actor has the same fee; another is different.…”

Section: Introductionmentioning

confidence: 99%

Scheduling of rehearsals with mixing piece length

Liu¹

2016

Proceedings of the 2016 International Conference on Education, Management and Computing Technology (ICEMCT-16)

View full text Add to dashboard Cite

Abstract. The cost of actors is one of the problem that have to be considered in the rehearsal. In traditional rehearsals, the piece length is fixed, but it is not always certain in practice. Based on the consideration of the actual situation, innovatively setting the piece length to mixing which consists of two parts, one part is the performance time which is determinate value; the other part is adjustment time for the rehearsal which is indeterminate value. The purpose of this study is to schedule the pieces reasonably in order to reduce the idle time of actors and minimize the total cost which is paid for the actors' waiting time. This paper presents a mixed integer programming model to optimize the sequence of the piece which has mixing length. For this model, we also designed a genetic algorithm based heuristic method to solve the problem in different scale, the test results demonstrate the effectiveness of this method.

show abstract

Optimal scheduling in film production to minimize talent hold cost

Cited by 31 publications

References 1 publication

Overhaul Resource Planning for Rolling Stock Using MIP Models

Overhaul Resource Planning for Rolling Stock Using MIP Models

A Neural/Expert Based Client Server Architecture for MITE ITS

Scheduling of rehearsals with mixing piece length

Contact Info

Product

Resources

About