This paper considers a scheduling problem of a set of independent jobs on unrelated parallel machines (UPMs) that minimizesthe maximum completion time (i.e., makespan or ), maximum earliness ( ), and maximum tardiness ( ) simultaneously. Jobs have non-identical due dates, sequence-dependent setup times and machine-dependentprocessing times. A multi-objective mixed-integer linear programmi...

Generally, human resources play an important role in manufacturing systems as they can affect the work environment. One of the most important factors affecting the human resources is being an interactional interest among the workers in the workshops. If the workers in a manufacturing cell have the highest surface of the interactional interest level, it causes a significant raise in coordination...

There are many important practical optimization problems whose feasible regions not known to be nonempty or not, and optimizers of the objective function with least constraint violation prefer found. A natural way for dealing these is extend nonlinear problem as one optimizing over set points violation. This leads study shifted problem. paper focuses on constrained convex The sufficient conditi...

in this research, efficiency of iranian forest and rangeland decision making unit was assessed using non-parametric method. inputs and outputs determined by field research and with applying a delphi method the final input and output variables selected. forty five wood-producing units (forestry plans) in three northern iranian province were studied using data envelopment analysis. the efficiency...

Constraint patterns are very useful for specifying OCL constraints on UML class models. They potentially shorten the development time and reduce the errors for constraint development by providing predefined templates that can be instantiated in particular contexts. Constraint patterns can be identified by analyzing existing constraints for recurring expressions and abstracting from them. This p...

The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...

In this paper, slewing maneuver of a flexible spacecraft with large angle of rotation is considered and assuming structural frequency uncertainties a robust minimum-time optimal control law is developed. Considering typical bang-bang control commands with multiple symmetrical switches, a parameter optimization procedure is introduced to find the control forces/torques. The constrained minimizat...

location, 39accessible, 78annotation statement, 86assert, 89assignable, 78assume, 88augmented postcondition, 83augmented precondition, 83axiom, 42 Behavioral Interface Speci cation Lan-guage, 1behavioral subtype, 25\bigint, 12, 48 call stack, 17, 18class, 12Class (type), 12code fragment, 12annotated, 12constraint, see history const...

Abstract. Augmented Lagrangian method (ALM) has been popularly used for solving constrained optimization problems. Its convergence and local convergence speed have been extensively studied. However, its global convergence rate is still open for problems with nonlinear inequality constraints. In this paper, we work on general constrained convex programs. For these problems, we establish the glob...