The decomposition of nonlinear problems. - Marc E. Posner (Math. Program., 1978)

The Collapsing 0-1 Knapsack Problem. - Marc E. Posner; Monique Guignard 001 (Math. Program., 1978)

Linear max-min programming. - Marc E. Posner; Chu-Tao Wu (Math. Program., 1981)

The continuous collapsing Knapsack problem. - Marc E. Posner (Math. Program., 1983)

Minimizing Weighted Completion Times with Deadlines. - Marc E. Posner (Oper. Res., 1985)

The Caterer Problem. - Wlodzimierz Szwarc; Marc E. Posner (Oper. Res., 1985)

A dual approach for the continuous collapsing knapsack problem. - Marc E. Posner; Hisatoshi Suzuki (Math. Program., 1987)

The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic. - Marc E. Posner (Oper. Res., 1988)

Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date. - Nicholas G. Hall; Marc E. Posner (Oper. Res., 1991)

Scheduling with release dates on a single machine to minimize total weighted completion time. - Hocine Belouadah; Marc E. Posner; Chris N. Potts (Discret. Appl. Math., 1992)

An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity. - Lu Lu; Marc E. Posner (Math. Oper. Res., 1993)

Preemptive scheduling with finite capacity input buffers. - Nicholas G. Hall; Marc E. Posner; Chris N. Potts (Ann. Oper. Res., 1997)

Performance Measures and Schedules in Periodic Job Shops. - Tae-Eog Lee; Marc E. Posner (Oper. Res., 1997)

Scheduling with Finite Capacity Output Buffers. - Nicholas G. Hall; Marc E. Posner; Chris N. Potts (Oper. Res., 1998)

Scheduling with Finite Capacity Input Buffers. - Nicholas G. Hall; Marc E. Posner; Chris N. Potts (Oper. Res., 1998)

High Multiplicity in Earliness-Tardiness Scheduling. - John J. Clifford; Marc E. Posner (Oper. Res., 2000)

Generating Experimental Data for Computational Testing with Machine Scheduling Applications. - Nicholas G. Hall; Marc E. Posner (Oper. Res., 2001)

Parallel machine scheduling with high multiplicity. - John J. Clifford; Marc E. Posner (Math. Program., 2001)

Sensitivity Analysis for Scheduling Problems. - Nicholas G. Hall; Marc E. Posner (J. Sched., 2004)

Scheduling Parallel Machines for the Customer Order Problem. - Jaehwan Yang; Marc E. Posner (J. Sched., 2005)

Optimal sleep-wakeup algorithms for barriers of wireless sensors. - Santosh Kumar 001; Ten-Hwang Lai; Marc E. Posner; Prasun Sinha (BROADNETS, 2007)

Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures. - Nicholas G. Hall; Marc E. Posner (Oper. Res., 2007)

Polyhedral Properties of the K -median Problem on a Tree. - Sven de Vries; Marc E. Posner; Rakesh V. Vohra (Math. Program., 2007)

Allocation of jobs and identical resources with two pooling centers. - Hui-Chih Hung; Marc E. Posner (Queueing Syst. Theory Appl., 2007)

Online Scheduling with Known Arrival Times. - Nicholas G. Hall; Marc E. Posner; Chris N. Potts (Math. Oper. Res., 2009)

The Generation of Experimental Data for Computational Testing in Optimization. - Nicholas G. Hall; Marc E. Posner (Experimental Methods for the Analysis of Optimization Algorithms, 2010)

Flow shops with WIP and value added costs. - Jaehwan Yang; Marc E. Posner (J. Sched., 2010)

Maximizing the Lifetime of a Barrier of Wireless Sensors. - Santosh Kumar 001; Ten-Hwang Lai; Marc E. Posner; Prasun Sinha (IEEE Trans. Mob. Comput., 2010)

A large class of facets for the K-median polytope. - Wenhui Zhao; Marc E. Posner (Math. Program., 2011)

Erratum to: Flow shops with WIP and value added costs. - Jaehwan Yang; Marc E. Posner (J. Sched., 2015)

Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. - Hui-Chih Hung; Bertrand M. T. Lin; Marc E. Posner; Jun-Min Wei (J. Sched., 2019)

Online production planning to maximize the number of on-time orders. - Nicholas G. Hall; Marc E. Posner; Chris N. Potts (Ann. Oper. Res., 2021)