The following pages link to Marc E. Posner (Q173864):
Displaying 42 items.
- A large class of facets for the \(K\)-median polytope (Q543406) (← links)
- The tridiagonal transportation problem (Q788634) (← links)
- Online production planning to maximize the number of on-time orders (Q829183) (← links)
- Polyhedral properties of the \(K\)-median problem on a tree (Q879965) (← links)
- Scheduling parallel machines for the customer order problem (Q880492) (← links)
- Allocation of jobs and identical resources with two pooling centers (Q885548) (← links)
- Reducibility among single machine weighted completion time scheduling problems (Q922287) (← links)
- Flow shops with WIP and value added costs (Q969753) (← links)
- On optimal decision rules for signs of parameters (Q1089708) (← links)
- (Q1193719) (redirect page) (← links)
- Scheduling with release dates on a single machine to minimize total weighted completion time (Q1193720) (← links)
- A note on a programming problem with maximin objective function (Q1255440) (← links)
- Preemptive scheduling with finite capacity input buffers (Q1374452) (← links)
- The complexity of cyclic shop scheduling problems (Q1607980) (← links)
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs (Q2304114) (← links)
- Erratum to: ``Flow shops with WIP and value added costs'' (Q2356128) (← links)
- Scheduling with Finite Capacity Output Buffers (Q2770137) (← links)
- Scheduling with Finite Capacity Input Buffers (Q2781130) (← links)
- The Generation of Experimental Data for Computational Testing in Optimization (Q3064516) (← links)
- Online Scheduling with Known Arrival Times (Q3169021) (← links)
- Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures (Q3392107) (← links)
- Generating Experimental Data for Computational Testing with Machine Scheduling Applications (Q3635039) (← links)
- A Transportation Type Aggregate Production Model with Backordering (Q3659506) (← links)
- The continuous collapsing Knapsack problem (Q3659529) (← links)
- Minimizing Weighted Completion Times with Deadlines (Q3694968) (← links)
- The Caterer Problem (Q3694982) (← links)
- Transshipment along a single road (Q3701195) (← links)
- A Sequencing Problem with Release Dates and Clustered Jobs (Q3731355) (← links)
- A dual approach for the continuous collapsing knapsack problem (Q3778543) (← links)
- The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic (Q3812023) (← links)
- The Single Machine Problem with a Quadratic Cost Function of Completion Times (Q3815117) (← links)
- Linear max-min programming (Q3905079) (← links)
- Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date (Q3988910) (← links)
- The Collapsing 0–1 Knapsack Problem (Q4175049) (← links)
- The decomposition of nonlinear problems (Q4187598) (← links)
- Performance Measures and Schedules in Periodic Job Shops (Q4367266) (← links)
- High Multiplicity in Earliness-Tardiness Scheduling (Q4530664) (← links)
- An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity (Q4697081) (← links)
- Approximation Procedures for the One-Warehouse Multi-Retailer System (Q4834333) (← links)
- Sensitivity analysis for scheduling problems (Q5892098) (← links)
- Sensitivity analysis for scheduling problems (Q5920390) (← links)
- Parallel machine scheduling with high multiplicity (Q5930732) (← links)
