tendency to optimization in last decades has resulted in creating multi-product manufacturing systems. production planning in such systems is difficult, because optimal production volume that is calculated must be consistent with limitation of production system. hence, integration has been proposed to decide about these problems concurrently. main problem in integration is how we can relate pro...

This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...

the problem of lot sizing, sequencing and scheduling multiple products in flow line production systems has been studied by several authors. almost all of the researches in this area assumed that setup times and costs are sequence –independent even though sequence dependent setups are common in practice. in this paper we present a new mixed integer non linear program (minlp) and a heuristic meth...

This paper addresses scheduling and memory management in input queued switches having finite buffer space to improve the performance in terms of throughput and average delay. Most of the prior works on scheduling related to input queued switches assume infinite buffer space. In practice, buffer space being a finite resource, special memory management scheme becomes essential. We introduce a buf...

Generalized switch is a model of a queueing system where parallel servers are interdependent and have time-varying service capabilities. It includes as special cases the model of data scheduling in a wireless network and the input-queued cross-bar switch model. A finite set S of queues (users) are served in discrete time by a switch. Switch state h follows a discrete-time, finite-state Markov c...

This paper addresses the common cycle multi-product lot-scheduling problem in flexible flow lines (FFL) where the product demands are deterministic and constant over a finite planning horizon. Objective is minimizing the sum of setup costs, work-in-process and final products inventory holding costs per time unite while satisfying the demands without backlogging. This problem consists of a combi...

We consider a generalized switch model, which includes as special cases the model of multiuser data scheduling over a wireless medium [5, 1], the input-queued cross-bar switch model [3], and a discrete time version of a parallel server queueing system [2, 6]. Input flows, , are served in discrete time by a switch. Switch state follows a finite discrete time Markov chain. In each state , the swi...

This paper describes a technique for obtaining maximumthroughput schedules for iterative data-flow graphs, given a limited set of resources. The method is based on the use of the scheduling-range chart, where the scheduling window of each operation is displayed. This scheduling window, or scheduling range, is relative to a reference operation, and can be finite or infinite. The information in t...