The following pages link to Peter Brucker (Q177705):
Displaying 50 items.
- Polynomially solvable personnel rostering problems (Q320874) (← links)
- A branch and bound algorithm for the cyclic job-shop problem with transportation (Q339670) (← links)
- A note on ``Event-based MILP models for resource-constrained project scheduling problems'' (Q340321) (← links)
- A mixed integer programming model for the cyclic job-shop problem with transportation (Q442206) (← links)
- Network flow models for intraday personnel scheduling problems (Q475176) (← links)
- Personnel scheduling: models and complexity (Q541689) (← links)
- Complexity results for flow-shop and open-shop scheduling problems with transportation delays (Q596453) (← links)
- Inverse scheduling: Two-machine flow-shop problem (Q640308) (← links)
- A polynomial-time algorithm for a flow-shop batching problem with equal-length operations (Q657253) (← links)
- Improving known solutions is hard (Q687508) (← links)
- Scheduling and constraint propagation (Q697570) (← links)
- (Q756929) (redirect page) (← links)
- An O(n log n)-algorithm for solving a special class of linear programs (Q756930) (← links)
- (Q795713) (redirect page) (← links)
- A branch-and-bound algorithm for the multi-level uncapacitated facility location problem (Q795714) (← links)
- An O(n) algorithm for quadratic knapsack problems (Q797501) (← links)
- Scheduling jobs with equal processing times and time windows on identical parallel machines (Q835604) (← links)
- Job-shop scheduling with limited capacity buffers (Q850665) (← links)
- Scheduling equal processing time jobs to minimize the weighted number of late jobs (Q853793) (← links)
- Tabu search algorithms for cyclic machine scheduling problems (Q880506) (← links)
- The complexity of mean flow time scheduling problems with release times (Q880590) (← links)
- A projection method for the uncapacitated facility location problem (Q918404) (← links)
- An efficient implementation of local search algorithms for constrained routing problems (Q918421) (← links)
- Cyclic job shop scheduling problems with blocking (Q940885) (← links)
- A general model for cyclic machine scheduling problems (Q955322) (← links)
- Inverse scheduling with maximum lateness objective (Q1041341) (← links)
- An out-of-kilter method for the algebraic circulation problem (Q1057166) (← links)
- Minimum cost flow algorithms for series-parallel networks (Q1061597) (← links)
- A note on finding minimum cuts in directed planar networks by parallel computations (Q1069429) (← links)
- Greedy concepts for network flow problems (Q1088884) (← links)
- On the worst-case ratio of a compound multiprocessor scheduling algorithm (Q1097028) (← links)
- Approximation of a set of points by points of a grid (Q1100840) (← links)
- Scheduling two irregular polygons (Q1104847) (← links)
- An efficient algorithm for the job-shop problem with two jobs (Q1108919) (← links)
- k-optimal solution sets for some polynomially solvable scheduling problems (Q1121169) (← links)
- Recognition problems for special classes of polynomials in 0-1 variables (Q1121786) (← links)
- Submodularity and the traveling salesman problem (Q1124707) (← links)
- Minimizing maximum lateness in a two-machine unit-time job shop (Q1151033) (← links)
- Job-shop scheduling with multi-purpose machines (Q1174353) (← links)
- An extension of a greedy heuristic for the knapsack problem (Q1178644) (← links)
- Programming in networks and graphs. On the combinatorial background and near-equivalence of network flow and matching algorithms (Q1210806) (← links)
- Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems (Q1266535) (← links)
- Scheduling a batching machine (Q1268850) (← links)
- Batch scheduling with deadlines on parallel machines (Q1273116) (← links)
- A branch and bound algorithm for a single-machine scheduling problem with positive and negative time-lags (Q1293191) (← links)
- A branch and bound algorithm for the resource-constrained project scheduling problem (Q1296084) (← links)
- Linear optimization and extensions. (Q1296340) (← links)
- A new tabu search procedure for an audit-scheduling problem (Q1297694) (← links)
- Preemptive job-shop scheduling problems with a fixed number of jobs (Q1299919) (← links)
- A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
