Job shop is one of a well known NP-hard optimization problems. In this paper, extremal optimization is proposed for job shop scheduling. Extremal optimization is an evolutionary meta-heuristic method that consecutively ...

-known job shop scheduling problem with transportation delay in which in addition to decisions made in the classic problem, the locations of machines have to be selected among possible sites. The only goal of the problem is the minimization of the makespan. A...

In this paper, we consider job shop scheduling problem (JSSP) and machine location problem, simultaneously. In fact, the machine location problem is incorporated into the JSSP. Setup time, processing time, transportation time, and due date...

flow shop scheduling problem ;deteriorating jobs; Heuristic algorithms...