Recommendations
Cited in
(only showing first 100 items - show all)- FPTAS for half-products minimization with scheduling applications
- Approximation algorithms for single machine scheduling with one unavailability period
- Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities
- An introduction to the analysis of approximation algorithms
- Parallel approximation schemes for subset sum and knapsack problems
- Structure preserving reductions among convex optimization problems
- Fast approximation algorithm for job sequencing with deadlines
- General approximation algorithms for some arithmetical combinatorial problems
- A note on sequencing jobs with deadlines problem
- Approximation algorithms for scheduling a single machine to minimize total late work
- Optimal due-date assignment and sequencing
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- A general lower bound for the makespan problem
- Scheduling parallel tasks with individual deadlines
- Random sequencing jobs with deadlines problem: Growth of the optimal solution values
- Scheduling identical parallel machines to minimize total weighted completion time
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Feasibility of scheduling lot sizes of two frequencies on one machine
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines
- On fixed-parameter tractability and approximability of NP optimization problems
- An approximation algorithm for scheduling two parallel machines with capacity constraints.
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Parallel machine batching and scheduling with deadlines
- A PTAS for the average weighted completion time problem on unrelated machines.
- Fast fully polynomial approximation schemes for minimizing completion time variance
- Complexities of four problems on two-agent scheduling
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- Knapsack with variable weights satisfying linear constraints
- Multiprofessor scheduling
- Multi-machine scheduling with interval constrained position-dependent processing times
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem
- Two-machine flow-shop scheduling with rejection
- Minimization of ordered, symmetric half-products
- Optimal timing of a sequence of tasks with general completion costs
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- Heuristic methods and applications: A categorized survey
- An improved FPTAS for Restricted Shortest Path.
- Off-line temporary tasks assignment.
- Minimizing the weighted number of tardy jobs on a single machine
- Improving the complexities of approximation algorithms for optimization problems
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Minimizing functions of infeasibilities in a two-machine flow shop
- On scheduling multiple two-stage flowshops
- Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
- Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs
- Single-machine scheduling with an external resource
- New results for scheduling to minimize tardiness on one machine with rejection and related problems
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
- Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
- Online learning for min-max discrete problems
- Approximation schemes for subset-sums ratio problems
- Parameterized multi-scenario single-machine scheduling problems
- Single-machine scheduling with maintenance activities and rejection
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
- Worst-case analysis for on-line service policies
- Improved approximation algorithms for two-stage flowshops scheduling problem
- Scheduling fully parallel jobs
- Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
- Single-machine batch scheduling with job processing time compatibility
- Scheduling with an orthogonal resource constraint
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
- A new approach for bicriteria partitioning problem
- Approximation schemes for a class of subset selection problems
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
- Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
- Equivalence of some different maintenance activities in single-machine scheduling
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- Approximating the least core value and least core of cooperative games with supermodular costs
- A new approach to the learning effect: Beyond the learning curve restrictions
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Designing PTASs for MIN-SUM scheduling problems
- Minimizing labor requirements in a periodic vehicle loading problem
- Load balancing of temporary tasks in the \(\ell _{p}\) norm
- Improved algorithms for single machine scheduling with release dates and rejections
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Unrelated parallel machine scheduling with new criteria: complexity and models
- Exponential size neighborhoods for makespan minimization scheduling
- Improving the solution complexity of the scheduling problem with deadlines: a general technique
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
- Scheduling fully parallel jobs with integer parallel units
- Job Tardiness in Unequal Parallel Processor Systems
- Time-hierarchical scheduling. A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem
- Scheduling proportionally deteriorating jobs in two-machine open shop with a non-bottleneck machine
- scientific article; zbMATH DE number 3883925 (Why is no real title available?)
- Scheduling under linear constraints
- Efficient approximation schemes for the maximum lateness minimization on a single machine with a fixed operator or machine non-availability interval
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- Tight bounds for the identical parallel machine scheduling problem
- Approximate Deadline-Scheduling with Precedence Constraints
- scientific article; zbMATH DE number 4154197 (Why is no real title available?)
This page was built for publication: Algorithms for Scheduling Independent Tasks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4091444)
