Výsledky vyhľadávania - cloud theory-based iterated greedy algorithm

Minimising makespan in distributed mixed no-idle flowshops Autor Cheng, Chen-Yang, Ying, Kuo-Ching, Chen, Hsia-Hsiang, Lu, Hsiao-Shan

“… A novel cloud theory-based iterated greedy (CTBIG) algorithm was proposed for solving the problem…”
Získať plný text

Minimizing the Sum of Makespan and Total Weighted Tardiness in a No-Wait Flowshop Autor Lin, Shih-Wei, Lu, Chung-Cheng, Ying, Kuo-Ching

“…This paper presents a cloud theory-based iterated greedy (CTIG) algorithm for solving the no-wait flowshop scheduling problem (NWFSP…”
Získať plný text

A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration Autor Wu, Chin-Chia, Bai, Danyu, Azzouz, Ameni, Chung, I.-Hong, Cheng, Shuenn-Ren, Jhwueng, Dwueng-Chwuan, Lin, Win-Chin, Said, Lamjed Ben

“… Four metaheuristics are proposed to approximate the solutions: genetic algorithms, cloud theory-based simulated annealing, artificial bee colonies and iterated greedy algorithms…”
Získať plný text

Minimizing the Makespan for a Two-Stage Three-Machine Assembly Flow Shop Problem with the Sum-of-Processing-Time Based Learning Effect Autor Lin, Win-Chin

“…Two-stage production process and its applications appear in many production environments. Job processing times are usually assumed to be constant throughout…”
Získať plný text