In this paper, a new mathematical model for the problem of job scheduling in virtual manufacturing cells (VMC) is presented to minimizing the completion time of all jobs. Sequence dependent setup times of machines is considered and lot-streaming is possible. In Virtual manufacturing cells, each job has a different processing path and there is a set of machines for processing each operation. The...

We study a variant of the Stochastic Economic Lot Scheduling Problem (SELSP) in which a single production facility must produce several grades to meet random stationary demand for each grade from a common finished-goods (FG) inventory buffer with limited storage capacity. Demand that can not be satisfied directly from inventory is lost. Raw material is always available, and the production facil...

This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...

We study a variant of the Stochastic Economic Lot Scheduling Problem (SELSP) in which a single production facility must produce several grades to meet random stationary demand for each grade from a common finished-goods (FG) inventory buffer with limited storage capacity. Demand that can not be satisfied directly from inventory is lost. Raw material is always available, and the production facil...

Abstract In a single item dynamic lot-sizing problem, we are given time horizon and demand for in every period. The problem seeks solution that determines how much to produce carry at each period, so will incur the least amount of production inventory cost. When remanufacturing option is included, input comprises number returned products period can be potentially remanufactured satisfy demands,...

There are many benefits for coordination of multiple suppliers when single supplier cannot satisfy buyer demands.  In addition, buyer needs to purchase multiple items in a real supply chain. So, a model that satisfies these requests has many advantages. We extend the existing approaches in the literature that assume all suppliers need to be put on a common replenishment cycle and each supplier ...

This paper deals with the single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. We have adopted the common cycle scheduling policy and assumed that the setup times for production of each product can be non-zero. Further, we have assumed that defective items will be reworked and the inspection costs during the normal prod...

This article addresses the economic lot sizing and scheduling problem in flexible flow lines with unrelated parallel machines over a finite planning horizon. The objective is determination of a cyclic schedule that minimizes the sum of setup and inventory holding costs per unit time without any stock-out. A new mixed zero–one nonlinear mathematical programming has been developed for the problem...