Heuristic Algorithm for Single Resource Constrained Project Scheduling Problem Based on the Dynamic Programming
Heuristic algorithms for preemptive scheduling in a two-stage flowshop with unrelated parallel machines and 0-1 resource requirements
Heuristic Approach to Train Rescheduling
Heuristic solving a bicriteria parallel-machine scheduling problem
How to eliminate non-positive circuits in periodic scheduling: a proactive strategy based on shortest path equations
Usual periodic scheduling problems deal with precedence constraints having non-negative latencies. This seems a natural way for modelling scheduling problems, since task delays are generally non-negative quantities. However, in some cases, we need to consider edges latencies that do not only model task latencies, but model other precedence constraints. For instance in register optimisation problems devoted to optimising compilation, a generic machine or processor model can allow considering access...
Hybrid flow-shop with adjustment
The subject of this paper is a flow-shop based on a case study aimed at the optimisation of ordering production jobs in mechanical engineering, in order to minimize the overall processing time, the makespan. The production jobs are processed by machines, and each job is assigned to a certain machine for technological reasons. Before processing a job, the machine has to be adjusted; there is only one adjuster who adjusts all of the machines. This problem is treated as a hybrid two-stage flow-shop:...