Semi-online scheduling on two identical machines with a common due date to maximize total early work
From MaRDI portal
Publication:827603
DOI10.1016/j.dam.2020.05.023zbMath1457.90065OpenAlexW3035665153WikidataQ115198393 ScholiaQ115198393MaRDI QIDQ827603
Małgorzata Sterna, Yuqing Liu, Sergey Kovalev, Isabelle Chalamon, Xin Chen, Jacek Błażewicz
Publication date: 13 January 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.05.023
Related Items
Semi-online early work maximization problem on two hierarchical machines with partial information of processing time ⋮ Semi-online scheduling: a survey ⋮ A no-delay single machine scheduling problem to minimize total weighted early and late work ⋮ Semi-online early work maximization problems on two hierarchical uniform machines with partial information of processing time ⋮ Online early work maximization on three hierarchical machines with a common due date ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work
Cites Work
- Unnamed Item
- Unnamed Item
- Minimizing mean weighted execution time loss on identical and uniform processors
- A note on the two machine job shop with the weighted late work criterion
- Approximation algorithms for scheduling a single machine to minimize total late work
- Semi on-line algorithms for the partition problem
- Semi on-line scheduling on two identical machines
- Open shop scheduling problems with late work criteria.
- A survey on makespan minimization in semi-online environments
- 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
- The two-machine flow-shop problem with weighted late work criterion and common due date
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE
- Single Machine Scheduling to Minimize Total Late Work
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work
- Single‐machine scheduling with deadlines to minimize the total weighted late work
- Bounds for Certain Multiprocessing Anomalies
