-known longest-first heuristics - the LPT- (longest processing time) and the RLPT-heuristic (restricted LPT). We provide insights … into the solution structure of these two sequencing heuristics and prove that the minimum completion time of the LPT …

. The loading and unloading times are both equal to one time unit. The goal is to minimize the makespan. We propose a O …(n log n) solution algorithm for the preemptive variant of the problem. …

cost subject to the makespan being at its minimum. Since both problems are strongly NP-hard, we propose fast heuristics and … objectives. The first type is one of two classical objective functions in scheduling theory: either the total completion time or … the makespan. The second type involves an actual cost associated with the processing of a specific job on a given machine …

The hybrid flowshop scheduling (HFS) problem with the objective of minimising the makespan has important applications … in a variety of industrial systems. This paper presents an effective discrete artificial bee colony (DABC) algorithm that … heuristics. Next, an initial population is generated with a high level of quality and diversity based on the presented heuristics …

cumulative network accessibility throughout the cleanup operation and minimizes makespan. We propose several practical and robust …

develop a capacitated production planning model for a single product with terminal demand. We develop four heuristics for the … problem and characterize their performance. In particular, two of the heuristics are optimal for the no holding-cost case. In … our computational study, we analyze the performance of our heuristics and compare them to the optimal solution and to a …

demand, such that future forecasts lie within the current band. We develop heuristics that utilize knowledge of demand … explore the efficiency of our heuristics, and also explore the impact of seasonality on demand and availability of information …