Algorithms for Scheduling Independent Tasks
From MaRDI portal
Publication:4091444
Recommendations
Cited in
(only showing first 100 items - show all)- Polynomial time approximation schemes and parameterized complexity
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
- Solving min-max shortest-path problems on a network
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
- Off-line temporary tasks assignment.
- Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
- Scheduling to minimize release-time resource consumption and tardiness penalties
- Scheduling fully parallel jobs
- Fast exact and approximate algorithms for k-partition and scheduling independent tasks
- The just-in-time scheduling problem in a flow-shop scheduling system
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
- Improved algorithms for single machine scheduling with release dates and rejections
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Maximizing set function formulation of two scheduling problems
- Approximation scheduling algorithms: a survey
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- Scheduling to minimize the maximum total completion time per machine
- A new approach to the learning effect: Beyond the learning curve restrictions
- Scheduling with machine conflicts
- A survey on offline scheduling with rejection
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
- An efficient job scheduling algorithm in partitionable mesh connected systems
- Efficient partitioning of sequences
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- scientific article; zbMATH DE number 1837685 (Why is no real title available?)
- Equivalence of some different maintenance activities in single-machine scheduling
- On fixed-parameter tractability and approximability of NP optimization problems
- Isomorphic scheduling problems
- An introduction to the analysis of approximation algorithms
- An approximation algorithm for scheduling two parallel machines with capacity constraints.
- On bilevel machine scheduling problems
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
- scientific article; zbMATH DE number 8821 (Why is no real title available?)
- Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times
- Single-machine primary-secondary scheduling with total tardiness being the primary criterion
- FPTAS for half-products minimization with scheduling applications
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Unrelated parallel machine scheduling with new criteria: complexity and models
- On scheduling multiple two-stage flowshops
- Scheduling with an orthogonal resource constraint
- Combination of parallel machine scheduling and vertex cover
- Load balancing of temporary tasks in the \(\ell _{p}\) norm
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
- Approximation algorithms for scheduling unrelated parallel machines
- Feasibility of scheduling lot sizes of two frequencies on one machine
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
- Fast approximation algorithm for job sequencing with deadlines
- Tight bounds for the identical parallel machine scheduling problem
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
- Server cloud scheduling
- Approximation schemes for subset-sums ratio problems
- Scheduling parallel tasks with individual deadlines
- A state-of-the-art review of parallel-machine scheduling research
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
- Approximation algorithms for scheduling with reservations
- Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem
- Heuristic methods and applications: A categorized survey
- Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs
- On maximal and minimal triangular planar graphs: an optimization approach
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- scientific article; zbMATH DE number 3883925 (Why is no real title available?)
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
- Structure preserving reductions among convex optimization problems
- General approximation algorithms for some arithmetical combinatorial problems
- Designing PTASs for MIN-SUM scheduling problems
- Scheduling fully parallel jobs with integer parallel units
- Minimization of ordered, symmetric half-products
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- Fast fully polynomial approximation schemes for minimizing completion time variance
- An improved FPTAS for Restricted Shortest Path.
- State aggregation in dynamic programming - an application to scheduling of independent jobs on parallel processors
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
- Single-machine scheduling with an external resource
- Minimizing functions of infeasibilities in a two-machine flow shop
- Random sequencing jobs with deadlines problem: Growth of the optimal solution values
- Approximate Deadline-Scheduling with Precedence Constraints
- Time-hierarchical scheduling. A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem
- Completeness in approximation classes
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
- Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
- Worst-case analysis for on-line service policies
- Complexities of four problems on two-agent scheduling
- Approximation schemes for a class of subset selection problems
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
- Approximation algorithms for single machine scheduling with one unavailability period
- Uniform parallel-machine scheduling with time dependent processing times
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Scheduling under linear constraints
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)
