受强制性开放获取政策约束的文章 - Gur Mosheiov了解详情
无法在其他位置公开访问的文章：10 篇
Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
D Shabtay, G Mosheiov, D Oron
European journal of operational research 303 (1), 66-77, 2022
强制性开放获取政策： German Research Foundation
Minimizing total completion time with linear deterioration: A new lower bound
M Atsmony, G Mosheiov
Computers & Industrial Engineering 163, 107867, 2022
强制性开放获取政策： German Research Foundation
Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection
M Atsmony, G Mosheiov
Journal of Scheduling 26 (2), 193-207, 2023
强制性开放获取政策： German Research Foundation
Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity
M Atsmony, B Mor, G Mosheiov
Computers & Operations Research 152, 106133, 2023
强制性开放获取政策： German Research Foundation
A greedy heuristic for solving scheduling problems with bounded rejection cost
M Atsmony, G Mosheiov
Computers & Operations Research 144, 105827, 2022
强制性开放获取政策： German Research Foundation
A note on lot scheduling on a single machine to minimize maximum weighted tardiness
G Mosheiov, A Sarig
Journal of Combinatorial Optimization 45 (5), 128, 2023
强制性开放获取政策： German Research Foundation
Coupled task scheduling with convex resource consumption functions
G Mosheiov, D Oron, A Salehipour
Discrete Applied Mathematics 293, 128-133, 2021
强制性开放获取政策： Australian Research Council
The LPT heuristic for minimizing total load on a proportionate openshop
E Gerstl, G Mosheiov
Discrete Applied Mathematics 338, 190-198, 2023
强制性开放获取政策： German Research Foundation
A note on batch scheduling on a two-machine flowshop with machine-dependent processing times
G Mosheiov, D Oron
4OR 21 (3), 457-469, 2023
强制性开放获取政策： German Research Foundation
A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence
E Gerstl, G Mosheiov
Journal of Scheduling 26 (4), 403-409, 2023
强制性开放获取政策： German Research Foundation
可在其他位置公开访问的文章：1 篇
On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates
G Mosheiov, D Oron, D Shabtay
Journal of Scheduling 25 (5), 577-587, 2022
强制性开放获取政策： German Research Foundation
出版信息和资助信息由计算机程序自动确定