Mirror scheduling problems with early work and late work criteria
From MaRDI portal
Publication:2066692
DOI10.1007/s10951-020-00636-9zbMath1480.90129OpenAlexW3003360778WikidataQ115198391 ScholiaQ115198391MaRDI QIDQ2066692
Xin Chen, Małgorzata Sterna, Sergey Kovalev, Jacek Błażewicz
Publication date: 14 January 2022
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-020-00636-9
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (8)
Approximation algorithms for the maximum bounded connected bipartition problem ⋮ Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work ⋮ A no-delay single machine scheduling problem to minimize total weighted early and late work ⋮ Variable neighborhood search for the single machine scheduling problem to minimize the total early work ⋮ Maximizing total early work in a distributed two‐machine flow‐shop ⋮ Exact approaches to late work scheduling on unrelated machines ⋮ A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems ⋮ Two-machine flow shop scheduling with a common due date to maximize total early work
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of scheduling starting time dependent tasks with release times
- A note on scheduling problems with competing agents and earliness minimization objectives
- A single machine scheduling problem to minimize total early work
- Maximization problems in single machine scheduling
- A concise survey of scheduling with time-dependent processing times
- Minimizing the total weighted late work in scheduling of identical parallel processors with communication delays
- Scheduling on parallel identical machines with late work criterion: offline and online cases
- Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
- Minimizing total weighted late work in the resource-constrained project scheduling problem
- Minimising makespan in the two-machine flow-shop with release times
- Minimizing Total Tardiness on One Machine is NP-Hard
- Single Machine Scheduling to Minimize Total Late Work
- A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work
This page was built for publication: Mirror scheduling problems with early work and late work criteria
