The following pages link to Peter Brucker (Q177705):
Displaying 50 items.
- A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
- Dynamic programming and convex clustering (Q1314428) (← links)
- The complexity of one-machine batching problems (Q1315991) (← links)
- Scheduling unit time open shops to minimize the weighted number of late jobs (Q1318657) (← links)
- The \(k\)-track assignment problem (Q1319043) (← links)
- Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems (Q1319550) (← links)
- Series parallel composition of greedy linear programming problem (Q1321658) (← links)
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs (Q1326784) (← links)
- A branch and bound algorithm for the job-shop scheduling problem (Q1327223) (← links)
- The job-shop problem and immediate selection (Q1339120) (← links)
- A branch \(\&\) bound algorithm for the open-shop problem (Q1363739) (← links)
- On the complexity of two machine job-shop scheduling with regular objective functions (Q1374404) (← links)
- Complexity of scheduling problems with multi-purpose machines (Q1374420) (← links)
- Tabu-search for the multi-mode job-shop problem (Q1384220) (← links)
- Lower bounds for resource-constrained project scheduling problems. (Q1399575) (← links)
- Scheduling UET task systems with concurrency on two parallel identical processors (Q1401638) (← links)
- Routing of railway carriages (Q1407255) (← links)
- Flow-shop problems with intermediate buffers (Q1412168) (← links)
- How useful are preemptive schedules? (Q1413904) (← links)
- Randomized on-line scheduling on three processors. (Q1417594) (← links)
- Solving linear programs with finite precision. I: Condition numbers and random programs (Q1424293) (← links)
- A linear programming and constraint propagation-based lower bound for the RCPSP (Q1590041) (← links)
- Solving a chemical batch scheduling problem by local search (Q1593517) (← links)
- Scheduling railway traffic at a construction site (Q1597710) (← links)
- Necessary and sufficient optimality conditions for scheduling unit time jobs on identical parallel machines (Q1702729) (← links)
- The algebraic Monge property and path problems (Q1765525) (← links)
- Complexity results for flow-shop problems with a single server (Q1772843) (← links)
- A Monge property for the \(d\)-dimensional transportation problem (Q1805449) (← links)
- Resource-constrained project scheduling: Notation, classification, models, and methods (Q1806880) (← links)
- A polynomial algorithm for \(P | p_j = 1,r_j, outtree\,| \sum C_j\) (Q1812291) (← links)
- Job-shop scheduling with resource-time models of operations (Q1820680) (← links)
- Lower bounds for scheduling a single robot in a job-shop environment (Q1854757) (← links)
- Complexity results for parallel machine problems with a single server (Q1860370) (← links)
- Ten notes on equal-processing-time scheduling: at the frontiers of solvability in polynomial time (Q1885337) (← links)
- Shop scheduling problems with multiprocessor tasks on dedicated processors (Q1897372) (← links)
- Efficient algorithms for some path partitioning problems (Q1900138) (← links)
- Improving local search heuristics for some scheduling problems. I (Q1917263) (← links)
- A branch \(\&\) bound method for the general-shop problem with sequence dependent setup-times (Q1919357) (← links)
- A shift sequence based approach for nurse scheduling and a new benchmark dataset (Q1959177) (← links)
- Complexity results for single-machine problems with positive finish-start time-lags (Q1969294) (← links)
- Scheduling identical jobs with chain precedence constraints on two uniform machines (Q1974574) (← links)
- A new lower bound for the job-shop scheduling problem (Q2366077) (← links)
- Complexity of shop-scheduling problems with fixed number of jobs: a survey (Q2460037) (← links)
- Scheduling chains with identical jobs and constant delays on a single machine (Q2500785) (← links)
- Verbände stetiger Funktionen und kettenwertige Homomorphismen (Q2536066) (← links)
- Eine Charakterisierung \(K\)-kompakter topologischer Räume (Q2543297) (← links)
- Dualität zwischen Kategorien topologischer Räume und Kategorien von K-Verbänden (Q2556594) (← links)
- \({\mathfrak R}\)-Netzwerke und Matrixalgorithmen (Q2558833) (← links)
- Cyclic schedules for r irregularity occurring events (Q2639766) (← links)
- A preemptive open shop scheduling problem with one resource (Q2641218) (← links)
