Pages that link to "Item:Q5447775"
From MaRDI portal
The following pages link to Complexity results for single-machine scheduling with positional learning effects (Q5447775):
Displaying 22 items.
- On single processor scheduling problems with learning dependent on the number of processed jobs (Q350495) (← links)
- Strong NP-hardness of scheduling problems with learning or aging effect (Q363599) (← links)
- Some single-machine scheduling problems with actual time and position dependent learning effects (Q376654) (← links)
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (Q425519) (← links)
- A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects (Q454917) (← links)
- Single-machine scheduling problems with a sum-of-processing-time-based learning function (Q606421) (← 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 general effects of learning and deterioration (Q630729) (← links)
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations (Q730961) (← links)
- Note on the time complexity of resource constrained scheduling with general truncated job-dependent learning effect (Q830922) (← links)
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations (Q845319) (← links)
- Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects (Q1040180) (← links)
- The single-machine total weighted tardiness scheduling problem with position-based learning effects (Q1762088) (← links)
- Proportionate flowshops with general position-dependent processing times (Q1944066) (← links)
- Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases (Q1993121) (← links)
- Group scheduling with learning effect and random processing time (Q2240193) (← links)
- Single-machine scheduling with both deterioration and learning effects (Q2267309) (← links)
- Some scheduling problems with general position-dependent and time-dependent learning effects (Q2390362) (← links)
- A state-of-the-art review on scheduling with learning effects (Q2470096) (← links)
- A note on resource allocation scheduling with position-dependent workloads (Q5058801) (← links)
- Scheduling with variable time slot costs (Q5189246) (← links)
- Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration (Q6102698) (← links)