Zobrazeno 1 - 10
of 56
pro vyhledávání: '"Marc E. Posner"'
Publikováno v:
Journal of Scheduling. 22:413-431
This paper investigates the classical preemptive parallel-machine scheduling problem of maximizing number of on-time jobs. While the problem is known to be NP-hard, no theoretical analysis of approximation algorithms exists in the literature. As part
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::22c4a8e97a1d83bd8591b5f2fa0800e6
https://doi.org/10.1007/s10951-018-0584-y
https://doi.org/10.1007/s10951-018-0584-y
We consider a production planning problem with two planning periods. Detailed planning occurs in the first period, when complete information is known about a set of orders that are initially available. An additional set of orders becomes available at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e6f333dcee40932ac93b740efc6abf0
https://eprints.soton.ac.uk/422682/
https://eprints.soton.ac.uk/422682/
Publikováno v:
2016 13th International Conference on Service Systems and Service Management (ICSSSM).
Heuristics are used for a wide variety of purposes in numerous and diverse optimization applications. In many of these applications, there is a need to measure and evaluate heuristic performance. The purposes for measurement include choosing between
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::191b8d25d29d87341f1b0f91f6e0db93
https://doi.org/10.1109/icsssm.2016.7538418
https://doi.org/10.1109/icsssm.2016.7538418
Publikováno v:
Journal of Industrial Ecology. 15:315-332
Summary By-product synergy (BPS) is an industrial ecology practice that involves utilization of industrial by-products as feedstocks for other industrial processes. A novel decision support tool is developed to analyze BPS networks that involve mater
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::725dc06b2876531dcc2be222b117d6d0
https://doi.org/10.1111/j.1530-9290.2010.00310.x
https://doi.org/10.1111/j.1530-9290.2010.00310.x
Publikováno v:
IEEE Transactions on Mobile Computing. 9:1161-1172
To make a network last beyond the lifetime of an individual sensor node, redundant nodes must be deployed. What sleep-wake-up schedule can then be used for individual nodes so that the redundancy is appropriately exploited to maximize the network lif
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae1ade1b3c27099a47801223e5b4fa83
https://doi.org/10.1109/tmc.2010.78
https://doi.org/10.1109/tmc.2010.78
Autor:
Marc E. Posner, Eun-Seok Kim
Publikováno v:
IIE Transactions. 42:525-537
For s-precedence constraints, job i cannot start processing until all jobs that precede i start. This is different from the standard definition of a precedence relation where i cannot start until all prior jobs complete. While not discussed in the sc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::98f06ad67e6e7a3b311de9be8f4e6a5d
https://doi.org/10.1080/07408171003670975
https://doi.org/10.1080/07408171003670975
Autor:
Marc E. Posner, Jaehwan Yang
Publikováno v:
Journal of Scheduling. 13:3-16
A new deterministic flow shop problem is studied where the objective is to minimize the total WIP (work-in-process) cost. Based on a value added model, the unit time WIP cost increases as a job passes through various stages in the production process.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b7a6b6d95cbd559d27a4396de822277a
https://doi.org/10.1007/s10951-009-0130-z
https://doi.org/10.1007/s10951-009-0130-z
Autor:
Marc E. Posner, Wenhui Zhao
Publikováno v:
Mathematical Programming. 128:171-203
The polyhedral structure of the K-median problem is examined. We present an extended formulation that is integral but grows exponentially with the number of nodes. Then, some extra variables are projected out. Based on the reduced formulation, we dev
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::84db935b556b6ea5f32794d0d021f450
https://doi.org/10.1007/s10107-009-0301-x
https://doi.org/10.1007/s10107-009-0301-x
Publikováno v:
Mathematics of Operations Research. 34:92-102
We consider an online scheduling environment where decisions are made without knowledge of the data of jobs that may arrive later. However, additional jobs can only arrive at known future times. This environment interpolates between the classical off
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::eee7bbc6f7915f187cc4dd06383a67bf
https://doi.org/10.1287/moor.1080.0346
https://doi.org/10.1287/moor.1080.0346
Autor:
Nicholas G. Hall, Marc E. Posner
Publikováno v:
Operations Research. 55:703-716
The operations research literature contains numerous studies on the design and application of optimization and heuristic solution procedures. These studies identify a particular optimization problem, suggest a general solution procedure, and then cus
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::27791650616486564d279857356e6da3
https://doi.org/10.1287/opre.1070.0398
https://doi.org/10.1287/opre.1070.0398