This work proposes a unified heuristic algorithm for a large class of earliness–tardiness (E–
T) scheduling problems. We consider single/parallel machine E–T problems that may or may …

The NP-hard single machine sequence-dependent group scheduling problem with
minimization of total weighted earliness and tardiness is investigated. An arc-time-indexed …

In this paper, we address the temporal knapsack problem (TKP), a generalization of the
classical knapsack problem, where selected items enter and leave the knapsack at fixed …

This paper investigates the potential use of hyper-heuristics and multi agent approach for
solution of the real single machine production scheduling problem. A framework consisting …

This work considers scheduling problems on single and parallel machines with arbitrary
processing times and independent jobs, to minimize the sum of earliness-tardiness …

This article addresses multiprocessor scheduling of modular jobs while taking into account a
balance requirements for each time interval. First, a brief description of just-in-time (JIT) …

The main contribution of this work is to investigate the hypothesis that the performance of the
Simulated Annealing (SA) algorithm can be improved by combining it with other sampling …

Актуальність теми. Планування–процес прийняття рішень, що має важливе значення як
у виробничих системах, так і у сфері різноманітних послуг. Постановкам задач …

We present a strategy to improve an evolutionary process related to a hybridization of a
genetic algorithm, strongly based on local search, for the weighted tardiness and Just-in …

This paper addresses the single machine scheduling problem with distinct time windows,
sequence-dependent setup times (SMSPETP) which consists in minimizing the total …