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 substitutes undesirable...

In this paper we consider job shop scheduling problem (JSSP) and quadratic assignment problem (QAP), simultaneously. We assume that each job has due date, tardiness and earliness penalty. Processing time, due date, transportation time and set...

-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...