Visualization of time-dependent simulation data, such as datasets from CFD simulation, still is a very challenging task. In this paper, we present a new approach to the interactive visual analysis of flow simulation data which is especially targeted at the analysis of time-dependent data. It supports the flexible specification and visualization of flow features in an interactive setup of multip...

This paper presents a novel mathematical programming approach to the single-machine capacitated lot-sizing and scheduling problem with sequence-dependent setup times and setup costs. The approach is partly based on the earlier work of Haase and Kimms [2000. Lot sizing and scheduling with sequence-dependent setup costs and times and efficient rescheduling opportunities. International Journal of ...

background: in survival studies when the event times are dependent, performing of the analysis by using of methods based on independent assumption, leads to biased. in this paper, using copula function and considering the dependence structure between the event times, a parametric joint distribution has made fitting to the events, and the effective factors on each of these events would be determ...

in this paper, the conjugate gradient method coupled with adjoint problem is used in order to solve the inverse heat conduction problem and estimation of the time- dependent heat flux using the temperature distribution at a point in a three layer system with none homogeneous boundary conditions. also, the effect of noisy data on final solution is studied. for solving this problem the general co...

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

Permutation flowshop scheduling problem with sequence-dependent setup times (PFSP-SDST) and makespan minimisation is NP-hard. It has important practical applications, for example, in the cider industry print industry. There exist several metaheuristic algorithms to solve this problem. However, within time limits, those still either find low quality solutions or struggle large problems. In paper...

Several researches on scheduling problems have been done under the assumption that setup times are independent of job sequence. However, in certain contexts, such as the pharmaceutical industry, metallurgical production, electronics and automotive manufacturing, there are frequently setup times on equipment between two different activities. In a survey of industrial schedulers, Dudek et al. (19...

In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...