Matan Atsmony

According to our database1, Matan Atsmony authored at least 7 papers between 2022 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Single machine scheduling with step-learning.
J. Sched., June, 2024

Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection.
Optim. Lett., April, 2024

Common due-date assignment problems with fixed-plus-linear earliness and tardiness costs.
Comput. Ind. Eng., 2024

2023
Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity.
Comput. Oper. Res., April, 2023

Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection.
J. Sched., 2023

2022
A Greedy heuristic for solving scheduling problems with bounded rejection cost.
Comput. Oper. Res., 2022

Minimizing total completion time with linear deterioration: A new lower bound.
Comput. Ind. Eng., 2022


  Loading...