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

This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies ...

This paper addresses a single-machine problem in which the past-sequence-dependent p-s-d setup times and exponential time-dependent and position-dependent learning effects are considered. By the exponential time-dependent learning effect, it means that the processing time of a job is defined by an exponent function of the total actual processing time of the already processed jobs. The setup tim...

In this paper, the researchers have investigated a Concatenated Robot Move (CRM) sequence problem and Minimal Part Set (MPS) schedule problem with different setup times for two-machine robotic cell. They have focused on simultaneous solving of CRM sequence and MPS schedule problems with different loading and unloading times. They have applied a Simulated Annealing (SA) algorithm to provide a go...

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