The following pages link to Johann L. Hurink (Q322694):
Displaying 50 items.
- (Q210522) (redirect page) (← links)
- A survey of offline algorithms for energy minimization under deadline constraints (Q283261) (← links)
- A flexible iterative improvement heuristic to support creation of feasible shift rosters in self-rostering (Q284416) (← links)
- The lockmaster's problem (Q322695) (← links)
- Optimizing the strategic patient mix combining queueing theory and dynamic programming (Q336926) (← links)
- Erratum to ``Optimizing the strategic patient mix combining queueing theory and dynamic programing'' (Q336979) (← links)
- In memoriam Peter Brucker (Q398889) (← links)
- Matching based very large-scale neighborhoods for parallel machine scheduling (Q415566) (← links)
- Planning the production of a fleet of domestic combined heat and power generators (Q421721) (← links)
- Efficiency evaluation for pooling resources in health care (Q427499) (← links)
- Reducing the number of required beds by rearranging the OR-schedule (Q480752) (← links)
- Improved online algorithms for parallel job scheduling and strip packing (Q627112) (← links)
- Tabu search algorithms for job-shop problems with a single transport robot (Q707135) (← links)
- Time-constrained project scheduling with adjacent resources (Q709144) (← links)
- Time-constrained project scheduling (Q835591) (← links)
- Job-shop scheduling with limited capacity buffers (Q850665) (← links)
- Online scheduling of parallel jobs on two machines is 2-competitive (Q924886) (← links)
- Approximating minimum independent dominating sets in wireless networks (Q975555) (← links)
- A tabu search approach for a single-machine batching problem using an efficient method to calculate a best neighbour (Q1268835) (← links)
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
- Tabu search for the job-shop scheduling problem with multi-purpose machines (Q1317529) (← links)
- A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← links)
- Routing of railway carriages (Q1407255) (← links)
- Flow-shop problems with intermediate buffers (Q1412168) (← links)
- How useful are preemptive schedules? (Q1413904) (← links)
- Solving a chemical batch scheduling problem by local search (Q1593517) (← 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)
- An exponential neighborhood for a one-machine batching problem (Q1808727) (← links)
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\) (Q1812291) (← links)
- Modeling of capacitated transportation systems for integral scheduling (Q1880321) (← links)
- Improving local search heuristics for some scheduling problems. I (Q1917263) (← links)
- Polygon scheduling (Q1923594) (← links)
- Scheduling identical jobs with chain precedence constraints on two uniform machines (Q1974574) (← links)
- In memoriam Walter Kern (Q1983102) (← links)
- Resource allocation problems in decentralized energy management (Q2014593) (← links)
- Greedy algorithm for local heating problem (Q2019427) (← links)
- Clustering clinical departments for wards to achieve a prespecified blocking probability (Q2260901) (← links)
- Run-time spatial mapping of streaming applications to heterogeneous multi-processor systems (Q2269913) (← links)
- Quality of move-optimal schedules for minimizing total weighted completion time (Q2480059) (← links)
- A master surgical scheduling approach for cyclic scheduling in operating room departments (Q2481565) (← links)
- Cyclic schedules for r irregularity occurring events (Q2639766) (← links)
- Two very large-scale neighborhoods for single machine scheduling (Q2642308) (← links)
- A fast algorithm for quadratic resource allocation problems with nested constraints (Q2669547) (← links)
- Exponential size neighborhoods for makespan minimization scheduling (Q2892138) (← links)
- On the Interplay Between Global DVFS and Scheduling Tasks With Precedence Constraints (Q2982251) (← links)
- (Q3171245) (← links)
- Performance of a Very Large-Scale Neighborhood for Minimizing Makespan on Parallel Machines (Q3439462) (← links)
- Adjacent-Resource Scheduling (Q3439486) (← links)
- A railway scheduling problem (Q3754429) (← links)
