This paper deals with constraint handling in manufacturing. It starts with a basic de nition of the constraint satisfaction problem, followed by a description of consistency enforcing and constraint guided search. Constraint handling in scheduling problems is the main topic of the paper also presenting di erent types of schedule construction methods and explaining the use of temporal constraint...

Objective: The present study was hypothesized to investigate the beneficial effects of fresh, aged, and cooked garlic extracts on blood glucose and memory of diabetic rats induced by streptozocine (STZ). Material and Methods: Diabetes was induced by an intraperitoneal injection of STZ (60 mg/kg body weight). An oral dose of 1000 mg/kg of each garlic extract was given daily for 4 weeks after dia...

New algorithms based on mixed integer programming formulations are proposed for reactive scheduling in a dynamic, maketo-order manufacturing environment. The problem objective is to update a long-term production schedule subject to service level and inventory constraints, whenever the customer orders are modified or new orders arrive. Different rescheduling policies are proposed, from a total r...

Mixed integer programming (MIP) models are used for long-term production scheduling of open pit mines. However, formulations based on binary variables for mining blocks require too many variables and are often difficult or impossible to solve. This paper presents and tests alternative MIP scheduling models that have reduced the number of binary variables and solution times, thus increasing effi...

There are some large scale orebodies that extend from surface to the extreme depths of the ground. Such orebodies should be extracted by a combination of surface and underground mining methods. Economically, it is highly important to know the limit of upper and lower mining activities. This concern leads the mine designers to the transition problem, which is one of the most complicated problems...

We consider the problem of efficiently scheduling the production of goods for a model steel manufacturing company. We propose a new approach for solving this classic problem, using techniques from the statistical physics of complex networks in conjunction with depth-first search to generate a successful, flexible, schedule. The schedule generated by our algorithm is more efficient and outperfor...

In several countries, home care is provided for certain citizens living at home. The long-term home care scheduling problem is to generate work plans such that a high quality of service is maintained, the work hours of the employees are respected, and the overall cost is kept as low as possible. We propose a branchand-price algorithm for the long-term home care scheduling problem. The pricing p...

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 implem...

Long-term scheduling controls the degree of multiprogramming. The more processes that are created, the smaller is the percentage of time that each process can be executed. Thus the long term scheduler may limit the degree of multiprogramming to provide satisfactory service to the current set of processes. Whenever a process terminates, or the fraction of time that the processor is idle exceeds ...