The wellknown CLSP problem is generalized including sequence dependent setup times and overtimes and modeling it as a quadratic mixed 0-1 integer programming problem called Capacitated Lot Sizing Problem with Sequence Dependent Setups and Overtimes. We develop a heuristics based on Lagrangean relaxation and tabu search for solving the problem. At the end, some computational results are presented.

Economic lot size scheduling problem (ELSP) for a multi-product single machine system is a classical problem. This paper considers ELSP with budgetary constraint as an important aspect of such systems. In the real world situations the available funds for investment in inventory is limited. By adopting the common cycle time approach to ELSP, we obtain the optimal common cycle which minimizes the...

The Single Machine Scheduling with Changeover Costs problem is found in many different workshops. In this case, the main criterion is the sequence-dependent changeover-costs or setup times. This Scheduling problem can be modeled as a Traveling Salesman Problem (TSP) and when time constraints are inserted into the model such as due-dates, the resulting problem is known as the Time Dependent Trav...

This paper deals with the problem of scheduling jobs in a parallel flow shop configuration under blocking constraint, which setup time machines depends not only on job to be processed but also previously one, i.e., there are sequence-dependent times. The performance analysis several iterated greedy algorithms different initial solution procedures and local searches lets us define an efficient a...

We consider two queueing control problems that are stochastic versions of the economic lot scheduling problem: A single server processes N customer classes, and completed units enter a 'nished goods inventory that services exogenous customer demand. Unsatis'ed demand is backordered, and each class has its own general service time distribution, renewal demand process, and holding and backorderin...

In this paper, the capacitated lot-sizing and scheduling problem with sequence dependent setup times costs in a closed loop supply chain is addressed. The system utilizes closed-loop strategy so that multi-class single-level products are produced through both manufacturing of raw materials remanufacturing returned recovered products. system, single machine limited capacity each time period used...

This paper investigates the single-machine due-window assignment scheduling with truncated learning effects and past-sequence-dependent setup times simultaneously. The scheduler has option of job-rejection, i.e., some jobs are processed other rejected. Under three (i.e., common, slack different) methods, our goal is to minimize sum a general earliness-tardiness cost weighted earliness-tardiness...