Now showing items 1-5 of 5
A new dominance rule for the total weighted tardiness problem
(Taylor & Francis, 1999)
We present a new dominance rule for the single machine total weighted tardiness problem with job dependent penalties. The proposed dominance rule provides a sufficient condition for local optimality. We show that if any ...
A beam search-based algorithm and evaluation of scheduling approaches for fexible manufacturing systems
(Taylor & Francis, 1998)
This paper presents a new algorithm for the flexible manufacturing system (FMS) scheduling problem. The proposed algorithm is a heuristic based on filtered beam search. It considers finite buffer capacity, routing and ...
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 integrated approach for airline scheduling, aircraft fleeting and routing with cruise speed control
To place an emphasis on profound relations among airline schedule planning problems and to mitigate the effect of unexpected delays, we integrate schedule design, fleet assignment and aircraft routing problems within a ...
Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories
(Academic Press, 2007)
We consider the problem of scheduling an application on a computing system consisting of heterogeneous processors and data repositories. The application consists of a large number of file-sharing otherwise independent ...