This paper investigates the issue of an economic manufacturing quantity model for defective products involving imperfect production processes and rework. We consider that the demand is sensitive to promotional efforts/sales teams’ initiatives as well as the setup cost can be reduced through further investment. It also assumes that fixed quantity multiple installments of the finished batch are d...

As society places greater demands on technology, it becomes increasingly important to be able to simulate that technology. While simulation tools can be very sophisticated and capable of handling very complex devices and structures, the cost paid in computation time can be prohibitive. To reduce this time, a number of one-step schemes have been developed, but these schemes suffer from a setup t...

This paper presents an ant colony optimization (ACO) approach in solving integrated process planning and scheduling (IPPS) with the consideration of setup time. Lots of approaches are proposed to solve the IPPS problem. Most of these approaches ignored the consideration of setup time in order to simplify the problem. This practice may be justifiable for some situations. However, it is not pract...

One of the earliest results in flow shop scheduling theory is an algorithm given by Johnson’s [1] for scheduling jobs on two or three machines to minimize the total elapsed time whenever the processing times of jobs are random. The present paper is an attempt to develop a heuristic algorithm for two stages specially structured flow shop scheduling in which the processing times of the jobs a...

Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...

The two-machine permutation flowshop scheduling problem to minimize makespan or total completion time criterion is addressed where setup times are considered to be separate from processing times. Setup times are relaxed to be random variables as opposed to the common assumption in the literature that setup times are exactly known (deterministic) in advance. The probability distributions of setu...

extensive research has been devoted to resource constrained project scheduling problem. however, little attention has been paid to problems where a certain time penalty must be incurred if activity preemption is allowed. in this paper, we consider the project scheduling problem of minimizing the total cost subject to resource constraints, earliness-tardiness penalties and preemption penalties, ...