In this paper, single machine scheduling problems with sequence dependent setup times are considered. The objective is to minimize the total weighted tardiness. The single machine total weighted tardiness (SMTWT) scheduling problems with sequence dependent setup times were proved to be strongly NP-hard. A recently developed meta-heuristic algorithm called as crow search algorithm is proposed to...

In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...

The problem addressed in this paper is scheduling jobs on unrelated parallel machines with sequence-dependent setup times to minimize the maximum completion time (i.e., the makespan). This problem is NP-hard even without including setup times. Adding sequence-dependent setup times adds another dimension of complexity to the problem and obtaining optimal solutions becomes very difficult especial...

Single machine scheduling problems with earliness and tardiness penalty are well known, but in the case of sequence dependent, the problem is more difficult and there are few researches around it. In related researches, setup time matrix was defined as a deterministic matrix. In this paper sequence dependent single machine scheduling with earliness tardiness penalty considerations using fuzzy s...

As environmental awareness grows, energy-aware scheduling is attracting increasing attention. Compared with traditional flexible job shop problem (FJSP), FJSP, considering sequence-dependent setup times and transportation (FJSP-SDST-T), closer to real production. In existing research, little research has focused on FJSP-SDST-T the minimization energy consumption. order make up gap, a mixed inte...