Pages that link to "Item:Q3990569"

The following pages link to Approximation Algorithms for Fixed Job Schedule Problems (Q3990569):

Displaying 29 items.

• Tactical fixed job scheduling with spread-time constraints (Q337014) (← links)
• Algorithms for large scale shift minimisation personnel task scheduling problems (Q439608) (← links)
• Approximation algorithms for time constrained scheduling (Q676776) (← links)
• Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
• Routing trains through railway stations: Complexity issues (Q1278725) (← links)
• An approximation algorithm for the license and shift class design problem (Q1328603) (← links)
• An analysis of shift class design problems (Q1342640) (← links)
• Scheduling jobs within time windows on identical parallel machines: New model and algorithms (Q1388825) (← links)
• Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883) (← links)
• On polynomial-time approximation algorithms for the variable length scheduling problem. (Q1401344) (← links)
• Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
• On the approximability of an interval scheduling problem (Q1806343) (← links)
• A lower bound for the job insertion problem. (Q1811122) (← links)
• Job release scheduling problem: complexity and an approximation algorithm (Q1946231) (← links)
• Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
• Runway sequencing with holding patterns (Q2482798) (← links)
• A metaheuristic for the fixed job scheduling problem under spread time constraints (Q2654393) (← links)
• On holonomic mathematical F-pendulum (Q2831027) (← links)
• Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm (Q3055658) (← links)
• Working time constraints in operational fixed job scheduling (Q3163130) (← links)
• A fixed job scheduling problem with machine-dependent job weights (Q3183761) (← links)
• Approximation Algorithms for the Assembly Line Crew Scheduling Problem (Q3220332) (← links)
• Spread time considerations in operational fixed job scheduling (Q3432669) (← links)
• The Fixed Job Schedule Problem with Spread-Time Constraints (Q3779989) (← links)
• The Fixed Job Schedule Problem with Working-Time Constraints (Q3826354) (← links)
• (Q4508364) (← links)
• APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS (Q5315931) (← links)
• Theoretical Computer Science (Q5897354) (← links)
• The optimal cost chromatic partition problem for trees and interval graphs (Q6550551) (← links)