... Hoist **scheduling** is distinguished from classical **scheduling** problems, such as flowshop or jobshop, in that, first, no waiting of jobs during an operation is permissible, second, travel times of an operation ...

22

... The task allocation **problem** has been investigated by many researchers [3], [4], [8], [9], [10], [13], [14]. Various heuristic methods have been proposed, such as mincut-based heuristics, orthogonal recursive ...

10

... Shop **Scheduling** **Problem** preliminary results are promising and showed its potential by providing new near-optimal solution for the whole set of instances selected for ...

3

... a **scheduling** **problem** developed for a company that produces flexible packaging, presented in quite a general form ...this **problem** it is necessary to schedule several jobs that involve four process and ...

12

... So far, there exist a few applications of the ACO approach to **scheduling** problems. Dorigo et al. [10, 11] and Zwaan et al. [18] reported some promising results for the Job Shop **Scheduling** prob- lem. ...

11

... Machine **Scheduling** **Problem**: the **Scheduling** **Problem** with Time Windows and Minimal Overlap ...the **problem** consists on finding a starting time for each job which satisfies time window ...

11

... the **problem** of allocating a number of non-identical tasks in a multiprocessor or multicomputer ...list **scheduling** algorithm (LSA) is contrasted with an evolutionary approach using a direct representation of ...

9

... Seeing the different shades in tables 2, 3, and 4, we can notice that the EDD heuristic is the darkest in all the problems and instances, followed by SLACK heuristic in the second place, and SPT in the third place. The ...

12

... intelligence. **Scheduling** problems typically comprise several concurrent (and often conflicting) goals, and several resources which may be allocated in order to satisfy these ...to **scheduling** have been ...

3

... Approximate methods [3, 4 and 5] on the other hand, do try to solve the most complex variants in which task and machine behavior intervenes as we previously mentioned. These methods do not analyze exhaustively every ...

10

... Pairing **Problem**) para que produzca un coste mínimo por tripulante y en el que considera de igual forma a tripulantes técnicos y tripulantes de cabina por influir de igual manera en el problema, aunque se centra en ...

44

... Project **Scheduling** **Problem** (FPSP), also known as the Capital Constrained **Problem**, is an optimization **problem** considered of crucial importance to support financial decisions under the ...

24