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

Flow-shop scheduling problem (FSP) deals with the scheduling of a set of n jobs that visit a set of m machines in the same order. As the FSP is NP-hard, there is no efficient algorithm to reach the optimal solution of the problem. To minimize the holding, delay and setup costs of large permutation flow-shop scheduling problems with sequence-dependent setup times on each machine, this pap...

In this paper, operating room planning and scheduling problems have been studied. planning, the allocation of patients to rooms their sequencing are critical in determining performance rooms. three surgery decisions considered, including number open, surgeries rooms, allocated All under consideration elective, durations considered deterministic. Further, it is that different specialties, each c...

This paper deals with the problem of scheduling jobs in a parallel flow shop configuration under blocking constraint, which setup time machines depends not only on job to be processed but also previously one, i.e., there are sequence-dependent times. The performance analysis several iterated greedy algorithms different initial solution procedures and local searches lets us define an efficient a...

The scheduling of (parallel) serial-batch processing machines is a task arising in many industrial sectors. In the metal-processing industry for instance, cutting operations are necessary to fabricate varying metal pieces out large base slides. Here, (cutting) jobs have individual, arbitrary slide capacity requirements (sizes), individual times and due dates, specific material (i.e. each job be...