A lot of research has been done concerning the airline scheduling problem (ALP) and several of the heuristic methods used show good results. Three methods for resolving ALP problem are presented with their advantages and disadvantages. And we present a new method combining between three methods which gives us best results.

The development of a public test bed for manufacturing planning and scheduling brings a lot of design issues, along several dimensions: the content of the test bed, the testing protocol, the format of the data, and the management of the results obtained. The objective of the present paper is to discuss these issues and explain the rationale behind the choices that have been made in MaScLib, a l...

The integration of sequencing decisions in lot-sizing and scheduling problems has received an increased attention from the research community due to its inherent applicability to the real-world problems. In this paper, we develop and solve a synchronized and integrated two-level lot-sizing and scheduling problem motivated by a real-world problem arisen in the soft drink production. The soft dri...

“Planning and Scheduling in Manufacturing and Services” written by Michael L. Pinedo and published in the Springer Series in Operations Research is a recent book intended for a senior level or master level course on planning and scheduling either in an engineering or a business school. The book consists of four parts. Part I introduces the main features of scheduling models in manufacturing and...

this paper presents a simplifiedlagrangian multiplier based algorithm to solve the fixed head hydrothermalscheduling problem. in fixed head hydrothermal scheduling problem, waterdischarge rate is modeled as quadratic function of hydropower generation andfuel cost is modeled as quadratic function of thermal power generation. thepower output of each hydro unit varies with the rate of water discha...

This paper reports a lot-sizing and scheduling problem, which minimizes inventory and backlog costs of multiple products on M parallel machines with sequence-dependent set-up times over T periods. Problem solutions are represented as product subsets (ordered or unordered) for each machine m at each period t. The optimal lot sizes are then determined applying a linear program. A genetic algorith...