Pages that link to "Item:Q3779989"
From MaRDI portal
The following pages link to The Fixed Job Schedule Problem with Spread-Time Constraints (Q3779989):
Displaying 25 items.
- A constraint-based approach for the shift design personnel task scheduling problem with equity (Q336540) (← links)
- Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex (Q336558) (← links)
- Tactical fixed job scheduling with spread-time constraints (Q337014) (← links)
- Improving fleet utilization for carriers by interval scheduling (Q439488) (← links)
- Algorithms for large scale shift minimisation personnel task scheduling problems (Q439608) (← links)
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution (Q763242) (← links)
- Routing trains through railway stations: Complexity issues (Q1278725) (← links)
- Maximizing the value of a space mission (Q1342007) (← links)
- An analysis of shift class design problems (Q1342640) (← links)
- Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883) (← links)
- A dynamic programming based algorithm for the crew scheduling problem. (Q1406659) (← links)
- A matheuristic for the driver scheduling problem with staff cars (Q1711474) (← links)
- Computing strong lower and upper bounds for the integrated multiple-depot vehicle and crew scheduling problem with branch-and-price (Q1725820) (← links)
- Greedy randomized adaptive search procedures (Q1804580) (← links)
- Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem (Q2453730) (← links)
- A labeling method for dynamic driver-task assignment with uncertain task durations (Q2488239) (← links)
- A metaheuristic for the fixed job scheduling problem under spread time constraints (Q2654393) (← 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)
- Spread time considerations in operational fixed job scheduling (Q3432669) (← links)
- Solving a bus driver scheduling problem with randomized multistart heuristics (Q4918247) (← links)
- Crew Assignment with Duty Time Limits for Transport Services: Tight Multicommodity Models (Q5080634) (← links)
- Breaking 1 - 1/e Barrier for Nonpreemptive Throughput Maximization (Q5130573) (← links)
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems (Q6066616) (← links)