The following pages link to Sigrid Knust (Q210525):
Displaying 50 items.
- A flow-based tabu search algorithm for the RCPSP with transfer times (Q280159) (← links)
- Loading, unloading and premarshalling of stacks in storage areas: survey and classification (Q297241) (← links)
- Complexity results for storage loading problems with stacking constraints (Q321101) (← links)
- Robust storage loading problems with stacking and payload constraints (Q323109) (← links)
- Modeling and optimizing the evacuation of hospitals based on the MRCPSP with resource transfers (Q339938) (← links)
- Tabu search and lower bounds for a combined production-transportation problem (Q340247) (← links)
- A note on ``Event-based MILP models for resource-constrained project scheduling problems'' (Q340321) (← links)
- Solution algorithms for synchronous flow shop problems with two dominating machines (Q342451) (← links)
- In memoriam Peter Brucker (Q398889) (← links)
- Optimized load planning of trains in intermodal transportation (Q443814) (← links)
- Robust load planning of trains in intermodal transportation (Q480756) (← links)
- The bottleneck transportation problem with auxiliary resources (Q496104) (← links)
- Single machine scheduling problems with financial resource constraints: some complexity results and properties (Q554491) (← links)
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays (Q596453) (← links)
- Makespan minimization of multi-slot just-in-time scheduling on single and parallel machines (Q600836) (← links)
- Parallel batch scheduling of equal-length jobs with release and due dates (Q600846) (← links)
- A graph-based analysis of the cyclic scheduling problem with time constraints: schedulability and periodicity of the earliest schedule (Q633540) (← links)
- Shortest path to nonpreemptive schedules of unit-time jobs on two identical parallel machines with minimum total completion time (Q706379) (← links)
- Tabu search algorithms for job-shop problems with a single transport robot (Q707135) (← links)
- Synchronous flow shop scheduling with pliable jobs (Q723997) (← links)
- Complexity results for flow shop problems with synchronous movement (Q726218) (← links)
- Scheduling in sports: an annotated bibliography (Q733513) (← links)
- Integrated production and distribution scheduling with lifespan constraints (Q744659) (← links)
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246) (← links)
- Computing redundant resources for the resource constrained project scheduling problem (Q853022) (← links)
- Balanced home-away assignments (Q865752) (← links)
- Constructing fair sports league schedules with regard to strength groups (Q968118) (← links)
- Scheduling sports tournaments on a single court minimizing waiting times (Q1003498) (← links)
- Minimizing costs in round robin tournaments with place constraints (Q1025238) (← links)
- Scheduling partial round robin tournaments subject to home away pattern sets (Q1028835) (← links)
- Measuring time. Improving project performance using earned value management (Q1034329) (← links)
- An optimal online algorithm for single machine scheduling with bounded delivery times (Q1038322) (← links)
- Scheduling non-professional table-tennis leagues (Q1042487) (← links)
- Generating asymptotically optimal broadcasting schedules to minimize average waiting time (Q1045062) (← links)
- A branch and bound algorithm for the resource-constrained project scheduling problem (Q1296084) (← links)
- Insertion techniques for static and dynamic resource-constrained project scheduling. (Q1399570) (← links)
- A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version. (Q1399573) (← links)
- Lower bounds for resource-constrained project scheduling problems. (Q1399575) (← links)
- On linear lower bounds for the resource constrained project scheduling problem. (Q1399576) (← links)
- Order-based neighborhoods for project scheduling with nonregular objective functions. (Q1399577) (← links)
- Scheduling UET task systems with concurrency on two parallel identical processors (Q1401638) (← links)
- An approximation algorithm for scheduling two parallel machines with capacity constraints. (Q1408454) (← links)
- Project scheduling. A research handbook. (Q1422056) (← links)
- A linear programming and constraint propagation-based lower bound for the RCPSP (Q1590041) (← links)
- Scheduling railway traffic at a construction site (Q1597710) (← links)
- A tabu search algorithm for scheduling a single robot in a job-shop environment (Q1602712) (← links)
- List scheduling in a parallel machine environment with precedence constraints and setup times (Q1604056) (← links)
- Flow shop scheduling with flexible processing times (Q1621840) (← links)
- MIP-based approaches for robust storage loading problems with stacking constraints (Q1652064) (← links)
- Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation (Q1731818) (← links)
