Machines may not be available all the time due to uncertain breakdown or preventive maintenance activities. In this paper we develop a branch and bound algorithm to solve the flexible flowshop scheduling problems with non-resumable availability constraint. Both the machine-based and job-based lower bounds are developed by making use of the lower bounds of the classical flexible fowshop problems. Numerical experiments are conducted and the results show that the branch and bound algorithm is effective when the problem size is not very large.

This paper investigates the impact of freezing the master production schedule (MPS) in multi-item single-level systems with a single resource constraint under demand uncertainty. It also examines the impact of environmental factors on the selection of MPS freezing parameters. A computer model is built to simulate master production scheduling activities in a multi-item system under a rolling time horizon. The result of the study shows that the parameters for freezing the MPS have a significant impact on total cost, schedule instability and the service level of the system. Furthermore, the selection of freezing parameters is also significantly influenced by some environmental factors such as capacity tightness and cost structure. While some findings concerning the performance of MPS freezing parameters without capacity constraints can be generalised to the case of limited capacity, other conclusions under capacity constraints are different from those without capacity constraints.

A computer model is built to simulate master production scheduling activities in a capacitated multi-item production system under demand uncertainty and a rolling time horizon. The output from the simulation is analyzed through statistical software. The results of the study show that forecasting errors have significant impacts on total cost, schedule instability and system service level, and the performance of forecasting errors is significantly influenced by some operational factors, such as capacity tightness and cost structure. Furthermore, the selection of the master production schedule freezing parameters is also significantly influenced by forecasting errors. The findings from this study can help managers optimize their production plans by selecting more reasonable forecasting methods and scheduling parameters, thus improving the performance of roduction systems.

The scheduling problems studied in this paper concern the two-stage no-wait flowshops with parallel machines under the objective function of the minimization of the maximum completion time. A new heuristic algorithm, i.e. the minimum deviation algorithm, is developed to solve the problems. In order to evaluate the average case performance of the algorithm, we design numerical experiments to compare the effectiveness of the algorithm with that of the other approximation algorithms. Extensive simulations are conducted under different shop conditions, and the results statistically show that the minimum deviation algorithm performs well under most of the situations.

This paper considers the two-stage flexible flowshop scheduling problem with availability constraints. We discuss the complexity and the approximability of the problem, and provide some approximation algorithms with finite and tight worst case performance bounds for some special cases of the problem.