Project scheduling is the part of project management that deals with determining when intime to start (and finish) which activities and with the allocation of scarce resources to theproject activities. In practice, virtually all project managers are confronted with resourcescarceness. In such cases, the Resource-Constrained Project Scheduling Problem (RCPSP)arises. This optimization problem has...

This paper reviews modern genetic algorithm based approaches for solving job shop scheduling problems Genetic algorithms represent one of the most popular and mostly used metaheuristic methods applied for solving many optimization problems within last few decades. Job shop scheduling represents one of the hardest combinatorial optimization problems where number of possible schedules drastically...

We consider a variety of preemptive scheduling problems with controllable processing times on a single machine and on identical/uniform parallel machines, where the objective is to minimize the total compression cost. In this paper, we propose fast divide-and-conquer algorithms for these scheduling problems. Our approach is based on the observation that each scheduling problem we discuss can be...

This paper employs an interactive possibility linear programming approach to solve a single machine scheduling problem with imprecise processing times, due dates, as well as earliness and tardiness penalties of jobs. The proposed approach is based on a strategy of minimizing the most possible value of the imprecise total costs, maximizing the possibility of obtaining a lower total costs, and mi...

Considering the standard particle swarm optimization (PSO) has the shortcomings of low convergence precision in job shop scheduling problems, the job shop scheduling solution is presented based on improved particle swarm optimization (A-PSO). In this paper, the basic theory of A-PSO is described. Also, the coding and the selection of parameters as well as the decoding of A-PSO are studied. It u...

In the area of optimization of public transportation there are several methods for modeling and solving vehicle and driver scheduling problems. We designed a sequential heuristic method for solving the combined (vehicle and driver scheduling) problem. Our model is based on a modification of the vehicle schedules to satisfy driver requirements. We introduced a driver friendly approach of the opt...

Abstract The optimization of manufacturing systems is rarely a deterministic task in practice, as uncertainties various origins often have significant impact on the feasibility or quality production plan. decision making process complex multi-stage mechanism that anticipates and reacts to numerous parameter changes, both internal external. Such problems corresponding approaches are classified c...

Scheduling is a critical and challenging task in manufacturing systems, especially in largescale complex systems like wafer fabrication facilities. Although evolutionary algorithms (EAs) have demonstrated many successful applications in the field of manufacturing scheduling, there are very few studies on scheduling of wafer fabs using EAs. Dispatching rules are one of the most common techniques...

Optimization models for the production scheduling of power-intensive processes such as air separation can help realizing significant economical savings. However, if the electricity is procured in the dayahead or real-time market, the forecast for the hourly electricity prices contains a significant amount of uncertainty. In this work, we apply robust optimization to the uncertain electricity pr...