Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
From MaRDI portal
(Redirected from Publication:1673940)
Recommendations
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- A parallel machine scheduling problem maximizing total weighted early work
- Two-machine flow shop scheduling with a common due date to maximize total early work
- A note on multimachine scheduling with weighted early/late work criteria and common due date
- A common approximation framework for early work, late work, and resource leveling problems
Cites work
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- A note on the two machine job shop with the weighted late work criterion
- A single machine scheduling problem to minimize total early work
- A two-agent single-machine scheduling problem with late work criteria
- Approximate Algorithms for the 0/1 Knapsack Problem
- Approximation algorithms for scheduling a single machine to minimize total late work
- Approximation schemes for scheduling on parallel machines
- Approximation schemes for single-machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- Dominance relations for two-machine flow shop problem with late work criterion
- Handbook on Scheduling
- scientific article; zbMATH DE number 1594554 (Why is no real title available?)
- scientific article; zbMATH DE number 3902030 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- KI 2005: Advances in Artificial Intelligence
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
- Minimizing mean weighted execution time loss on identical and uniform processors
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- Minimizing total weighted late work in the resource-constrained project scheduling problem
- Multiagent scheduling. Models and algorithms
- Open shop scheduling problems with late work criteria.
- Scheduling
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Single Machine Scheduling to Minimize Total Late Work
- Single Machine Scheduling to Minimize Total Weighted Late Work
- The complexity of two supply chain scheduling problems
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Time-dependent scheduling
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
Cited in
(26)- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
- Mirror scheduling problems with early work and late work criteria
- Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
- Two-machine flow shop scheduling with a common due date to maximize total early work
- Pareto-scheduling of two competing agents with their own equal processing times
- Approximation algorithms for the maximum bounded connected bipartition problem
- A common approximation framework for early work, late work, and resource leveling problems
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- A parallel machine scheduling problem maximizing total weighted early work
- Two-machine flow-shop scheduling to minimize total late work: revisited
- A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work
- Maximizing total early work in a distributed two‐machine flow‐shop
- Exact approaches to late work scheduling on unrelated machines
- A note on multimachine scheduling with weighted early/late work criteria and common due date
- Improved approximation schemes for early work scheduling on identical parallel machines with a common due date
- Online early work scheduling on parallel machines
- Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems
- Two-agent scheduling of minimizing total weighted late work and maximum cost
- Online budget allocation maximization problem on two uniform machines with a common due date
- Scheduling with assignable due dates, two competing agents and late work related criteria
- Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work
- Minimizing total weighted late work in a proportionate flow shop with job rejection
- Approximation schemes for parallel machine scheduling to maximize total weighted early work with a common due date
- Scheduling with a discounted profit criterion on identical machines
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
This page was built for publication: Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1673940)
