The following pages link to Baruch Mor (Q323342):
Displayed 31 items.
- Minsum and minmax scheduling on a proportionate flowshop with common flow-allowance (Q323343) (← links)
- A note: minmax due-date assignment problem with lead-time cost (Q336460) (← links)
- Batch scheduling of identical jobs with controllable processing times (Q336773) (← links)
- Scheduling a deteriorating maintenance activity and due-window assignment (Q337476) (← links)
- Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859) (← links)
- Batch scheduling of identical jobs on parallel identical machines (Q456112) (← links)
- A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop (Q477611) (← links)
- A note: minimizing maximum earliness on a proportionate flowshop (Q477650) (← links)
- Total absolute deviation of job completion times on uniform and unrelated machines (Q609815) (← links)
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483) (← links)
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection (Q1652303) (← links)
- A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection (Q1730596) (← links)
- Batch scheduling on uniform machines to minimize total flow-time (Q1762004) (← links)
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance (Q2012897) (← links)
- Single machine lot scheduling with optional job-rejection (Q2025088) (← links)
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
- Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads (Q2075458) (← links)
- Minsum scheduling with acceptable lead-times and optional job rejection (Q2119760) (← links)
- Single machine scheduling with non-availability interval and optional job rejection (Q2168742) (← links)
- Minimizing total load on parallel machines with linear deterioration (Q2174916) (← links)
- Lot scheduling on a single machine to minimize the (weighted) number of tardy orders (Q2203602) (← links)
- Flowshop scheduling with learning effect and job rejection (Q2215196) (← links)
- A note on the single machine CON and CONW problems with lot scheduling (Q2230735) (← links)
- Minmax due-date assignment on a two-machine flowshop (Q2241579) (← links)
- Regular scheduling measures on proportionate flowshop with job rejection (Q2307854) (← links)
- Scheduling with two competing agents to minimize total weighted earliness (Q2399317) (← links)
- Minmax scheduling problems with common due-date and completion time penalty (Q2424794) (← links)
- Batch scheduling with step-deteriorating processing times to minimize flowtime (Q3120638) (← links)
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation (Q5059190) (← links)
- Single-machine lot scheduling with variable lot processing times (Q6094300) (← links)
- Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity (Q6109346) (← links)