Pages that link to "Item:Q2253624"
From MaRDI portal
The following pages link to Single-machine scheduling problems with actual time-dependent and job-dependent learning effect (Q2253624):
Displaying 16 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Bi-criteria single machine scheduling with a time-dependent learning effect and release times (Q345517) (← links)
- Flowshop scheduling problems with a position-dependent exponential learning effect (Q474618) (← links)
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect (Q611619) (← links)
- Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects (Q1751144) (← links)
- Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases (Q1993121) (← links)
- Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect (Q2075460) (← links)
- Scheduling jobs with position and sum-of-processing-time based processing times (Q2278782) (← links)
- A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects (Q2337180) (← links)
- A survey on scheduling problems with due windows (Q2630089) (← links)
- Single-machine scheduling with an actual time-dependent learning effect (Q3512383) (← links)
- (Q4640398) (← links)
- Parallel-batching machines scheduling problem with a truncated time-dependent learning effect via a hybrid CS-JADE algorithm (Q4972548) (← links)
- Complexity results for single-machine scheduling with positional learning effects (Q5447775) (← links)
- A short note on ``A note on single-machine scheduling with job-dependent learning effects'' (Q6072206) (← links)
- Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs (Q6112732) (← links)
