Active noise barrier minimizing pressure gradient" (2010). Architectural Engineering-Faculty Publications. 96. Minimization of the sound pressure field within the shadow zone of a noise barrier is achieved by reducing the pressure gradient along a line, at the top of a barrier, via active noise control. The noise control effectiveness of a barrier is increased by this strategy, especially for s...

Mixed model assembly lines (MMAL) are a type of production line where a variety of product models similar in product characteristics are assembled. The effective design of these lines requires that schedule for assembling the different products is determined. In this paper we tried to fit the sequencing problem with the main characteristics of make to order (MTO) environment. The problem solved...

We consider single-machine on-line scheduling problems where jobs arrive over time. A set of independent jobs has to be scheduled on the machine, where preemption is not allowed and the number of jobs is unknown in advance. Each job becomes available at its release date, which is not known in advance, and its characteristics, e.g., processing requirement, become known at its arrival. We deal wi...

This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by an initial tree. The incremental part of the input is given by an on-line sequence of vertices of the graph, not yet in the current group, revealed on-line one after one. The goal is to connect each new member to the c...

This work addresses a balancing problem approach whose objective is to minimizing the ergonomic risk dispersion between the set of workstations of a mixed-model assembly line and the risk level of the workstation with the greatest hazard. A GRASP procedure is proposed to achieve these two challenges simultaneously. This new procedure is compared with two Mixed Integer Linear Programs, the MILP-...

We consider on-line scheduling of unit time jobs on a single machine with job-dependent penalties. The jobs arrive on-line (one by one) and can be either accepted and scheduled, or be rejected at the cost of a penalty. The objective is to minimize the total completion time of the accepted jobs plus the sum of the penalties of the rejected jobs. We give an on-line algorithm for this problem with...