Search Results - subject:"Approximation scheme"

Scheduling with non-renewable resources: minimizing the sum of completion times

Bérczi, Kristóf; Király, Tamás; Omlor, Simon - In: Journal of Scheduling 27 (2024) 2, pp. 151-164

We consider single-machine scheduling with a non-renewable resource. In this setting, we are given a set of jobs, each characterized by a processing time, a weight, and a resource requirement. At fixed points in time, certain amounts of the resource are made available to be consumed by the jobs....

Persistent link: https://www.econbiz.de/10015371266

Scheduling with non-renewable resources : minimizing the sum of completion times

Bérczi, Kristóf; Király, Tamás; Omlor, Simon - In: Journal of scheduling : JOS 27 (2024) 2, pp. 151-164

Persistent link: https://www.econbiz.de/10015049206

Assortment optimization under the multinomial logit choice model with product-specific capacities

Huh, Woonghee Tim; Liu, Siyue - In: Operations research letters : a journal of INFORMS … 59 (2025), pp. 1-7

Persistent link: https://www.econbiz.de/10015358859

Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing

Li, Weidong; Ou, Jinwen - In: European journal of operational research : EJOR 314 (2024) 3, pp. 882-893

Persistent link: https://www.econbiz.de/10014456922

Machine scheduling with restricted rejection : an application to task offloading in cloud-edge collaborative computing

Li, Weidong; Ou, Jinwen - In: European journal of operational research : EJOR 314 (2024) 3, pp. 912-919

Persistent link: https://www.econbiz.de/10014456924

Rescheduling for new orders on a single machine with rejection

Fang, Kan; Luo, Wenchang; Pinedo, Michael; Jin, Miaomiao; … - In: Journal of the Operational Research Society 75 (2024) 2, pp. 346-360

Persistent link: https://www.econbiz.de/10014555675

Bounded mixed batch scheduling with job release dates and rejection

Xu, Jun; Huang, Yong-Xing; Zhang, Daxing; Lin, Ran; … - In: Operations research letters : a journal of INFORMS … 57 (2024), pp. 1-6

Persistent link: https://www.econbiz.de/10015339101

Approximating the product knapsack problem

Pferschy, Ulrich; Schauer, Joachim; Thielen, Clemens - In: Optimization Letters 15 (2021) 8, pp. 2529-2540

negative. We present the first fully polynomial-time approximation scheme for the product knapsack problem, which is known to …

Persistent link: https://www.econbiz.de/10014501611

Optimal algorithms for scheduling under time-of-use tariffs

Chen, Lin; Megow, Nicole; Rischke, Roman; Stougie, Leen; … - In: Annals of Operations Research 304 (2021) 1-2, pp. 85-107

the more general problem, in which jobs may have individual weights, we develop a polynomial-time approximation scheme …

Persistent link: https://www.econbiz.de/10014501748

Approximation schemes for r-weighted Minimization Knapsack problems

Elbassioni, Khaled; Karapetyan, Areg; Trung Thanh Nguyen - 2019

Persistent link: https://www.econbiz.de/10012109558