In this paper, a multi objective model in which operation planning and tool assignment flexible manufacturing system (FMS) has been considered simultaneously. regard, the main characteristics of FMS have analyzed. Then, comprehensive model, including major parameters cost components designed presented. The proposed contains factors machining cost, earliness tardiness penalties, part movement or...

In this paper we consider single machine scheduling problems with a common due-date for all jobs, arbitrary monotone earliness and tardiness costs and arbitrary breakdown and repair processes. We show that the problem is equivalent to a deterministic one without breakdowns and repairs and with an equivalent cost function of a job's completion time. A V-shaped schedule without idle times is show...

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

Single machine scheduling problems with earliness and tardiness penalty are well known, but in the case of sequence dependent, the problem is more difficult and there are few researches around it. In related researches, setup time matrix was defined as a deterministic matrix. In this paper sequence dependent single machine scheduling with earliness tardiness penalty considerations using fuzzy s...

Scheduling problems involving both earliness and tardiness costs have received significant attention in recent years. This type of problem became important with the advent of the justin-time (JIT) concept, where early or tardy deliveries are highly discouraged. In this work we examine the flowshop scheduling problem with no storage constraints and with blocking inprocess. In this latter environ...

This paper presents the optimal sequence of a set of jobs for a single machine with idle insert, in which the objective function is to minimize the sum of maximum earliness and tardiness (n/1/I/ETmax). Since this problem tries to minimize and diminish the values of earliness and tardiness, the results can be useful for different production systems such as just in time (JIT). Special case of det...

⎯In this paper, we consider the single machine earliness/tardiness scheduling problem with different release dates and no unforced idle time. The most effective lower bound uses multiplier adjustment procedures that require an initial sequence. We investigate the sensitivity of the lower bounding procedure to the initial sequences, and experiment with different scheduling rules and dominance co...

In this paper, we consider the single machine earliness/tardiness scheduling problem with di/erent release dates and no unforced idle time. The problem is decomposed into weighted earliness and weighted tardiness subproblems. Lower bounding procedures are proposed for each of these subproblems, and the lower bound for the original problem is the sum of the lower bounds for the two subproblems. ...