Pages that link to "Item:Q2253532"
From MaRDI portal
The following pages link to Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine (Q2253532):
Displayed 11 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine (Q474786) (← links)
- Group scheduling with general autonomous and induced learning effect (Q1720558) (← links)
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review (Q1926950) (← links)
- Research on single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs (Q2282925) (← links)
- Scheduling problems with effects of deterioration and truncated job-dependent learning (Q2354204) (← links)
- Algorithms for single-machine scheduling problem with deterioration depending on a novel model (Q2628177) (← links)
- Scheduling jobs with controllable processing time, truncated job-dependent learning and deterioration effects (Q2628200) (← links)
- A survey on scheduling problems with due windows (Q2630089) (← links)
- Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm (Q4972548) (← links)
- Due-Window Assignment for a Single Machine Scheduling with Both Deterioration and Positional Effects (Q5265454) (← links)
