In this paper, the hassle of application performance scheduling with accepting approach is studied. considering the uncertainty of actual scenario, the length of a Accepting Strategy application is expressed as a bounded c language. first off, we decide which applications are accepted. Secondly, the risk desire coefficient of the selection maker is delivered. Thirdly, the min-max robust optimization model of the uncertain software display scheduling is built to minimize the performance value and determine the collection of these packages. primarily based on the above version, an powerful algorithm for the original trouble is proposed. The computational test suggests that the overall performance’s fee (revenue) will increase (decrease) with choice maker’s risk aversion.
inside the strategy planning stage of a overall performance, many packages will sign up for the performance, and every application deliver exceptional revenue and exceptional value. the program organization needs to comprehensively recollect the overall performance revenue and fee, and comes to a decision which applications Accepting Strategy to be customary. each software requires more than one performers, and a performer also can take part in a couple of programs. If the applications which the identical performer participates in are not consecutively organized, the waiting price will arise. therefore, after figuring out the set of the prevalent applications, the affordable scheduling of these everyday packages to growth the overall performance revenue is the primary problem of the selection maker.
students have done large researches on software overall performance scheduling and the similar movie manufacturing scheduling hassle. Cheng et al. [1] first noted scheduling problems in the film manufacturing manner. They assumed that the shooting period of every scene is a sure value, considering the actor waiting price trouble in the course of film taking pictures. They proved that the trouble is powerful NP-difficult, and used the department and sure algorithm to resolve the minimum value trouble. Nordström and Tufekci [2] proposed numerous hybrid algorithms which use confined pairwise interchange technique inside the easy genetic set of rules framework to remedy the trouble proposed by means of Cheng et al. [1]. Their algorithms outperformed in terms of fine of answer and computational time. Bomsdorf and Derigs [3] supplied the movie taking pictures scheduling hassle and formulated a conceptual model. and that they proposed a meta-heuristic set of rules to generate a timeline for movie. Stuckey et al. [4] carried out a dynamic programming to the scheduling trouble to decrease the price of the skills. They assumed that the actor’s appearance price is exclusive, and the capturing time of every scene is a certain price, confirmed some of methods to improve the dynamic programming answer via preprocessing and restricting the hunt. Wang et al. [5] generalized a scheduling model by way of incorporating the performers waiting fee and Accepting Strategy operating fee in film taking pictures. They used the subsequent fit (NF) set of rules and the first fit lowering (FFD) algorithm to allocate scenes to paintings days on the way to provide initial solutions for in addition enhancements. Dynamic programming, iterated nearby seek, and tabu seek are adopted to constitute the second–section development procedures. Qin et al. [6] formulated the skills scheduling hassle as an integer linear programming model and designed an advanced department and bound method to address it. Sakulsom and Tharmmaphornphilas [7] studied a music performance scheduling problem. The objective is to limit the whole range of days that each one performers have to expose up, and sequence the tune portions inside every day to minimize the full waiting time of the performers. They proposed a 2-degree method to schedule song pieces, that is a aggregate of a cellular formation approach and an integer-programming model.
based totally at the above research consequences, it may be concluded that the film capturing or application rehearsal period of the predecessors is believed to be a sure price. inside the real program performances, due to elements along with group of workers absence, equipment failure, performance effects, and so forth., the duration of every software is uncertain. therefore, the consequences obtained by way of the deterministic research approach are greatly deviated from the real situation. Zhen et al. [8] proposed the overall performance scheduling trouble of blended period, and expressed the overall performance time as the sum of the sure overall performance time and the unsure adjustment time. They assumed that the unsure adjustment Accepting Strategy time obeyed the ordinary distribution. The goal is to decrease the overall waiting cost of the performers. but, inside the actual situations, a huge quantity of facts is frequently required to obtain a distribution characteristic of a random parameter. This paper breaks via this challenge and uses the strong optimization approach to express the uncertain period as a non-stop bounded c programming language. We handiest want to recognise the higher and decrease bound of this system overall performance duration.
strong optimization is an effective approach to remedy the uncertain trouble and has been extensively used. Wang and Tang [9] proposed a two–degree strong optimization method for interval–type surgical scheduling trouble, effectively lowering the damaging outcomes of carrier time uncertainty on hospital sales. Xu et al. [10] constructed a strong scheduling model for homogeneous parallel machines primarily based at the min-max regret criterion under the circumstance that handiest knew the processing time c program languageperiod. Qiu et al. [11] used the robust optimization approach to clear up the order policy of the included deliver chain and the agreement coordination coverage of the disbursed supply chain underneath the min-max remorse price criterion. Zhang et al. [12] built an emergency rescue community based totally at the scenario of min-max regret value criteria, constructed a sturdy optimization version, and transformed it into a blended integer programming version, and that they used the scenario relaxation algorithm to resolve this version.
This paper considers the unsure duration application performance scheduling problem under accepting approach (recorded as P0), the the rest is organized as follows. In section 2, we use a simple instance to describe this system performance scheduling problem and introduce the utility of the min-max sturdy optimization approach in this paper. within the case of figuring out the set of the established performance applications, the selection maker’s threat desire coefficient [13] [14] is added and a robust performance scheduling model (RPSM) is built for these accepted applications in segment three. Then we remodel the RPSM right into a zero – 1 mixed linear programming version to Accepting Strategy minimize the overall performance fee, and based at the set of rules for fixing RPSM, the algorithm H of P0 is built to decide the customary or rejected applications and the performance collection of those customary programs in section 4. ultimately we use Matlab software to carry out numerical experiments, verify the real performance of set of rules H, and examine the have an effect on of choice maker’s chance preference on overall performance price.
inside the strategy planning stage of a overall performance, many packages will sign up for the performance, and every application deliver exceptional revenue and exceptional value. the program organization needs to comprehensively recollect the overall performance revenue and fee, and comes to a decision which applications Accepting Strategy to be customary. each software requires more than one performers, and a performer also can take part in a couple of programs. If the applications which the identical performer participates in are not consecutively organized, the waiting price will arise. therefore, after figuring out the set of the prevalent applications, the affordable scheduling of these everyday packages to growth the overall performance revenue is the primary problem of the selection maker.
students have done large researches on software overall performance scheduling and the similar movie manufacturing scheduling hassle. Cheng et al. [1] first noted scheduling problems in the film manufacturing manner. They assumed that the shooting period of every scene is a sure value, considering the actor waiting price trouble in the course of film taking pictures. They proved that the trouble is powerful NP-difficult, and used the department and sure algorithm to resolve the minimum value trouble. Nordström and Tufekci [2] proposed numerous hybrid algorithms which use confined pairwise interchange technique inside the easy genetic set of rules framework to remedy the trouble proposed by means of Cheng et al. [1]. Their algorithms outperformed in terms of fine of answer and computational time. Bomsdorf and Derigs [3] supplied the movie taking pictures scheduling hassle and formulated a conceptual model. and that they proposed a meta-heuristic set of rules to generate a timeline for movie. Stuckey et al. [4] carried out a dynamic programming to the scheduling trouble to decrease the price of the skills. They assumed that the actor’s appearance price is exclusive, and the capturing time of every scene is a certain price, confirmed some of methods to improve the dynamic programming answer via preprocessing and restricting the hunt. Wang et al. [5] generalized a scheduling model by way of incorporating the performers waiting fee and Accepting Strategy operating fee in film taking pictures. They used the subsequent fit (NF) set of rules and the first fit lowering (FFD) algorithm to allocate scenes to paintings days on the way to provide initial solutions for in addition enhancements. Dynamic programming, iterated nearby seek, and tabu seek are adopted to constitute the second–section development procedures. Qin et al. [6] formulated the skills scheduling hassle as an integer linear programming model and designed an advanced department and bound method to address it. Sakulsom and Tharmmaphornphilas [7] studied a music performance scheduling problem. The objective is to limit the whole range of days that each one performers have to expose up, and sequence the tune portions inside every day to minimize the full waiting time of the performers. They proposed a 2-degree method to schedule song pieces, that is a aggregate of a cellular formation approach and an integer-programming model.
based totally at the above research consequences, it may be concluded that the film capturing or application rehearsal period of the predecessors is believed to be a sure price. inside the real program performances, due to elements along with group of workers absence, equipment failure, performance effects, and so forth., the duration of every software is uncertain. therefore, the consequences obtained by way of the deterministic research approach are greatly deviated from the real situation. Zhen et al. [8] proposed the overall performance scheduling trouble of blended period, and expressed the overall performance time as the sum of the sure overall performance time and the unsure adjustment time. They assumed that the unsure adjustment Accepting Strategy time obeyed the ordinary distribution. The goal is to decrease the overall waiting cost of the performers. but, inside the actual situations, a huge quantity of facts is frequently required to obtain a distribution characteristic of a random parameter. This paper breaks via this challenge and uses the strong optimization approach to express the uncertain period as a non-stop bounded c programming language. We handiest want to recognise the higher and decrease bound of this system overall performance duration.
strong optimization is an effective approach to remedy the uncertain trouble and has been extensively used. Wang and Tang [9] proposed a two–degree strong optimization method for interval–type surgical scheduling trouble, effectively lowering the damaging outcomes of carrier time uncertainty on hospital sales. Xu et al. [10] constructed a strong scheduling model for homogeneous parallel machines primarily based at the min-max regret criterion under the circumstance that handiest knew the processing time c program languageperiod. Qiu et al. [11] used the robust optimization approach to clear up the order policy of the included deliver chain and the agreement coordination coverage of the disbursed supply chain underneath the min-max remorse price criterion. Zhang et al. [12] built an emergency rescue community based totally at the scenario of min-max regret value criteria, constructed a sturdy optimization version, and transformed it into a blended integer programming version, and that they used the scenario relaxation algorithm to resolve this version.
This paper considers the unsure duration application performance scheduling problem under accepting approach (recorded as P0), the the rest is organized as follows. In section 2, we use a simple instance to describe this system performance scheduling problem and introduce the utility of the min-max sturdy optimization approach in this paper. within the case of figuring out the set of the established performance applications, the selection maker’s threat desire coefficient [13] [14] is added and a robust performance scheduling model (RPSM) is built for these accepted applications in segment three. Then we remodel the RPSM right into a zero – 1 mixed linear programming version to Accepting Strategy minimize the overall performance fee, and based at the set of rules for fixing RPSM, the algorithm H of P0 is built to decide the customary or rejected applications and the performance collection of those customary programs in section 4. ultimately we use Matlab software to carry out numerical experiments, verify the real performance of set of rules H, and examine the have an effect on of choice maker’s chance preference on overall performance price.