Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work

DOI10.1007/s10957-017-1147-7zbMath1373.90063DBLPjournals/jota/SternaC17OpenAlexW2739526460WikidataQ59608045 ScholiaQ59608045MaRDI QIDQ1673940

Kateryna Czerniachowska, Małgorzata Sterna

Publication date: 27 October 2017

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10957-017-1147-7

zbMATH Keywords

schedulingparallel machinespolynomial time approximation schemeearly worklate work

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Related Items (13)

Semi-online scheduling on two identical machines with a common due date to maximize total early work ⋮ Pareto-scheduling of two competing agents with their own equal processing times ⋮ Two-machine flow-shop scheduling to minimize total late work: revisited ⋮ Approximation algorithms for the maximum bounded connected bipartition problem ⋮ A common approximation framework for early work, late work, and resource leveling problems ⋮ 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 ⋮ 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 ⋮ Combinatorial approximation algorithms for the maximum bounded connected bipartition problem ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A single machine scheduling problem to minimize total early work
• Minimizing mean weighted execution time loss on identical and uniform processors
• Dominance relations for two-machine flow shop problem with late work criterion
• A note on the two machine job shop with the weighted late work criterion
• Time-dependent scheduling
• Approximation algorithms for scheduling a single machine to minimize total late work
• Approximation schemes for scheduling on parallel machines
• Open shop scheduling problems with late work criteria.
• Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
• A two-agent single-machine scheduling problem with late work criteria
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• The two-machine flow-shop problem with weighted late work criterion and common due date
• Minimizing total weighted late work in the resource-constrained project scheduling problem
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
• The complexity of two supply chain scheduling problems
• Single Machine Scheduling to Minimize Total Late Work
• Approximate Algorithms for the 0/1 Knapsack Problem
• A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
• Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
• Single Machine Scheduling to Minimize Total Weighted Late Work
• Multiagent Scheduling
• Handbook on Scheduling
• KI 2005: Advances in Artificial Intelligence
• Scheduling

This page was built for publication: Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work