The following pages link to (Q4826104):
Displaying 24 items.
- Reliability of task graph schedules with transient and fail-stop failures: complexity and algorithms (Q2434302) (← links)
- Exponential neighborhood search for a parallel machine scheduling problem (Q2459402) (← links)
- Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups (Q2468493) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- An iterative exact algorithm for the weighted fair sequences problem (Q2676411) (← links)
- (Q2734595) (← links)
- Scheduling computer and manufacturing processes. (Q2735585) (← links)
- Scheduling on parallel machines considering job-machine dependency constraints (Q2883591) (← links)
- Job shop scheduling with unit length tasks (Q2905324) (← links)
- Adjacent-Resource Scheduling (Q3439486) (← links)
- Batch Coloring Flat Graphs and Thin (Q3512459) (← links)
- (Q4323632) (← links)
- (Q4396949) (← links)
- (Q4434437) (← links)
- Hierarchical optimization on an unbounded parallel-batching machine (Q4579881) (← links)
- Scheduling theory. Multi-stage systems. Transl. from the Russ. and updated by the authors (Q4841579) (← links)
- Handbook on Scheduling (Q5754725) (← links)
- On scheduling with the non-idling constraint (Q5895181) (← links)
- Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)
- On scheduling with the non-idling constraint (Q5925167) (← links)
- Collective schedules: axioms and algorithms (Q6109540) (← links)
- Machine scheduling with job rejection and Dejong's learning effect (Q6112831) (← links)
- A competitive online algorithm for minimizing total weighted completion time on uniform machines (Q6534502) (← links)
- Fixed-parameter tractability of scheduling dependent typed tasks subject to release times and deadlines (Q6547133) (← links)
