The following pages link to Tatsushi Nishi (Q614064):
Displaying 11 items.
- A bilevel decomposition algorithm for simultaneous production scheduling and conflict-free routing for automated guided vehicles (Q614066) (← links)
- Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time (Q723919) (← links)
- Lagrangian relaxation with cut generation for hybrid flowshop scheduling problems to minimize the total weighted tardiness (Q733544) (← links)
- A combined column generation and heuristics for railway short-term rolling stock planning with regular inspection constraints (Q1652213) (← links)
- A dynamic programming-based matheuristic for the dynamic berth allocation problem (Q2178356) (← links)
- Petri net representation and reachability analysis of 0--1 integer linear programming problems (Q2293169) (← links)
- A heuristic approach for dividing graphs into bi-connected components with a size constraint (Q2403269) (← links)
- Two-level decomposition algorithm for crew rostering problems with fair working condition (Q2514878) (← links)
- Decomposition of Petri nets and Lagrangian relaxation for solving routing problems for AGVs (Q3055383) (← links)
- Decomposition of timed automata for solving scheduling problems (Q5172578) (← links)
- A solution procedure for mixed-integer nonlinear programming formulation of supply chain planning with quantity discounts under demand uncertainty (Q5499840) (← links)
