Scheduling contractors' farm‐to‐farm crop harvesting operations

DOI10.1111/j.1475-3995.2006.00530.xzbMath1127.90350MaRDI QIDQ5488239

Les R. Foulds, C. B. Basnet, John M. Wilson

Publication date: 14 September 2006

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.1475-3995.2006.00530.x

zbMATH Keywords

integer programming; tabu search; harvesting; contractors; operations scheduling; farm-to-farm

Mathematics Subject Classification ID

90C10: Integer programming

90B35: Deterministic scheduling theory in operations research

90C59: Approximation methods and heuristics in mathematical programming

Related Items

Optimal working time distribution and routing for autonomous tractors based on heuristic algorithms, The traveling salesman problem with job-times (\textit{TSPJ}), Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem

Cites Work

• A branch-and-bound procedure for the resource-constrained project scheduling problem with generalized precedence relations
• Optimal resource leveling using non-serial dynamic programming
• Resource-constrained project scheduling: Notation, classification, models, and methods
• Applying tabu search to the job-shop scheduling problem
• Solving real-life vehicle routing problems efficiently using tabu search
• A Time-Oriented Branch-and-Bound Algorithm for Resource-Constrained Project Scheduling with Generalised Precedence Constraints