Results 231 to 240 of about 43,665 (268)
Some of the next articles are maybe not open access.
European Journal of Operational Research, 1980
Abstract Scheduling operations on a farm is considered depending on the available men and machinery and on the influence of the weather on materials (moisture content). A simulation model with a heuristic strategy for selecting operations at each moment of decision based on the state of the system and a linear programming model are used in the grain ...
openaire +1 more source
Abstract Scheduling operations on a farm is considered depending on the available men and machinery and on the influence of the weather on materials (moisture content). A simulation model with a heuristic strategy for selecting operations at each moment of decision based on the state of the system and a linear programming model are used in the grain ...
openaire +1 more source
Scheduling Warehouse Operations
1990Perhaps the biggest drain on productivity in most warehouses is the “hurry up and wait” syndrome popularly associated with the military. One example is the unloading of a truckload of floor-loaded bags of product at a warehouse. There are at least three alternative loading methods.
openaire +1 more source
Operational Planning and Scheduling
1988In the optimal power flow (OPF) problem the optimization process is static. The cost of production is an instantaneous function of demands. Since the load varies on a continuous basis with fairly predictable patterns, optimization over certain time ranges becomes necessary for some time-dependent functions.
openaire +1 more source
Scheduling in the operating theatre.
Annals of the Royal College of Surgeons of England, 1984The effect of scheduling on the use of operating theatre time has been studied. Scheduling involved determining the average length of common operations and fitting them into the calculated available operating time. The technique has been shown to reduce significantly the variation in length of operating sessions, and it ensures the best use of ...
M B, Rose, D C, Davies
openaire +1 more source
2001
We have shown in Section 7.4 that the operations scheduling problem (7.1) – (7.9) is NP-hard. Hence, optimal algorithms are not applicable for industrial applications, where hundreds to thousands of operations have to be scheduled within minutes of CPU-time. We will therefore consider two types of heuristics: construction heuristics in Section 10.1 (cf.
openaire +1 more source
We have shown in Section 7.4 that the operations scheduling problem (7.1) – (7.9) is NP-hard. Hence, optimal algorithms are not applicable for industrial applications, where hundreds to thousands of operations have to be scheduled within minutes of CPU-time. We will therefore consider two types of heuristics: construction heuristics in Section 10.1 (cf.
openaire +1 more source