Preemptive scheduling with two minimax criteria

DOI10.1023/A:1014971620268zbMATH Open1015.90044OpenAlexW77591251MaRDI QIDQ1599352FDOQ1599352

Authors: Francis Sourd 

Publication date: 9 June 2002

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1014971620268

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

zbMATH Keywords

single-machinepreemptive schedulingbicriterialength of a schedule

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Minimax problems in mathematical programming (90C47)

Cited In (15)

• Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines
• Two-agent scheduling to minimize the maximum cost with position-dependent jobs
• On preemptive scheduling: A general setting for the two-phase method
• 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
• Scheduling with release dates and preemption to minimize multiple max-form objective functions
• Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
• Title not available (Why is that?)
• Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
• Preemptive repayment policy for multiple loans
• Minimizing total completion time for preemptive scheduling with release dates and deadline constraints
• Multicriteria scheduling
• A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS
• Competitive two-agent scheduling with release dates and preemption on a single machine
• Preemptive scheduling with position costs

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)