Pages that link to "Item:Q1121163"
From MaRDI portal
The following pages link to A new integer programming formulation for the permutation flowshop problem (Q1121163):
Displaying 10 items.
- New effective MILP models for PFSPs arising from real applications (Q301126) (← links)
- Minimizing total tardiness in permutation flowshops (Q1127155) (← links)
- Multiple and bicriteria scheduling: A literature survey (Q1130028) (← links)
- A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (Q1260741) (← links)
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem (Q2367002) (← links)
- A study of integer programming formulations for scheduling problems (Q3124684) (← links)
- New MILP models for the permutation flowshop problem (Q3612203) (← links)
- (Q3818111) (← links)
- On the combinatorial structure of the permutation flow shop problem (Q3978451) (← links)
- New block properties for the permutation flow shop problem with application in tabu search (Q4658399) (← links)