This paper proposes a novel technique for solving generation scheduling and ramp rate constrained unit commitment. A modified objective function associated with a new start-up cost term is introduced in this paper. The proposed method is used to solve generating scheduling problem satisfying SRR, minimum up and down time as well as ramp rate constraints. Two case studies are conducted to imp...

ly, the runway scheduling problem (RSP) can be thought of as a job shop scheduling problem [11] with precedence and release time constraints, where the objective is to sequence a set of jobs (aircraft) in a particular order to be processed by a processor (runway) so that some cost function is minimized. For the runway scheduling problem, one wants to find an efficient schedule for aircraft to u...

Quantum annealing is a quantum computing approach widely used for optimization and probabilistic sampling problems. It an alternative designed due to the limitations of gate-based models. The method observed have significant impact on different fields such as machine learning, graphics, routing, scheduling, computational chemistry, biology, security, portfolio, others despite fact that it relat...

in static scheduling problem, where there is no change in situation, the challenge is that the large problems can be solved in a short time. in this paper, the static scheduling problem of automated guided vehicles in container terminal is solved by the network simplex algorithm (nsa). the algorithm is based on graph model and their performances are at least 100 times faster than traditional si...

this paper deals with the single machine multi-product lot scheduling problem in which defective items are produced in any production run of each product. we have adopted the common cycle scheduling policy and assumed that the setup times for production of each product can be non-zero. further, we have assumed that defective items will be reworked and the inspection costs during the normal prod...

nowadays, scheduling problems have a considerable application in production and service systems. in this paper, we consider the scheduling of n jobs on a single machine assuming no machine idleness, non-preemptive jobs and equal process times. in many of previous researches, because of the delivery dalays and holding costs, earliness and tardiness penalties emerge in the form of linear combinat...

in this study, we present a mrcpsp/max (multi-mode resource-constrained project scheduling problem with minimum and maximum time lags) model with minimization tardiness costs and maximization earliness rewards of activities as objective. the proposed model is nearby to real-world problems and has wide applications in various projects. this problem is not available in the literature exactly and ...

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 examines the problem of routing known water demands through gate-controlled, open-channel irrigation delivery systems. Volume-compensation principles were used to route multiple demands in multiple-pool canal systems. The volume-compensation method schedules each demand change individually under the assumption of a series of steady states and superimposes the individual results. Volu...

In this paper, a preemptive multi-objective multi-mode project scheduling model for resource investment problem is proposed. The first objective function is to minimize the completion time of project (makespan);the second objective function is to minimize the cost of using renewable resources. Non-renewable resources are also considered as parameters in this model. The preemption of activities ...