Pages that link to "Item:Q2029256"
From MaRDI portal
The following pages link to A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems (Q2029256):
Displaying 11 items.
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem (Q1767678) (← links)
- Diversity of processing times in permutation flow shop scheduling problems (Q2050279) (← links)
- On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine (Q2158014) (← links)
- (Q3358512) (← links)
- On the combinatorial structure of the permutation flow shop problem (Q3978451) (← links)
- A note on scheduling jobs with missing operations in permutation flow shops (Q4245674) (← links)
- (Q5287167) (← links)
- A variable neighborhood search algorithm for a PET/CT examination scheduling problem considering multi-stage process and deteriorating effect (Q6043106) (← links)
- Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users (Q6098953) (← links)
- An upper bound for the inter-exit time of two jobs in an \(m\)-machine flow shop (Q6588488) (← links)
