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

In this researcha particle swarm optimization (PSO) algorithm is proposedfor no-wait flowshopsequence dependent setuptime scheduling problem with weighted earliness-tardiness penalties as the criterion ( | , | ∑ " ).The smallestposition value (SPV) rule is applied to convert the continuous value of position vector of particles in PSO to job permutations.A timing algorithm is generated to find t...

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

Distributed arrival time control (DATC) is a highly distributed feedback control algorithm for the scheduling problems in heterarchical operation systems [V.V. Prabhu, Performance of real-time distributed arrival time control in heterarchical manufacturing systems, IIE Transactions 32 (2000) 323–331]. Although DATC has presented outstanding performance for the real-time scheduling problems in d...

We study the scheduling situation in which a set of jobs subjected to release dates and deadlines are to be performed on a single machine. The objective is to minimize a piecewise linear objective function ∑ j Fj where Fj(Cj) corresponds to the cost of the completion of job j at time Cj . This class of function is very large and thus interesting both from a theoretical and practical point of vi...

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

The parallel machine scheduling problem is an important and difficult problem to be considered in the real-world situations. Traditionally, this problem consists of the scheduling of a set of independent jobs on parallel machines with the aim of minimizing the maximum job completion. In today's manufacturing systems, in which both early and tardy finishing of job processing are undesired, the o...

This paper proposes exact algorithms to generate optimal timing schedules for a given sequence of operations in job shops minimize the total weighted earliness and tardiness. The are proposed two shop scheduling scenarios, one involving due dates only last operation each other all on jobs. Computational experiments benchmark problem instances reveal that, case scenario job, faster than those ge...