Pages that link to "Item:Q3826354"
From MaRDI portal
The following pages link to The Fixed Job Schedule Problem with Working-Time Constraints (Q3826354):
Displayed 20 items.
- A constraint-based approach for the shift design personnel task scheduling problem with equity (Q336540) (← links)
- Algorithms for large scale shift minimisation personnel task scheduling problems (Q439608) (← links)
- Resource allocation with time intervals (Q606987) (← links)
- A bus driver scheduling problem: A new mathematical model and a GRASP approximate solution (Q763242) (← links)
- Branching strategies to improve regularity of crew schedules in ex-urban public transit (Q841588) (← links)
- A new dominance procedure for combinatorial optimization problems (Q1109683) (← links)
- Routing trains through railway stations: Complexity issues (Q1278725) (← links)
- Pre-processing techniques for resource allocation in the heterogeneous case (Q1296109) (← links)
- Order selection on a single machine with high set-up costs (Q1309884) (← 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)
- 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)
- Interval scheduling on identical machines (Q2564884) (← links)
- Working time constraints in operational fixed job scheduling (Q3163130) (← links)
- A Triplet-Based Exact Method for the Shift Minimisation Personnel Task Scheduling Problem (Q3452768) (← links)
- Distributed algorithms for maximum cliques (Q4338575) (← links)
- Solving a bus driver scheduling problem with randomized multistart heuristics (Q4918247) (← links)