Algorithms for Scheduling Independent Tasks
From MaRDI portal
Publication:4091444
Recommendations
Cited in
(only showing first 100 items - show all)- Improving the solution complexity of the scheduling problem with deadlines: a general technique
- Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- Online real-time preemptive scheduling of jobs with deadlines on multiple machines
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- New results for scheduling to minimize tardiness on one machine with rejection and related problems
- A state-of-the-art survey on multi-scenario scheduling
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
- A new approach for bicriteria partitioning problem
- Load balancing of temporary tasks in the \(\ell _{p}\) norm
- General approximation algorithms for some arithmetical combinatorial problems
- Bicriterion scheduling with a negotiable common due window and resource-dependent processing times
- An introduction to the analysis of approximation algorithms
- New algorithms for minimizing the weighted number of tardy jobs on a single machine
- On scheduling multiple two-stage flowshops
- Scheduling and fixed-parameter tractability
- Worst case analysis of greedy and related heuristics for some min-max combinatorial optimization problems
- 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
- Serial batching to minimize the weighted number of tardy jobs
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries
- Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs
- Scheduling to minimize release-time resource consumption and tardiness penalties
- Job Tardiness in Unequal Parallel Processor Systems
- scientific article; zbMATH DE number 3883925 (Why is no real title available?)
- Approximation schemes for subset-sums ratio problems
- Single-machine scheduling with autonomous and induced learning to minimize total weighted number of tardy jobs
- scientific article; zbMATH DE number 4154197 (Why is no real title available?)
- A polynomial-time approximation scheme for an arbitrary number of parallel identical multi-stage flow-shops
- Maximizing set function formulation of two scheduling problems
- scientific article; zbMATH DE number 1837685 (Why is no real title available?)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier
- Minimizing labor requirements in a periodic vehicle loading problem
- A note on sequencing jobs with deadlines problem
- Heuristic scheduling of parallel machines with sequence-dependent set-up times
- Multiprofessor scheduling
- Single-machine scheduling with an external resource
- Approximation scheduling algorithms: a survey
- Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances
- A polynomial-time approximation scheme for an arbitrary number of parallel two-stage flow-shops
- Complexities of four problems on two-agent scheduling
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
- A fully polynomial time approximation scheme for scheduling on parallel identical two-stage openshops
- Single-machine batch scheduling with job processing time compatibility
- Maximizing Throughput in Flow Shop Real-Time Scheduling
- A PTAS for the average weighted completion time problem on unrelated machines.
- Approximate Deadline-Scheduling with Precedence Constraints
- Scheduling with an orthogonal resource constraint
- Minimizing functions of infeasibilities in a two-machine flow shop
- A composite heuristic for the identical parallel machine scheduling problem with minimum makespan objective
- Off-line temporary tasks assignment.
- Performance of service policies in a specialized service system with parallel servers
- A hybrid heuristic approach to minimize number of tardy jobs in group technology systems
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains
- Server cloud scheduling
- Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times
- Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks
- Single-machine primary-secondary scheduling with total tardiness being the primary criterion
- Parallel machine batching and scheduling with deadlines
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks
- NP-Complete operations research problems and approximation algorithms
- Branch distance optimization of structured programs
- Scheduling parallel tasks with individual deadlines
- Knapsack with variable weights satisfying linear constraints
- Multi-machine scheduling with interval constrained position-dependent processing times
- An approximation scheme for minimizing the makespan of the parallel identical multi-stage flow-shops
- State aggregation in dynamic programming - an application to scheduling of independent jobs on parallel processors
- Single-machine time-dependent scheduling with proportional and delivery times
- Random sequencing jobs with deadlines problem: Growth of the optimal solution values
- Scheduling with machine conflicts
- A tight linear time \(\frac{13}{12}\)-approximation algorithm for the \(P2 || C_{\max}\) problem
- A PTAS for the Multiple Parallel Identical Multi-stage Flow-Shops to Minimize the Makespan
- The bound coverage problem by aligned disks in \(L_1\) metric
- Approximating the least core value and least core of cooperative games with supermodular costs
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- Artificial immune systems can find arbitrarily good approximations for the NP-hard number partitioning problem
- Equivalence of some different maintenance activities in single-machine scheduling
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work
- A general lower bound for the makespan problem
- An efficient job scheduling algorithm in partitionable mesh connected systems
- On the integration of theoretical single-objective scheduling results for multi-objective problems
- Two‐agent scheduling with linear resource‐dependent processing times
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems
- Parameterized multi-scenario single-machine scheduling problems
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates
- Exponential size neighborhoods for makespan minimization scheduling
- Randomized approximation schemes for minimizing the weighted makespan on identical parallel machines
- On maximal and minimal triangular planar graphs: an optimization approach
- An approximation algorithm for scheduling two parallel machines with capacity constraints.
- Heuristic methods and applications: A categorized survey
- Impact of deadline intervals on behavior of solutions to the random sequencing jobs with deadlines problem
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines
- Scheduling fully parallel jobs
- Online learning for min-max discrete problems
- On fixed-parameter tractability and approximability of NP optimization problems
- Worst-case analysis for on-line service policies
- Fast fully polynomial approximation schemes for minimizing completion time variance
- Worst-case analysis of LPT scheduling on a small number of non-identical processors
- Structure preserving reductions among convex optimization problems
- Improved approximation algorithm for the combination of parallel machine scheduling and vertex cover
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
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)
