The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...

this paper proposes the exchange market algorithm (ema) to solve the combined economic and emission dispatch (ceed) problems in thermal power plants. the ema is a new, robust and efficient algorithm to exploit the global optimum point in optimization problems. existence of two seeking operators in ema provides a high ability in exploiting global optimum point. in order to show the capabilities ...

scheduling is to determine the priorities or arrange the activities to meet the needs, limitations and certain goals. because the time is always a limited resource, all activities should be scheduled to use optimally and certainly the resource. gravitational force algorithm, like other evolutionary algorithms, is inspired by nature. the effect of the gravity on the objects reciprocally and to a...