Algorithms for Scheduling Independent Tasks
From MaRDI portal
Publication:4091444
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
- Approximation algorithms for scheduling with reservations
- Single-machine scheduling with maintenance activities and rejection
- scientific article; zbMATH DE number 849179 (Why is no real title available?)
- Randomized priority algorithms
- Isomorphic scheduling problems
- Minimizing the total weighted completion time of fully parallel jobs with integer parallel units
- A binary multiple knapsack model for single machine scheduling with machine unavailability
- Due date assignment and single machine scheduling with deteriorating jobs to minimize the weighted number of tardy jobs
- Combination of parallel machine scheduling and vertex cover
- The single machine serial batch scheduling problem with rejection to minimize total completion time and total rejection cost
- A new approach to the learning effect: Beyond the learning curve restrictions
- Efficient partitioning of sequences
- Improving the complexities of approximation algorithms for optimization problems
- Approximation schemes for a class of subset selection problems
- An improved FPTAS for Restricted Shortest Path.
- scientific article; zbMATH DE number 1559404 (Why is no real title available?)
- On bilevel machine scheduling problems
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
- A new branch and bound algorithm for minimizing the weighted number of tardy jobs
- Scheduling parallel tasks with individual deadlines
- Scheduling proportionally deteriorating jobs in two-machine open shop with a non-bottleneck machine
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Parallel approximation schemes for subset sum and knapsack problems
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs
- An analysis of the LPT algorithm for the max-min and the min-ratio partition problems
- Scheduling identical parallel machines to minimize total weighted completion time
- Just-in-time scheduling with controllable processing times on parallel machines
- Scheduling to minimize the maximum total completion time per machine
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
- Solving min-max shortest-path problems on a network
- Approximation algorithms for scheduling a single machine to minimize total late work
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Theoretical comparisons of search strategies in branch-and-bound algorithms
- Minimizing the weighted number of tardy jobs on a single machine with release dates
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains
- Completeness in approximation classes
- Unrelated parallel machine scheduling with new criteria: complexity and models
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- scientific article; zbMATH DE number 8821 (Why is no real title available?)
- Tight bounds for the identical parallel machine scheduling problem
- The complexity of finding Nash equilibria
- The just-in-time scheduling problem in a flow-shop scheduling system
- Minimization of ordered, symmetric half-products
- Two due date assignment problems in scheduling a single machine
- Approximation algorithms for scheduling unrelated parallel machines
- Time-hierarchical scheduling. A worst case analysis of a hierarchical approach integrating planning and scheduling in an online problem
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem
- Feasibility of scheduling lot sizes of two frequencies on one machine
- Matching based very large-scale neighborhoods for parallel machine scheduling
- Optimal due-date assignment and sequencing
- FPTAS for half-products minimization with scheduling applications
- Single processor scheduling with job values depending on their completion times
- Recent trends in combinatorial optimization
- Minimizing the weighted number of tardy jobs on a single machine
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
- 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 state-of-the-art review of parallel-machine scheduling research
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Single machine batch scheduling to minimize the sum of total flow time and batch delivery cost with an unavailability interval
- Approximation algorithms for single machine scheduling with one unavailability period
- An FPTAS for the parallel two-stage flowshop problem
- Improved algorithms for single machine scheduling with release dates and rejections
- A comparison of branch-and-bound algorithms for a family scheduling problem with identical parallel machines
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems
- Polynomial time approximation schemes and parameterized complexity
- Approximation algorithms for minimizing total weighted completion time of orders on identical machines in parallel
- A survey on offline scheduling with rejection
- A bicriteria approach to scheduling a single machine with job rejection and positional penalties
- Scheduling fully parallel jobs with integer parallel units
- Approximation algorithms for maximizing the weighted number of early jobs on a single machine with non-availability intervals
- Improved approximation algorithms for two-stage flowshops scheduling problem
- Uniform parallel-machine scheduling with time dependent processing times
- Fast approximation algorithm for job sequencing with deadlines
- Designing PTASs for MIN-SUM scheduling problems
- Optimal timing of a sequence of tasks with general completion costs
- Two-machine flow-shop scheduling with rejection
- 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
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)
