The following pages link to George Steiner (Q187128):
Displaying 34 items.
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
- Pareto optima for total weighted completion time and maximum lateness on a single machine (Q2457015) (← links)
- Approximation algorithms for scheduling problems with a modified total weighted tardiness objective (Q2465959) (← links)
- Batch scheduling in a two-level supply chain -- a focus on the supplier (Q2491787) (← links)
- Robotic-cell scheduling: special polynomially solvable cases of the traveling salesman problem on permuted Monge matrices (Q2576775) (← links)
- Subset-restricted interchange for dynamic min-max scheduling problems (Q2706175) (← links)
- On the \(k\)-path partition problem in cographs (Q2716628) (← links)
- Revised delivery-time quotation in scheduling with tardiness penalties (Q2893923) (← links)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
- Single Machine Scheduling with Precedence Constraints of Dimension 2 (Q3329201) (← links)
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms (Q3750504) (← links)
- Searching in 2-dimensional partial orders (Q3783596) (← links)
- Single Machine Scheduling with Series-Parallel Precedence Constraints (Q3929382) (← links)
- Polynomial algorithms to count linear extensions in certain posets (Q3972873) (← links)
- Primal dual algorithms for the vehicle refueling problem (Q4022738) (← links)
- Level Schedules for Mixed-Model, Just-in-Time Processes (Q4274633) (← links)
- Polynomial Algorithms for Hamiltonian Cycle in Cocomparability Graphs (Q4302282) (← links)
- Gray Codes for the Ideals of Interval Orders (Q4366874) (← links)
- (Q4411395) (← links)
- (Q4452938) (← links)
- The recognition of indifference digraphs and generalized semiorders (Q4865532) (← links)
- (Q4940081) (← links)
- Approximation Algorithms for the Supplier's Supply Chain Scheduling Problem to Minimize Delivery and Inventory Holding Costs (Q5189007) (← links)
- Permutation Schedules for Flow Shops with Precedence Constraints (Q5202022) (← links)
- (Q5284063) (← links)
- STACS 2004 (Q5309698) (← links)
- (Q5310215) (← links)
- BATCH SCHEDULING IN CUSTOMER-CENTRIC SUPPLY CHAINS(<Special Issue>Advanced Planning and Scheduling for Supply Chain Management) (Q5423039) (← links)
- Partitioning a graph into vertex-disjoint paths (Q5478021) (← links)
- Discrete Lot Streaming In Two-Machine Flow Shops (Q5888096) (← links)
- Efficient algorithms on distributive lattices (Q5936459) (← links)
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715) (← links)
- Minimizing the number of tardy jobs with precedence constraints and agreeable due dates (Q5961612) (← links)
