The following pages link to Matan Atsmony (Q2147116):
Displaying 4 items.
- A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117) (← links)
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection (Q6103749) (← links)
- Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity (Q6109346) (← links)
- Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection (Q6204202) (← links)
