Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

DOI10.1016/J.EJOR.2019.12.003zbMATH Open1441.90059OpenAlexW2992207127WikidataQ115198396 ScholiaQ115198396MaRDI QIDQ2301935FDOQ2301935

Authors: Xin Chen, Yage Liang, Małgorzata Sterna, W. Wang, Jacek Blazewicz 

Publication date: 25 February 2020

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2019.12.003

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

zbMATH Keywords

schedulingparallel identical machinesfully polynomial time approximation schemeearly worklate work

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• A note on the two machine job shop with the weighted late work criterion
• The two-machine flow-shop problem with weighted late work criterion and common due date
• Approximation schemes for scheduling on parallel machines
• THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
• A single machine scheduling problem to minimize total early work
• Title not available (Why is that?)
• Single Machine Scheduling to Minimize Total Late Work
• Two-agent scheduling problems on a single-machine to minimize the total weighted late work
• A note on a two-agent scheduling problem related to the total weighted late work
• The complexity of two supply chain scheduling problems
• Approximation algorithms for scheduling a single machine to minimize total late work
• Minimizing mean weighted execution time loss on identical and uniform processors
• Dominance relations for two-machine flow shop problem with late work criterion
• Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date
• Open shop scheduling problems with late work criteria.
• Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
• Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
• Scheduling on parallel identical machines with late work criterion: offline and online cases
• Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
• 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
• KI 2005: Advances in Artificial Intelligence
• Title not available (Why is that?)
• Single Machine Scheduling to Minimize Total Weighted Late Work
• A two-agent single-machine scheduling problem with late work criteria
• Minimizing total weighted late work in the resource-constrained project scheduling problem
• Title not available (Why is that?)
• A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion

Cited In (15)

• Semi-online scheduling on two identical machines with a common due date to maximize total early work
• A parallel machine scheduling problem maximizing total weighted early work
• Improved approximation schemes for early work scheduling on identical parallel machines with a common due date
• Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
• A common approximation framework for early work, late work, and resource leveling problems
• Two-machine flow shop scheduling with a common due date to maximize total early work
• Online early work scheduling on parallel machines
• Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize 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
• Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work
• Exact approaches to late work scheduling on unrelated machines
• Resource leveling: complexity of a unit execution time two-processor scheduling variant and related problems
• Approximation algorithms for the maximum bounded connected bipartition problem

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)