Pages that link to "Item:Q5895000"
From MaRDI portal
The following pages link to Tight Bounds for Permutation Flow Shop Scheduling (Q5895000):
Displaying 24 items.
- Flowshop scheduling with a general exponential learning effect (Q336933) (← links)
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
- A note on permutation flow shop problem (Q596465) (← links)
- A linear time approximation algorithm for permutation flow shop scheduling (Q764320) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- Permutation vs. non-permutation flow shop schedules (Q1180831) (← links)
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times (Q1310020) (← links)
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems (Q2029256) (← links)
- Diversity of processing times in permutation flow shop scheduling problems (Q2050279) (← links)
- An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
- Flow shop scheduling with heterogeneous workers (Q2254003) (← links)
- On-line scheduling with monotone subsequence constraints (Q2319898) (← links)
- Polynomial time algorithms for the UET permutation flowshop problem with time delays (Q2384903) (← links)
- Reoptimization in machine scheduling (Q2453159) (← links)
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
- Permutation flow shops with exact time lags to minimise maximum lateness (Q3055251) (← links)
- Permutation flow shop scheduling with earliness and tardiness penalties (Q3055278) (← links)
- On the combinatorial structure of the permutation flow shop problem (Q3978451) (← links)
- Online Scheduling with Increasing Subsequence Serving Constraint (Q4632179) (← links)
- On-line Scheduling with a Monotonous Subsequence Constraint (Q4632214) (← links)
- (Q5287167) (← links)
- Maximizing Throughput in Flow Shop Real-Time Scheduling (Q6084409) (← links)
- Moderate worst-case complexity bounds for the permutation flowshop scheduling problem using inclusion-exclusion (Q6103746) (← links)
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)