The following pages link to (Q3771949):
Displaying 24 items.
- On the computational complexity of (maximum) shift class scheduling (Q684343) (← links)
- Isomorphic scheduling problems (Q744639) (← links)
- Structured solutions in scheduling problems (Q761955) (← links)
- Necessary and sufficient conditions of optimality for some classical scheduling problems (Q852941) (← links)
- A scheduling problem with job values given as a power function of their completion times (Q954933) (← links)
- A note on `Efficient scheduling of periodic information monitoring requests' (Q1044176) (← links)
- A large scale timetabling problem (Q1112719) (← links)
- Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem (Q1197646) (← links)
- A framework for decision support systems of scheduling problems (Q1278979) (← links)
- Dynamic problems of scheduling (Q1289167) (← links)
- A greedy algorithm for the solution of the classical NP-hard scheduling problem of minimizing the total delay (Q2069704) (← links)
- A survey of methods for the solution of problems of scheduling theory (Q2718206) (← links)
- Classifications, advances and prospects of scheduling games (Q2927381) (← links)
- Scheduling problem: complexity analysis and polynomially solvable subclasses (Q3125964) (← links)
- (Q3703641) (← links)
- (Q3735431) (← links)
- (Q3770266) (← links)
- Computer-Aided complexity classification of combinational problems (Q3953190) (← links)
- (Q3972053) (← links)
- (Q4673744) (← links)
- (Q4796706) (← links)
- A process scheduling problem arising from chemical production planning (Q4946703) (← links)
- (Q5753733) (← links)
- Solution of the Meeting Time Choice Problem for n Persons (Q6063705) (← links)
