„weighted completion time“

Suchergebnisse

1.000+ Treffer

• Group Scheduling with Controllable Setup and Processing Times: Minimizing Total Weighted Completion Time
  Ng, C. T. ; Cheng, T. C. E. ; Janiak, Adam ; Kovalyov, Mikhail Y.
• Algorithms for the single machine total weighted completion time scheduling problem with release times and sequence-dependent setups
  Chou, Fuh-Der ; Wang, Hui-Mei ; Chang, Tzu-Yun
• Minimizing total weighted completion and batch delivery times with machine deterioration and learning effect: a case study from wax production
  Rostami, Mohammad ; Nikravesh, Shiva ; Shahin, Mahdi
• Single machine lot scheduling to minimize maximum weighted completion time
  Zheng, Feifeng ; Li, Na ; Liu, Ming ; Xu, Yinfeng
• An Efficient Polynomial Time Approximation Scheme for Minimizing the Total Weighted Completion Time on Uniformly Related Machines
  Epstein, Leah ; Levin, Asaf 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Flow shops with reentry: The total weighted completion time objective
  Aspern, Maximilian von ; Buld, Felix ; Klein, Nicklas ; Pinedo, Michael
• An EPTAS for Minimizing the Total Weighted Completion Time of Jobs with Release Dates on Uniformly Related Machines
  Epstein, Leah ; Levin, Asaf 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
  Afrati, Foto ; Bampis, Evripidis ; Chekuri, Chandra ; Karger, David ; Kenyon, Claire ; Khanna, Sanjeev ; Milis, Ioannis ; Queyranne, Maurice ; Skutella, Martin ; Stein, Clifford ; Sviridenko, Maxim
• Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods
  Nessah, Rabia ; Chu, Chengbin
• Single Machine Scheduling with Few Deadlines
  Heeger, Klaus ; Hermelin, Danny ; Shabtay, Dvir 2023 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Approximation Algorithms for Scheduling with Resource and Precedence Constraints
  Demirci, Gökalp ; Hoffmann, Henry ; Kim, David H. K. 2018 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• An FPTAS of Minimizing Total Weighted Completion Time on Single Machine with Position Constraint
  Calinescu, Gruia ; Jaehn, Florian ; Li, Minming ; Wang, Kai 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Rescheduling due to machine disruption to minimize the total weighted completion time
  Luo, Wenchang ; Luo, Taibo ; Goebel, Randy ; Lin, Guohui
• A note on minimizing total weighted completion time with an unexpected machine unavailable interval
  Liu, Peihai ; Wang, Chao ; Lu, Xiwen
• Machine Scheduling to Minimize Weighted Completion Times – The Use of the α-point
  Gusmeroli, Nicoló 2018 Springer International Publishing
• Two-machine flow shop scheduling with deteriorating jobs: minimizing the weighted sum of makespan and total completion time
  Cheng, Mingbao ; Tadikamalla, Pandu R. ; Shang, Jennifer ; Zhang, Bixi
• The Expected Competitive Ratio for Weighted Completion Time Scheduling
  Souza, Alexander ; Steger, Angelika
• The constrained minimum weighted sum of job completion times problem
  Levin, Asaf ; Woeginger, Gerhard J.
• Minimizing total weighted completion time approximately for the parallel machine problem with a single server
  Hasani, Keramat ; Kravčenko, Svetlana A. ; Werner, Frank 2013 Univ., Fak. für Mathematik
• On scheduling with non-increasing time slot cost to minimize total weighted completion time
  Zhao, Yingchao ; Qi, Xiangtong ; Li, Minming