The following pages link to Gur Mosheiov (Q190064):
Displaying 50 items.
- (Q163779) (redirect page) (← links)
- 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)
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
- A single machine scheduling problem to minimize total early work (Q342425) (← links)
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
- The optimal number of used machines in a two-stage flexible flowshop scheduling problem (Q398915) (← links)
- Single machine batch scheduling with two competing agents to minimize total flowtime (Q420859) (← links)
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times (Q456108) (← 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)
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops (Q523188) (← links)
- Batch scheduling on two-machine flowshop with machine-dependent setup times (Q606172) (← links)
- Total absolute deviation of job completion times on uniform and unrelated machines (Q609815) (← links)
- (Q699337) (redirect page) (← links)
- The solution of the soccer ``Dream League'' game (Q699338) (← links)
- Two-machine flow shop and open shop scheduling problems with a single maintenance window (Q724106) (← links)
- A note on scheduling deteriorating jobs (Q814222) (← links)
- Scheduling problems with a weight-modifying-activity (Q828829) (← links)
- Single machine scheduling with batch-dependent setup times (Q844160) (← links)
- Minmax scheduling with job-classes and earliness-tardiness costs (Q856255) (← links)
- Due-window assignment problems with unit-time jobs (Q902534) (← links)
- Batch scheduling in a two-stage flexible flow shop problem (Q902743) (← links)
- The Browne-Yechiali single-machine sequence is optimal for flow-shops (Q976013) (← links)
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures (Q976483) (← links)
- Minmax scheduling problems with a common due-window (Q1000973) (← links)
- A multi-criteria scheduling with due-window assignment problem (Q1007672) (← links)
- Scheduling a maintenance activity and due-window assignment on a single machine (Q1010256) (← links)
- A note: Simple heuristics for scheduling a maintenance activity on unrelated machines (Q1017448) (← links)
- Scheduling a maintenance activity to minimize total weighted completion-time (Q1029850) (← links)
- Minimum weighted number of tardy jobs on an \(m\)-machine flow-shop with a critical machine (Q1037662) (← links)
- Scheduling identical jobs and due-window on uniform machines (Q1038326) (← links)
- Asymptotic optimality in probability of a heuristic schedule for open shops with job overlaps (Q1271382) (← links)
- Scheduling jobs under simple linear deterioration (Q1332800) (← links)
- Minimizing the sum of job completion times on capacitated parallel machines (Q1339850) (← links)
- The travelling salesman problem with pick-up and delivery (Q1342068) (← links)
- The traveling salesman problem with delivery and backhauls (Q1342089) (← links)
- Complexity analysis of job-shop scheduling with deteriorating jobs (Q1348391) (← links)
- A note on the maximum number of on-time jobs on parallel identical machines. (Q1422366) (← links)
- A note on the SPT heuristic for solving scheduling problems with generalized due dates (Q1433162) (← links)
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection (Q1652303) (← links)
- Minimizing total load on a proportionate flowshop with position-dependent processing times and job-rejection (Q1705653) (← 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)
- Scheduling job classes on uniform machines (Q1761112) (← links)
- Batch scheduling on uniform machines to minimize total flow-time (Q1762004) (← links)
- Minimizing the number of tardy jobs on a proportionate flowshop with general position-dependent processing times (Q1762149) (← links)
- A note on a due-date assignment on a two-machine flow-shop (Q1765554) (← links)
