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 ...
An analysis of heuristics in a dynamic job shop with weighted tardiness objectives
(Taylor & Francis, 1999)
Meeting due dates as a reflection of customer satisfaction is one of the scheduling criteria that is frequently encountered in today's manufacturing environments. The natural quantification of this qualitative goal involves ...