Preemptive scheduling with two minimax criteria
From MaRDI portal
(Redirected from Publication:1599352)
Recommendations
- scientific article; zbMATH DE number 3883931
- Competitive two-agent scheduling with release dates and preemption on a single machine
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- A bicriterion approach to preemptive scheduling of parallel machines with controllable job processing times
- Preemptive scheduling with position costs
Cited in
(15)- Preemptive scheduling with position costs
- Multicriteria scheduling
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
- Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
- scientific article; zbMATH DE number 3914068 (Why is no real title available?)
- Preemptive repayment policy for multiple loans
- Competitive two-agent scheduling with release dates and preemption on a single machine
- Minimizing total completion time for preemptive scheduling with release dates and deadline constraints
- Two-agent scheduling to minimize the maximum cost with position-dependent jobs
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
- On the two-phase method for preemptive scheduling
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- On preemptive scheduling: A general setting for the two-phase method
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
This page was built for publication: Preemptive scheduling with two minimax criteria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1599352)
