The following pages link to George Steiner (Q187128):
Displaying 50 items.
- An approximation algorithm for clustering graphs with dominating diametral path (Q290198) (← links)
- Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
- Single machine batch scheduling with release times and delivery costs (Q398839) (← links)
- Single-machine scheduling with periodic maintenance to minimize makespan revisited (Q398924) (← links)
- Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine (Q474786) (← links)
- `Strong'-`weak' precedence in scheduling: extensions to series-parallel orders (Q602755) (← links)
- On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (Q623315) (← links)
- Finding the largest suborder of fixed width (Q687176) (← links)
- A note on ``Scheduling unit-time tasks with integer release times and deadlines'' (Q689642) (← links)
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
- The bipartite margin shop and maximum red matchings free of blue-red alternating cycles (Q834189) (← links)
- Single machine batch scheduling to minimize total completion time and resource consumption costs (Q835561) (← links)
- Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
- Two due date assignment problems in scheduling a single machine (Q867932) (← links)
- Scheduling in reentrant robotic cells: algorithms and complexity (Q880491) (← links)
- On the connection between a cyclic job shop and a reentrant flow shop scheduling problem (Q880555) (← links)
- Partially ordered knapsack and applications to scheduling (Q881568) (← links)
- On the complexity of dynamic programming for sequencing problems with precedence constraints (Q922284) (← links)
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
- An algorithm for minimizing setups in precedence constrained scheduling (Q1069848) (← links)
- A compact labelling scheme for series-parallel graphs (Q1079115) (← links)
- An algorithm to generate the ideals of a partial order (Q1086160) (← links)
- A linear time algorithm to find the jump number of 2-dimensional bipartite partial orders (Q1090688) (← links)
- On finding the jump number of a partial order by substitution decomposition (Q1092072) (← links)
- Computing the bump number is easy (Q1106863) (← links)
- Minimizing bumps in ordered sets by substitution decomposition (Q1122595) (← links)
- Sequencing jobs on a single machine with a common due data and stochastic processing times (Q1179194) (← links)
- Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm (Q1198484) (← links)
- Hamiltonian cycle is polynomial on cocomparability graphs (Q1201106) (← links)
- On estimating the number of order ideals in partial orders, with some applications (Q1209661) (← links)
- Optimal level schedules in mixed-model, multi-level JIT assembly systems with pegging (Q1278361) (← links)
- Lot streaming with detached setups in three-machine flow shops (Q1278538) (← links)
- Fast algorithms to minimize the makespan or maximum lateness in the two-machine flow shop with release times. (Q1347602) (← links)
- Optimal level schedules for mixed-model, multi-level just-in-time assembly systems (Q1357784) (← links)
- 1-tough cocomparability graphs are hamiltonian (Q1363656) (← links)
- Approximation methods for discrete lot streaming in flow shops (Q1375120) (← links)
- On the \(k\)-path partition of graphs. (Q1401225) (← links)
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
- The maximum traveling salesman problem on van der Veen matrices (Q1765370) (← links)
- (Q1921259) (redirect page) (← links)
- A linear time algorithm for maximum matchings in convex, bipartite graphs (Q1921260) (← links)
- Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs (Q2018942) (← links)
- New results for scheduling to minimize tardiness on one machine with rejection and related problems (Q2061129) (← links)
- Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine (Q2253532) (← links)
- A pseudo-polynomial time algorithm for solving the resource dependent assignment problem (Q2255050) (← links)
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains (Q2268520) (← links)
- Approximation algorithms for minimizing the total weighted tardiness on a single machine (Q2368997) (← links)
