in this paper, we consider a flow shop scheduling problem with availability constraints (fsspac) for the objective of minimizing the makespan. in such a problem, machines are not continuously available for processing jobs due to preventive maintenance activities. we proposed a mixed-integer linear programming (milp) model for this problem which can generate non-permutation schedules. furthermor...

With a rapid decline in cost of battery energy storage, system plays an increasingly important role managing imbalance between ordering and consumption the electricity wholesale market. We develop innovative demand forecasting framework for calculating optimal capacity that maximizes profit retailer. The allows different costs associated with over- under-prediction errors, two insensitive param...

The network nodes that are connected by wireless data connections called as wireless networks. The devices are connected via wireless link to communicate with each other. In wireless networks, it is very difficult to maintain the trade-off between throughput and delay. This paper proposes a new joint scheduling and congestion control algorithm for multihop wireless networks with dynamic route f...

This paper presents a new algorithm based on integrating Genetic Algorithms and Tabu Search methods to solve the Job Shop Scheduling problem. The idea of the proposed algorithm is derived from Genetic Algorithms. Most of the scheduling problems require either exponential time or space to generate an optimal answer. Job Shop scheduling (JSS) is the general scheduling problem and it is a NP-compl...