Pages that link to "Item:Q350495"
From MaRDI portal
The following pages link to On single processor scheduling problems with learning dependent on the number of processed jobs (Q350495):
Displaying 9 items.
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
- Strong NP-hardness of scheduling problems with learning or aging effect (Q363599) (← links)
- Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191) (← links)
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (Q905364) (← links)
- Group scheduling with general autonomous and induced learning effect (Q1720558) (← links)
- Approximation algorithms for some position-dependent scheduling problems (Q2217459) (← links)
- Research on single machine SLK/DIF due window assignment problem with learning effect and deteriorating jobs (Q2282925) (← links)
- Two-agent scheduling problems with the general position-dependent processing time (Q2333788) (← links)
- A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects (Q2337180) (← links)
