We consider a typical problem in the assembly of printed circuit boards (PCBs) in a two-machine flow shop system to simultaneously minimize the weighted sum of weighted tardiness and weighted flow time. The investigated problem is a group scheduling problem in which PCBs are assembled in groups and the interest is to find the best sequence of groups as well as the boards within each group to mi...

Today, because the market is scattered around world, manufacturing activities are not limited to a single location and have spread globally. As result, discussion of scheduling factory has changed from classic network as need in real world. In this regard, study considers multiple factories by taking into account job transportation time between factories. The main problem here that each would b...

This paper aims to propose a model for solving capacitated lot-sizing problem with sequence-dependent setups (CLSD) and parallel machines in bi-part injection moulding (BPIM) context that consists of injecting two different parts or products into the same mould separate cavities. These require sequence order available capacity at instant, but generate part inventories. The addressed should be c...

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

In production planning, sequence dependent setup times and costs are often incurred for switchovers from one product to another. When setup times and costs do not respect the triangular inequality, a situation may occur where the optimal solution includes more than one batch of the same product in a single period — in other words, at least one sub tour exists in the production sequence of that ...

Recently Koulamas and Kyparisis (2006) introduced past-sequence-dependent setup times to scheduling problems. This means that the setup time of a job is proportionate to the sum of processing times of the jobs already scheduled. Koulamas and Kyparisis (2006) were able to show for a number of single-machine scheduling problems with completion time goals that they remain polynomially solvable. In...

We describe an Ant Colony Optimization (ACO) algorithm for solving a single machine scheduling problem. In the operating situation modeled, setup times are sequence dependent and the objective is to minimize total tardiness. This problem has previously been treated by Rubin & Ragatz [1995] and by Tan et al. [2000] among others. A new feature using look-ahead information in the transition rule o...

The single-machine early/tardy (E/T) scheduling problem is addressed in this research. The objective of this problem is to minimize the total amount of earliness and tardiness. Earliness and tardiness are weighted equally and the due date is common and large (unrestricted) for all jobs. Machine setup time is included and is considered sequence-dependent. When sequence-dependent setup times are ...

Stochastic dynamic job shop scheduling problem with consideration of sequence-dependent setup times are among the most difficult classes of scheduling problems. This paper assesses the performance of nine dispatching rules in such shop from makespan, mean flow time, maximum flow time, mean tardiness, maximum tardiness, number of tardy jobs, total setups and mean setup time performance measures ...