Now showing items 1-3 of 3
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 ...
Customer order scheduling problem: a comparative metaheuristics study
The customer order scheduling problem (COSP) is defined as to determine the sequence of tasks to satisfy the demand of customers who order several types of products produced on a single machine. A setup is required whenever ...
New heuristic for the dynamic layout problem
(Palgrave Macmillan, 2003)
The dynamic layout problem addresses the situation where the traffic among the various units within a facility changes over time. Its objective is to determine a layout for each period in a planning horizon such that the ...