Jobs can be batched if they share the same setup times on a machine in many practical situations. Another reason for batching arises when a machine can process several jobs at the same time. On the other hand, splitting a job or lot which consists of many identical items often increases customer service and decreases throughput time. Especially in CIM (Computer Integrated Manufacturing) these d...

Companies are trying to improve their ability to deliver and to reduce their production costs simultaneously. Nevertheless ongoing orders of customers are causing difficulties to deliver because of bottlenecks in the production. Furthermore constantly incoming customer orders effect that every actual optimal production plan with its already realized and planned guidelines has induced states tha...

cloud computing is the latest technology that involves distributed computation over the internet. it meets the needs of users through sharing resources and using virtual technology. the workflow user applications refer to a set of tasks to be processed within the cloud environment. scheduling algorithms have a lot to do with the efficiency of cloud computing environments through selection of su...

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

Lot sizing and scheduling in flow shop has been considered in this paper. Our study includes a multi-level and multi-period capacitated lot sizing and scheduling problem (CLSP) with sequence-dependent setups, setups carry over in flow shop. In manufacturing environments backlogging is unavoidable. If the production capacity is infinite, any demand can be satisfied

We consider mixed-integer linear programming (MIP) models of production planning problems known as the small bucket lot-sizing and scheduling problems. We present an application of a class of valid inequalities to the case with lost demand (stock-out) costs. Presented results of numerical experiments made for the the Proportional Lot-sizing and Scheduling Problem (PLSP) confirm benefits of such...