Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm

DOI10.1080/00207540701666204zbMath1198.90209OpenAlexW2013669493MaRDI QIDQ3055658

Özgür Özpeynirci, Oğuz Solyalı

Publication date: 8 November 2010

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701666204

zbMATH Keywords

column generationbranch and pricefixed job schedulingspread time constraintsdantzig-wolfe decomposition

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem ⋮ Tactical fixed job scheduling with spread-time constraints ⋮ A branch and price algorithm for the pharmacy duty scheduling problem ⋮ A branch-and-price algorithm for the aperiodic multi-period service scheduling problem

Cites Work

• Fixed interval scheduling: models, applications, computational complexity and algorithms
• Branch-and-price algorithms for the one-dimensional cutting stock problem
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• Interval scheduling on identical machines
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
• Spread time considerations in operational fixed job scheduling
• The Fixed Job Schedule Problem with Spread-Time Constraints
• An Optimal Solution for the Channel-Assignment Problem
• Approximation Algorithms for Fixed Job Schedule Problems
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Solving Parallel Machine Scheduling Problems by Column Generation
• Column Generation
• Integer programming approach to the printed circuit board grouping problem