nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinat...

In this paper, a particle swarm optimization algorithm (PSO) is presented to solve the permutaion flowshop sequencing problem (PFSP) with the objectives of minimizing makespan and maximum lateness of jobs, respectively. Simple but very efficient local search based on variable neighborhood search (VNS) is embedded in the particle swarm optimization algorithm to solve the well known benchmark sui...

cell formation problem mainly address how machines should be grouped and parts be processed in cells. in dynamic environments, product mix and demand change in each period of the planning horizon. incorporating such assumption in the model increases flexibility of the system to meet customer’s requirements. in this model, to ensure the reliability of the system in presence of unreliable machine...

We propose an ultra-broadband full-mesh wavelength router supporting the T- and O-bands using 3 stages of cascaded arrayed waveguide gratings (AWGs). The router architecture is based on a combination of waveband and channel routing by coarse and fine AWGs, respectively. We fabricated several T-band-specific silica-based AWGs and quantum dot semiconductor optical ampliers as part of the router, ...

In this paper we describe a recently developed algorithm for computing least cost paths under turn angle constraints. If a graph representation of a two or three dimensional routing problem contains !VI vertices and IEI edges, then the new algorithm scales as O(IEI log !VI). This result is substantially better than O(IEllVD algorithms for the more general problem of routing with turn penalties,...

Optical burst switching provides a feasible paradigm for the next IP over optical backbones. However its burst loss performance can be highly affected by burst contention. In this paper we discuss traffic engineering approaches for path selection with the objective to minimize contention using only topological information. The discussed strategies are based on balancing the traffic across the n...