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

DOI10.1080/00207540701666204MaRDI QIDQ3055658zbMATH OpenOpenAlexFDO

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

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

branch and pricecolumn generationdantzig-wolfe decompositionfixed job schedulingspread time constraints

Mathematics Subject Classification ID

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

Recommendations

• The Fixed Job Schedule Problem with Spread-Time Constraints
• A metaheuristic for the fixed job scheduling problem under spread time constraints
• Spread time considerations in operational fixed job scheduling
• A branch and bound algorithm for the job-shop scheduling problem
• Tactical fixed job scheduling with spread-time constraints
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• A branch-and-price algorithm for the multi-activity multi-task shift scheduling problem
• A branch-and-price algorithm for parallel machine scheduling with time windows and job priorities
• scientific article; zbMATH DE number 1462943

Cites work

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

Cited in

(10)

• A branch-and-price algorithm for the aperiodic multi-period service scheduling problem
• A metaheuristic for the fixed job scheduling problem under spread time constraints
• Working time constraints in operational fixed job scheduling
• A fixed job scheduling problem with machine-dependent job weights
• Tactical fixed job scheduling with spread-time constraints
• A branch and price algorithm for the pharmacy duty scheduling problem
• Spread time considerations in operational fixed job scheduling
• A triplet-based exact method for the shift minimisation personnel task scheduling problem
• The Fixed Job Schedule Problem with Spread-Time Constraints
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach

This page was built for publication: Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055658)