In this paper, we conduct a study of the job-shop scheduling problem with reverse flows. This NP-hard problem is …

employee scheduling problem, i.e. nurse rostering with many hard and soft constraints. By employing a goal programming model … time-predefined meta-heuristic approach, which we call the falling tide algorithm, and apply it under a multi …

presented problem is a generalization of the parallel-machine scheduling problem with unrelated machines, non-batch sequence …-dependent setup times and a weighted sum of completion times – thus, it is NP-hard. Using literature on scheduling and routing, we … propose and computationally compare several heuristics, including a Monte Carlo-based heuristic, the joint application of 8 …

, preventive maintenance is required. In this paper we discuss the Preventive Maintenance Scheduling Problem (PMSP), where (short … mathematical formulation for this problem and some greedy heuristics to solve it fast. Moreover, we compare the performance of … these heuristics with the optimal solution using some randomly generated instances. …

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. …

In this paper, we present beam search heuristics for the single machine scheduling problem with quadratic earliness and … tardiness costs, and no machine idle time. These heuristics include classic beam search procedures, as well as filtered and … recovering algorithms. We consider three dispatching heuristics as evaluation functions, in order to analyse the effect of …

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

instances. The heuristics include simple scheduling rules, as well as a procedure that takes advantage of the strengths of these …In this paper, we consider the single machine scheduling problem with linear earliness and quadratic tardiness costs …, and no machine idle time. We propose several dispatching heuristics, and analyse their performance on a wide range of …