Pages that link to "Item:Q763108"
From MaRDI portal
The following pages link to Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects (Q763108):
Displayed 14 items.
- Strong NP-hardness of scheduling problems with learning or aging effect (Q363599) (← links)
- Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times (Q395848) (← links)
- Scheduling jobs with truncated exponential learning functions (Q395856) (← links)
- Single-machine group scheduling with general deterioration and learning effects (Q437886) (← links)
- Scheduling problems with position dependent job processing times: computational complexity results (Q1761835) (← links)
- Several single-machine scheduling problems with general learning effects (Q1930782) (← links)
- Optimal due-date assignment problem with learning effect and resource-dependent processing times (Q2439495) (← links)
- Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time (Q2439496) (← links)
- Single machine scheduling with exponential learning functions (Q2448198) (← links)
- Research on permutation flow shop scheduling problems with general position-dependent learning effects (Q2449372) (← links)
- Some results of the worst-case analysis for flow shop scheduling with a learning effect (Q2449373) (← links)
- Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times (Q2931172) (← links)
- Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times (Q3455877) (← links)
- A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect (Q5255177) (← links)
