The following pages link to Rainer Leisten (Q337355):
Displaying 26 items.
- Variability of completion time differences in permutation flow shop scheduling (Q337356) (← links)
- From competitive to collaborative supply networks: a simulation study (Q534864) (← links)
- A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria (Q991843) (← links)
- An LP-aggregation view on aggregation in multi-level production planning (Q1270620) (← links)
- Convergence aspects of adaptive clustering in variable aggregation (Q1304489) (← links)
- Aggregation and decomposition for multi-divisional linear programs (Q1319577) (← links)
- A posteriori error bounds in linear programming aggregation (Q1361389) (← links)
- Decomposition and iterative aggregation in hierarchical and decentralised planning structures (Q1390198) (← links)
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation (Q1847225) (← links)
- Operations research. An introduction (Q1870411) (← links)
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective (Q2379653) (← links)
- Comparison of heuristics for flowtime minimisation in permutation flowshops (Q2485174) (← links)
- Heuristic rules for tie-breaking in the implementation of the NEH heuristic for permutation flow-shop scheduling (Q2627803) (← links)
- Flowshop sequencing problems with limited buffer storage (Q3489782) (← links)
- Total tardiness minimization in permutation flow shops: a simple approach based on a variable greedy algorithm (Q3605449) (← links)
- (Q4220571) (← links)
- A note on scheduling jobs with missing operations in permutation flow shops (Q4245674) (← links)
- Column aggregation and primal decomposition in linear programming: some observations (Q4327909) (← links)
- (Q4522580) (← links)
- Sequencing CONWIP flow-shops: Analysis and heuristics (Q4674420) (← links)
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective (Q4678194) (← links)
- Input control and dispatching rules in a dynamic CONWIP flow-shop (Q4706244) (← links)
- Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem (Q4706278) (← links)
- Gradient schemes in iterative aggregation procedures for variable-aggregated lp-problems (Q4764871) (← links)
- (Q4896281) (← links)
- Manufacturing Scheduling Systems (Q5402231) (← links)
