In this paper, we address the feasibility issue in the job shop scheduling problem involving sequence dependent setup times and reentrancy. Feasibility properties are first developed for metaheuristic search methods. In addition, we present a modified version of the standard labelling algorithm. An alternative algorithm is also developed which requires negligible computing time and can directly...

Parameter estimation has a high importance in the geosciences. The ensemble Kalman filter (EnKF) allows parameter for large, time-dependent systems. For large systems, EnKF is applied using small ensembles, which may lead to spurious correlations and, ultimately, divergence. We present thorough evaluation of pilot point (PP-EnKF), variant estimation. In this evaluation, we explicitly state upda...

For a single finite-capacity machine that can process several product types of jobs, uncertainties in job arrival time and product type can make the calculation of required setup time and the setting of output target very complicated. Setup activities may cause wastage in machine capacity and extend job lead time. In such circumstances, the family-based scheduling rule (FSR) can be used to redu...

Domain filtering is a powerful technique for reduction of the search space during solving combinatorial problems like scheduling. In this paper we present several filtering algorithms designed specifically for scheduling in batch processing environments with sequence dependent setup times. We extend two known algorithms, namely edge finding and not-first/not-last technique, and we present a new...

much investigation has been given to this issue, the role of setup savings from the perspective of the workload control concept has hardly received attention. This paper reports a simulation study on this matter. The study evaluates the potential for savings in setups, dependent on the level of workload in the shop, for two alternative strategies, namely considering setup times centrally, withi...

In this paper a multicriteria scheduling problem with sequence-dependent setup times on a single machine is considered. The objective function of the problem is minimization of the weighted sum of total completion time, maximum tardiness and maximum earliness. An integer programming model is developed for the problem which belongs to NP-hard class. Only small size problems with up to 12 jobs ca...

This paper focuses on the flow shop sequence dependent group scheduling (FSDGS) problem with minimisation of total completion time as the criterion (Fm|fmls, prmu, Splk|∑Cj). The research problem is formulated in form of two different mixed integer linear programming (MILP) models. Comparing with the latest MILP model for the proposed problem in the literature, the complexity size of the propos...