Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
From MaRDI portal
Publication:2301935
Recommendations
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- 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
- Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date
- Approximation schemes for scheduling jobs with common due date on parallel machines to minimize Total tardiness
Cites work
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- A note on a two-agent scheduling problem related to the 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
- 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
- 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 2190176 (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
- Open shop scheduling problems with late work criteria.
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- 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 NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
Cited in
(24)- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- 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
- 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 common assignable due date/due window to minimize total weighted early and late work
- A parallel machine scheduling problem maximizing total weighted early work
- A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights
- A parallel-machine scheduling problem with an antithetical property to maximize total weighted early work
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work
- Exact approaches to late work scheduling on unrelated machines
- 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
- 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
- No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines
- 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
- The two single-machine scheduling problems with slack due date to minimize total early work and late work
- Minimizing the maximum late work for a single-machine scheduling problem with flexible maintenance activities
- Semi-online scheduling on two identical machines with a common due date to maximize total early work
This page was built for publication: Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2301935)
