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 28 items.
- An assignment-based lower bound for a class of two-machine flow shop problems (Q336351) (← links)
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
- Several flow shop scheduling problems with truncated position-based learning effect (Q336658) (← links)
- Flowshop scheduling with a general exponential learning effect (Q336933) (← links)
- A note on ``Single-machine scheduling problems with both deteriorating jobs and learning effects'' (Q345550) (← links)
- 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)
- Single-machine scheduling with piece-rate maintenance and interval constrained position-dependent processing times (Q505770) (← links)
- Due-window assignment scheduling in the proportionate flow shop setting (Q827100) (← links)
- Scheduling identical jobs on uniform parallel machines under position-based learning effects (Q1637750) (← links)
- Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning (Q1667775) (← links)
- Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects (Q1667841) (← links)
- Scheduling problems with position dependent job processing times: computational complexity results (Q1761835) (← links)
- Single-machine scheduling problems with a learning effect matrix (Q1787789) (← links)
- Several single-machine scheduling problems with general learning effects (Q1930782) (← links)
- Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects (Q2008062) (← links)
- Improved algorithms for proportionate flow shop scheduling with due-window assignment (Q2069253) (← 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)
- Scheduling with a position-weighted learning effect and job release dates (Q5059418) (← links)
- A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect (Q5255177) (← links)