The following pages link to Gur Mosheiov (Q190064):
Displaying 32 items.
- On trend estimation of time-series: a simple linear programming approach (Q4345522) (← links)
- Heuristics for Multimachine Scheduling Problems with Earliness and Tardiness Costs (Q4363720) (← links)
- Single Machine Scheduling Problems with General Breakdowns, Earliness and Tardiness Costs (Q4367265) (← links)
- Heuristics for multimachine minmax scheduling problems with general earliness and tardiness costs (Q4367301) (← links)
- Minimizing mean absolute deviation of job completion times from the mean completion time (Q4526923) (← links)
- Single machine just‐in‐time scheduling problems with two competing agents (Q4632815) (← links)
- Determining optimal sizes of bounded batches with rejection via quadratic min-cost flow (Q4632969) (← links)
- Due-window assignment with unit processing-time jobs (Q4651729) (← links)
- Parallel machine scheduling with a learning effect (Q4658507) (← links)
- Due-date assignment with asymmetric earliness–tardiness cost (Q4661193) (← links)
- Note on scheduling with general learning curves to minimize the number of tardy jobs (Q4671554) (← links)
- Scheduling unit processing time jobs on an <i>m</i>-machine flow-shop (Q4678245) (← links)
- The pickup delivery location problem on networks (Q4894861) (← links)
- Λ-Shaped Policies to Schedule Deteriorating Jobs (Q5285358) (← links)
- Multi-Machine Scheduling With Linear Deterioration (Q5888073) (← links)
- A Due-Window Determination In Minmax Scheduling Problems (Q5888194) (← links)
- Minimizing maximum earliness on parallel identical machines (Q5926601) (← links)
- Minmax earliness-tardiness costs with unit processing time jobs (Q5937720) (← links)
- Scheduling problems with a learning effect (Q5939597) (← links)
- A common due-data assignment problem on parallel identical machines (Q5953163) (← links)
- A note on batch scheduling on a two-machine flowshop with machine-dependent processing times (Q6054015) (← links)
- On the minmax common-due-date problem: extensions to position-dependent processing times, job rejection, learning effect, uniform machines and flowshops (Q6094306) (← 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)
- The LPT heuristic for minimizing total load on a proportionate openshop (Q6110607) (← links)
- A note: maximizing the weighted number of just-in-time jobs for a given job sequence (Q6136084) (← links)
- A note on lot scheduling on a single machine to minimize maximum weighted tardiness (Q6166192) (← links)
- Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection (Q6204202) (← links)
- Due-date assignment with acceptable lead-times on parallel machines (Q6568406) (← links)
- Dynamic scheduling problems in theory and practice (Q6577338) (← links)
- Single machine scheduling with step-learning (Q6577339) (← links)
- A note: minmax due-window assignment with fixed earliness-tardiness costs (Q6593204) (← links)
