Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search

DOI10.1016/j.cor.2005.08.001zbMath1189.90063OpenAlexW2022471105MaRDI QIDQ868140

Christian Roed Pedersen, Kim Allan Andersen, Rasmus V. Rasmussen

Publication date: 19 February 2007

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2005.08.001

zbMATH Keywords

tabu searchprecedence constraintslarge-scale schedulingelastic jobspractical application

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (2)

Project scheduling with finite or infinite number of activity processing modes -- a survey ⋮ Minimizing makespan for multi-spindle head machines with a mobile table

Uses Software

• BL data set
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Logic-based Benders decomposition
• Constraint-based scheduling: Applying constraint programming to scheduling problems.
• Scheduling groups of tasks with precedence constraints on three dedicated processors.
• Performance evaluation of a parallel tabu search task scheduling algorithm
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems
• An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
• Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
• Tabu Search—Part I
• A Reactive Tabu Search Metaheuristic for the Vehicle Routing Problem with Time Windows
• Scheduling using tabu search methods with intensification and diversification

This page was built for publication: Solving a large-scale precedence constrained scheduling problem with elastic jobs using tabu search