default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarc E. Posner
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j30]Nicholas G. Hall
, Marc E. Posner, Chris N. Potts:
Online production planning to maximize the number of on-time orders. Ann. Oper. Res. 298(1): 249-269 (2021)- 2019
- [j29]Hui-Chih Hung, Bertrand M. T. Lin, Marc E. Posner, Jun-Min Wei:
Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs. J. Sched. 22(4): 413-431 (2019) - 2015
- [j28]Jaehwan Yang, Marc E. Posner:
Erratum to: Flow shops with WIP and value added costs. J. Sched. 18(3): 331 (2015) - 2011
- [j27]Wenhui Zhao, Marc E. Posner:
A large class of facets for the K-median polytope. Math. Program. 128(1-2): 171-203 (2011) - 2010
- [j26]Jaehwan Yang, Marc E. Posner:
Flow shops with WIP and value added costs. J. Sched. 13(1): 3-16 (2010) - [j25]Santosh Kumar, Ten-Hwang Lai, Marc E. Posner, Prasun Sinha:
Maximizing the Lifetime of a Barrier of Wireless Sensors. IEEE Trans. Mob. Comput. 9(8): 1161-1172 (2010) - 2009
- [j24]Nicholas G. Hall, Marc E. Posner, Chris N. Potts:
Online Scheduling with Known Arrival Times. Math. Oper. Res. 34(1): 92-102 (2009) - 2007
- [j23]Nicholas G. Hall, Marc E. Posner:
Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures. Oper. Res. 55(4): 703-716 (2007) - [j22]Sven de Vries, Marc E. Posner, Rakesh V. Vohra:
Polyhedral Properties of the K -median Problem on a Tree. Math. Program. 110(2): 261-285 (2007) - [j21]Hui-Chih Hung, Marc E. Posner:
Allocation of jobs and identical resources with two pooling centers. Queueing Syst. Theory Appl. 55(3): 179-194 (2007) - 2005
- [j20]Jaehwan Yang, Marc E. Posner:
Scheduling Parallel Machines for the Customer Order Problem. J. Sched. 8(1): 49-74 (2005) - 2004
- [j19]Nicholas G. Hall, Marc E. Posner:
Sensitivity Analysis for Scheduling Problems. J. Sched. 7(1): 49-83 (2004) - 2001
- [j18]Nicholas G. Hall, Marc E. Posner:
Generating Experimental Data for Computational Testing with Machine Scheduling Applications. Oper. Res. 49(6): 854-865 (2001) - [j17]John J. Clifford, Marc E. Posner:
Parallel machine scheduling with high multiplicity. Math. Program. 89(3): 359-383 (2001) - 2000
- [j16]John J. Clifford, Marc E. Posner:
High Multiplicity in Earliness-Tardiness Scheduling. Oper. Res. 48(5): 788-800 (2000) - 1998
- [j15]Nicholas G. Hall, Marc E. Posner, Chris N. Potts:
Scheduling with Finite Capacity Input Buffers. Oper. Res. 46(3-Supplement-3): S154-S159 (1998) - [j14]Nicholas G. Hall, Marc E. Posner, Chris N. Potts:
Scheduling with Finite Capacity Output Buffers. Oper. Res. 46(3-Supplement-3): S84-S97 (1998) - 1997
- [j13]Nicholas G. Hall, Marc E. Posner, Chris N. Potts:
Preemptive scheduling with finite capacity input buffers. Ann. Oper. Res. 70: 399-413 (1997) - [j12]Tae-Eog Lee, Marc E. Posner:
Performance Measures and Schedules in Periodic Job Shops. Oper. Res. 45(1): 72-91 (1997) - 1993
- [j11]Lu Lu, Marc E. Posner:
An NP-Hard Open Shop Scheduling Problem with Polynomial Average Time Complexity. Math. Oper. Res. 18(1): 12-38 (1993) - 1992
- [j10]Hocine Belouadah, Marc E. Posner, Chris N. Potts:
Scheduling with release dates on a single machine to minimize total weighted completion time. Discret. Appl. Math. 36(3): 213-231 (1992) - 1991
- [j9]Nicholas G. Hall, Marc E. Posner:
Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date. Oper. Res. 39(5): 836-846 (1991) - 1988
- [j8]Marc E. Posner:
The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic. Oper. Res. 36(5): 742-746 (1988) - 1987
- [j7]Marc E. Posner, Hisatoshi Suzuki:
A dual approach for the continuous collapsing knapsack problem. Math. Program. 39(2): 207-214 (1987) - 1985
- [j6]Marc E. Posner:
Minimizing Weighted Completion Times with Deadlines. Oper. Res. 33(3): 562-574 (1985) - [j5]Wlodzimierz Szwarc, Marc E. Posner:
The Caterer Problem. Oper. Res. 33(6): 1215-1224 (1985) - 1983
- [j4]Marc E. Posner:
The continuous collapsing Knapsack problem. Math. Program. 26(1): 76-86 (1983) - 1981
- [j3]Marc E. Posner, Chu-Tao Wu:
Linear max-min programming. Math. Program. 20(1): 166-172 (1981) - 1978
- [j2]Marc E. Posner, Monique Guignard:
The Collapsing 0-1 Knapsack Problem. Math. Program. 15(1): 155-161 (1978) - [j1]Marc E. Posner:
The decomposition of nonlinear problems. Math. Program. 15(1): 360-362 (1978)
Conference and Workshop Papers
- 2007
- [c1]Santosh Kumar, Ten-Hwang Lai, Marc E. Posner, Prasun Sinha:
Optimal sleep-wakeup algorithms for barriers of wireless sensors. BROADNETS 2007: 327-336
Parts in Books or Collections
- 2010
- [p1]Nicholas G. Hall, Marc E. Posner:
The Generation of Experimental Data for Computational Testing in Optimization. Experimental Methods for the Analysis of Optimization Algorithms 2010: 73-101
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
