This paper addresses scheduling models in which a contribution of an individual job to the objective function is … and demonstrate that a linear assignment algorithm as part of previously known solution procedures can be replaced by a … faster matching algorithm that minimizes a linear form over permutations. Our approach reduces the running time of the …

For the basic problem of non-preemptively scheduling n independent jobs on m identical parallel machines so that the …-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 …

In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs ….The computational results show that using better rules improves the performance of the beam search heuristics. The detailed, filtered … (DBS) algorithm requires excessive computation times, and the RBS procedure then becomes the heuristic of choice. …

scheduling problem with earliness and tardiness costs and no machine idle time. The steady-state genetic algorithm generates …In this paper, we have proposed a hybrid permutation-coded steady-state genetic algorithm for a single machine …

We develop a new genetic algorithm to solve an integrated Equipment-Workforce-Service Planning problem, which features … extremely large scales and complex constraints. Compared with the canonical genetic algorithm, the new algorithm is innovative … in four respects: (1) The new algorithm addresses epistasis of genes by decomposing the problem variables into …