Pages that link to "Item:Q1260741"
From MaRDI portal
The following pages link to A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops (Q1260741):
Displayed 9 items.
- Minimizing total tardiness in permutation flowshops (Q1127155) (← links)
- A guaranteed accuracy shifting bottleneck algorithm for the two-machine flowshop total tardiness problem (Q1265840) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications (Q1348546) (← links)
- Minimizing the sum of absolute deviations about a common due date for the two-machine flow shop problem (Q1893607) (← links)
- Note on minimizing total tardiness in a two-machine flowshop (Q2387308) (← links)
- A PSO and a tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application (Q2571194) (← links)
- A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness (Q4666773) (← links)
- Minimizing tardiness in a two-machine flow-shop (Q5959377) (← links)