Pages that link to "Item:Q4632917"
From MaRDI portal
The following pages link to Approximation schemes for single‐machine scheduling with a fixed maintenance activity to minimize the total amount of late work (Q4632917):
Displaying 18 items.
- Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← links)
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work (Q1673940) (← links)
- The study of group scheduling problems with general dual-position-based job processing times (Q1689067) (← links)
- Minimizing total late work on a single machine with generalized due-dates (Q2030324) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Two-machine flow shop scheduling with a common due date to maximize total early work (Q2116855) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Minimizing total weighted late work on a single-machine with non-availability intervals (Q2165284) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- Single-machine common due date total earliness/tardiness scheduling with machine unavailability (Q2286433) (← links)
- Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date (Q2301935) (← links)
- Equivalence of some different maintenance activities in single-machine scheduling (Q2422132) (← links)
- Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
- Single machine scheduling with common assignable due date/due window to minimize total weighted early and late work (Q2673557) (← links)
- Two-machine flow-shop scheduling to minimize total late work: revisited (Q5059191) (← links)
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← links)
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion (Q6093999) (← links)
- A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)
