An algorithm of simulated annealing for the job shop scheduling problem is presented. The proposed algorithm restarts with a new value every time the previous algorithm finishes. To begin the process of annealing, the starting point is a randomly generated schedule with the condition that the initial value of the makespan of the schedule does not surpass a previously established upper bound. Th...

The economic lot scheduling problem (ELSP) is a well known problem that focuses on scheduling the production of multiple items on a single machine such that inventory and setup costs are minimized. In this paper, we extend the ELSP to include price optimization with the objective to maximize profits. A solution approach based on column generation is provided and shown to produce very close to o...

In this paper, a model predictive control (MPC)-based coordinated scheduling framework for variable wind generation and battery energy storage systems (BESSs) is presented. On the basis of the short-term forecast of available wind generation and price information, a joint look-ahead optimization is performed by the wind farm and storage system to determine their net power injection to the elect...

Microgrids (MGs) usually consist of several types of Distributed Energy Resources (DERs) like renewable and conventional generation units, energy storages and responsive loads. In order to operate the MG with minimum cost and maximum reliably, an integrated scheduling model of DERs should be implemented. In this paper, an operational planning model of a MG which considers Demand Response (DR) a...

In this paper, we develop new methods for adjusting connguration parameters of genetic algorithms operating in a noisy environment. Such methods are related to the scheduling of resources for tests performed in genetic algorithms. Assuming that the population size is given, we address two problems related to the design of eecient scheduling algorithms speciically important in noisy environments...

With the opening of the power industry to competition, the power system structure is changing. According to these changes, power system operation, planning, and control need modifications. Under this deregulated power market, generation companies (GENCOs) can schedule their generators to maximize their own profit without accurately satisfying system demand/reserve, which is a traditional short-...

This dedicated volume of the AIPS "96 proceedings is devoted to a progress report on the ARPA / Rome Laboratory Knowledge-based Planning and Scheduling Initiative (or ARPI for short). The ARPI has been co-sponsored by the Advanced Research Projects Agency (ARPA) and the United States Air Force Rome Laboratory (RL) since 1989. The ARPI’s main purpose is the development of the next generation of ...

This paper addresses the Ground Crew Rostering Problem with Work Patterns, an important manpower planning problem arising in the ground operations of airline companies. We present a cutting stockbased integer programming formulation of the problem and describe a powerful heuristic decomposition approach, which utilizes column generation and variable fixing, to construct efficient rosters for a ...

This paper presents two different models and algorithms for integrated vehicle and crew scheduling in the multiple-depot case. The algorithms are both based on a combination of column generation and Lagrangian relaxation. Furthermore, we compare those integrated approaches with each other and with the traditional sequential one on random generated as well as real-world data instances for a subu...

This paper tackles a generalization of the weight constrained shortest path problem in a directed network (WCSPP) in which replenishment arcs, that reset the accumulated weight along the path to zero, appear in the network. Such situations arise, for example, in airline crew pairing applications, where the weight represents duty hours, and replenishment arcs represent crew overnight rests, and ...