Now showing items 1-2 of 2
A beam search algorithm to optimize robustness under random machine breakdowns and processing time variability
(Institute of Industrial Engineers, 2007)
The vast majority of the machine scheduling research assumes complete information about the scheduling problem and a static environment in which scheduling systems operate. In practice, however, scheduling systems are ...
A local search heuristic with self-tuning parameter for permutation flow-shop scheduling problem
In this paper, a new local search metaheuristic is proposed for the permutation flow-shop scheduling problem. In general, metaheuristics are widely used to solve this problem due to its NP-completeness. Although these ...