Pages that link to "Item:Q2327626"
From MaRDI portal
The following pages link to Scheduling with release dates and preemption to minimize multiple max-form objective functions (Q2327626):
Displaying 13 items.
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
- Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
- Pareto-scheduling of two competing agents with their own equal processing times (Q2140187) (← links)
- Pareto-scheduling with family jobs or ND-agent on a parallel-batch machine to minimize the makespan and maximum cost (Q2144217) (← links)
- Single-machine scheduling with multi-agents to minimize total weighted late work (Q2197329) (← links)
- Unary NP-hardness of preemptive scheduling to minimize total completion time with release times and deadlines (Q2231743) (← links)
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost (Q2284315) (← links)
- Online NDP-constraint scheduling of jobs with delivery times or weights (Q2693783) (← links)
- Min–Max Scheduling of Batch or Drop-Line Jobs Under Agreeable Release and Processing Times (Q5865923) (← links)
- Bicriterion Pareto‐scheduling of equal‐length jobs on a single machine related to the total weighted late work (Q6057022) (← links)
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work (Q6076476) (← links)
- Competitive two-agent scheduling with release dates and preemption on a single machine (Q6116025) (← links)
- Single-machine scheduling of multiple projects with controllable processing times (Q6167669) (← links)
