Showing 1 - 10 of 174,453
lower bounds as well as nine efficient heuristics for solving the problem with the objective of minimizing makespan. The … randomly generated instances indicates that GVNS outperforms other heuristics. The performance of proposed heuristics and meta-heuristics …
Persistent link: https://www.econbiz.de/10012029504
, three construction heuristics and an Ant Colony System (ACS) algorithm are developed for solving this integrated problem …
Persistent link: https://www.econbiz.de/10011305782
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they...
Persistent link: https://www.econbiz.de/10011765286
of meta-heuristics have been proposed in the past. However, tuning algorithm-specific parameters for solving FFSP is … are chosen for the study because these are not only recent meta-heuristics but they do not require tuning of algorithm …
Persistent link: https://www.econbiz.de/10011887964
Purpose: Adjusted discrete Multi-Objective Invasive Weed Optimization (DMOIWO) algorithm, which uses fuzzy dominant approach for ordering, has been proposed to solve No-wait two-stage flexible flow shop scheduling problem. Design/methodology/approach: No-wait two-stage flexible flow shop...
Persistent link: https://www.econbiz.de/10011920773
Persistent link: https://www.econbiz.de/10010485486
We consider the problem of scheduling n jobs in a pallet-constrained two-machine flowshop so as to minimize the makespan. In such a flowshop environment, each job needs a pallet the entire time, from the start of its first operation until the completion of the last operation, and the number of...
Persistent link: https://www.econbiz.de/10014211244
A heuristic procedure is developed for minimizing makespan in flow-shop scheduling problems. In comparison with current algorithms, our algorithm seems to result in an improved makespan with a small additional computational effort. An algorithm is also developed to minimize the required number...
Persistent link: https://www.econbiz.de/10012746785
Persistent link: https://www.econbiz.de/10012316363
Persistent link: https://www.econbiz.de/10012417552