Pages that link to "Item:Q336439"
From MaRDI portal
The following pages link to Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439):
Displaying 12 items.
- Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects (Q337503) (← links)
- Minimizing makespan in an ordered flow shop with machine-dependent processing times (Q411247) (← links)
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (Q905364) (← links)
- A local search algorithm for the flow shop scheduling problem with release dates (Q1723292) (← links)
- Scheduling problems with position dependent job processing times: computational complexity results (Q1761835) (← links)
- Approximation algorithms for some position-dependent scheduling problems (Q2217459) (← links)
- Flow shop scheduling problem with position-dependent processing times (Q2273687) (← 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)
- Makespan minimization in job shops: a polynomial time approximation scheme (Q2819572) (← links)
- A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect (Q5255177) (← links)
- (Q5486497) (← links)
