Search

This paper integrated the behavioral science theory into relief supplies optimal scheduling after emergency events, and proposed that the public's psychological factors should be taken into account to make decisions about relief supplies scheduling. We depicted the public's psychological risk perception with prospect theory, defined and selected the public's psychological expectation time as a time reference point, and got out the risk perception curve and function model. We formulated a mixed integer programming model to minimize public's psychological risk perception and dissatisfaction degree of supplies. The corresponding multi-layer search algorithm was designed. Finally, the validity of this model and algorithm is verified through numerical experiment. [ABSTRACT FROM AUTHOR]

Setup (changeover) time is needed by the processes with cleaning or changing fixtures operations, which is strongly dependent on the immediately succeeding operation. The scheduling problems in this environment are sequence-dependent. This paper focuses on the single machine scheduling problem with sequence dependent setup times to minimize the total weighted tardiness, which is NP-hard. An iterated filter-and-fan algorithm (IFF) is proposed to solve it, which searches the solution space as a manner of a branch tree. In this algorithm, when the branching moves cannot improve the root solution, a new root solution with inherited features is generated, from which the search continues to work. According to the solution characteristic of the problem, a branching move strategy with sequence segment recomposing and referenced local search is proposed to generate branch nodes. The algorithm is tested by 120 instances from literature. The results show the solutions obtained by the IFF algorithm are better or not worse than those obtained by DE and DPSO algorithm for most instances. Besides, the best solutions for 42 instances are improved by the IFF algorithm. [ABSTRACT FROM AUTHOR]

This paper considers a problem of uniform-machine scheduling with machine release times to minimize makespan. Firstly, four properties of swapping jobs are proposed. Then, based on the properties, a heuristic algorithm is presented, which takes the LPT schedule as its initial solution and improves the solution by repeatedly swapping the jobs between two machines with the maximal and minimal makespan. Finally, computational results show that the presented heuristic is efficient and effective. [ABSTRACT FROM AUTHOR]

This paper deals with the human resource scheduling problem of multiple IT projects. According to its specific requirements on time and personnel, the duration of the whole development process can be divided into equal-length time slices. Based on the relations among activities and personnel in a certain time slice, the search tree of personnel scheduling solutions can be constructed. By connecting all the search trees sequentially from all the time slices, the solution tree for the whole problem can be generated and all the solutions can be listed. Then, based on the average of advanced completion rate and the variance of advanced completion rate, the optimal solution can be found. By adding heuristic rules to this algorithm, the searching space can contract rapidly, and the searching efficiency can be enhanced greatly. In view of the particularities of this algorithm, it can be applied to many generalized resource scheduling problems that possess similar conditions with the problem described above. After applying this algorithm to a mock example, some regular patterns emerged, showing the potential that further heuristic rules can be extracted. [ABSTRACT FROM AUTHOR]