Pages that link to "Item:Q4895811"
From MaRDI portal
The following pages link to Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria (Q4895811):
Displayed 25 items.
- Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness (Q295879) (← links)
- Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan (Q300969) (← links)
- Online tradeoff scheduling on a single machine to minimize makespan and maximum lateness (Q306084) (← links)
- Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines (Q391787) (← links)
- Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost (Q457296) (← links)
- Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost (Q668562) (← links)
- A DP algorithm for minimizing makespan and total completion time on a series-batching machine (Q987835) (← links)
- Bicriteria scheduling on a batching machine to minimize maximum lateness and makespan (Q995579) (← links)
- On the existence of schedules that are near-optimal for both makespan and total weighted completion time (Q1375117) (← links)
- Two-agent scheduling to minimize the maximum cost with position-dependent jobs (Q1723571) (← links)
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints (Q1751234) (← links)
- A note on competing-agent Pareto-scheduling (Q1996756) (← links)
- Single machine batch scheduling with two non-disjoint agents and splitable jobs (Q2023129) (← links)
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion (Q2030503) (← links)
- Unbounded serial-batching scheduling on hierarchical optimization (Q2059199) (← links)
- Scheduling with release dates and preemption to minimize multiple max-form objective functions (Q2327626) (← links)
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness (Q2341390) (← links)
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness (Q2514124) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine (Q2686863) (← links)
- BATCHING MACHINE SCHEDULING WITH BICRITERIA: MAXIMUM COST AND MAKESPAN (Q2931723) (← links)
- Sensitivity analysis in the single-machine scheduling problem with max-min criterion (Q3025043) (← links)
- Hierarchical optimization on an unbounded parallel-batching machine (Q4579881) (← links)
- Counting and enumeration complexity with application to multicriteria scheduling (Q5920490) (← links)
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion (Q6093999) (← links)