The following pages link to Dvir Shabtay (Q271930):
Displaying 50 items.
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times (Q271931) (← links)
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost (Q297182) (← links)
- Single machine scheduling with two competing agents and equal job processing times (Q319290) (← links)
- Optimal restricted due date assignment in scheduling (Q322834) (← links)
- A note: minmax due-date assignment problem with lead-time cost (Q336460) (← links)
- On the optimality of the \(TLS\) algorithm for solving the online-list scheduling problem with two job types on a set of multipurpose machines (Q358659) (← links)
- A survey on offline scheduling with rejection (Q398830) (← links)
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
- The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties (Q437059) (← links)
- On the asymptotic behavior of subtour-patching heuristics in solving the TSP on permuted Monge matrices (Q623315) (← links)
- Scheduling unit length jobs on parallel machines with lookahead information (Q657255) (← links)
- Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
- New algorithms for minimizing the weighted number of tardy jobs on a single machine (Q829184) (← links)
- Single machine batch scheduling to minimize total completion time and resource consumption costs (Q835561) (← links)
- Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
- Two due date assignment problems in scheduling a single machine (Q867932) (← links)
- The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
- A bicriteria approach to minimize maximal lateness and resource consumption for scheduling a single machine (Q954246) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- A unified approach for scheduling with convex resource consumption functions using positional penalties (Q976312) (← links)
- Optimal due date assignment and resource allocation in a group technology scheduling environment (Q991385) (← links)
- Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203) (← links)
- The resource dependent assignment problem with a convex agent cost function (Q1753596) (← links)
- Online scheduling of two job types on a set of multipurpose machines with unit processing times (Q1761990) (← links)
- Two-machine flow-shop scheduling with rejection (Q1762086) (← links)
- Convex resource allocation for minimizing the makespan in a single machine with job release dates (Q1881652) (← links)
- Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine (Q1885985) (← links)
- Minimizing the total weighted flow time in a single machine with controllable processing times (Q1886005) (← links)
- An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times (Q1926488) (← links)
- On the parameterized tractability of single machine scheduling with rejection (Q1991260) (← links)
- Multipurpose machine scheduling with rejection and identical job processing times (Q2018939) (← links)
- Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
- Scheduling in multi-scenario environment with an agreeable condition on job processing times (Q2070719) (← links)
- On the tractability of hard scheduling problems with generalized due-dates with respect to the number of different due-dates (Q2093185) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- Faster minimization of tardy processing time on a single machine (Q2134746) (← links)
- A general scheme for solving a large set of scheduling problems with rejection in FPT time (Q2142679) (← links)
- Parameterized multi-scenario single-machine scheduling problems (Q2196612) (← links)
- Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
- A pseudo-polynomial time algorithm for solving the resource dependent assignment problem (Q2255050) (← links)
- Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling (Q2275933) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- Optimal robot scheduling to minimize the makespan in a three-machine flow-shop environment with job-independent processing times (Q2290581) (← links)
- On the parameterized tractability of the just-in-time flow-shop scheduling problem (Q2294891) (← links)
- Erratum to: ``A survey on offline scheduling with rejection'' (Q2356127) (← links)
- A survey of scheduling with controllable processing times (Q2381529) (← links)
- A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
