Stochastic multi-objective modelling and optimization of an energy-conscious distributed permutation flow shop scheduling problem with the total tardiness constraint

A Novel Hybrid Whale Optimization Algorithm to Solve a Production-Distribution Network Problem Considering Carbon Emissions

“…After the calculation of Equations (7) and (5), the total cost of production and distribution system can be given in the first objective function as seen in Equation (8). In this equation, the first term considers the opening cost which is required to open the manufactures.…”

“…Regarding the allocation variables, based on the located manufacturers, a priority-based representation has been utilized similar to recent similar studies [7][8]. The considered example for representation of allocation has been considered in Figure 3.…”

“…Similarly, recent years have seen a rapid interest in environmentalism to consider the carbon emissions to design the supply chain network [4][5][6]. In most of case studies, optimization of a supply chain is based on economic factors (profit maximization or cost minimization), with less or no regards to the negative impacts on the environment [7][8][9]. By another point of view, recent protocols committed by international organizations and governments are mainly decided to *Corresponding Author Email: amirfard@aut.ac.ir (A. M. Fathollahi-Fard) control and to reduce the carbon emission levels, more efficiently till 2020 [7].…”

Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

“…At the end, the stop condition of this algorithm based on the maximum number of iterations should be satisfied. More details about this algorithm is referred to literature [15,17].…”

“…Constraint (14) indicates that if the contractor q is not assigned to the vessel m, there is no possibility of assigning cranes of contractor q to the vessel m, and if the contractor q is assigned to the vessel m, the cranes of the contractor q can be assigned to the vessel m. Constraint (15) indicates that each contractor can be assigned to at most one vessel, and constraint (16) ensures that each vessel is assigned exactly to one contractor for servicing. Constraints (17) and (18) compute the completion time of each bay. Because the service to any vessel ends when the loading/unloading of all bays of that vessel is completed, the constraint (19) calculates the completion time of each ship.…”