On-line production order scheduling with preemption penalties

DOI10.1007/S10878-006-9027-3MaRDI QIDQ2385487zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 12 October 2007

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-006-9027-3

zbMATH Keywords

Competitive ratioOn-line schedulingCompetitive strategyPreemption penalty

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35)

Recommendations

• On Job Scheduling with Preemption Penalties
• Algorithmic Applications in Management
• Online scheduling with preemption or non-completion penalties
• Lower bounds on online deadline scheduling with preemption penalties
• Online Preemptive Scheduling with Immediate Decision or Notification and Penalties

Cites work

• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• A Near Optimal Scheduler for On-Demand Data Broadcasts
• A tighter extra-resource analysis of online deadline scheduling
• Asymptotic Performance Ratio of an Online Algorithm for the Single Machine Scheduling With Release Dates
• Automata, Languages and Programming
• Computing and Combinatorics
• Improved On-Line Broadcast Scheduling with Deadlines
• Minimizing total completion time subject to job release dates and preemption penalties
• On-line scheduling of jobs with fixed start and end times
• On-line scheduling on a single machine: Maximizing the number of early jobs
• Scheduling broadcasts with deadlines
• The power of \(\alpha\)-points in preemptive single machine scheduling.
• Theoretical Computer Science

Cited in

(6)

• Online production planning to maximize the number of on-time orders
• Algorithmic Applications in Management
• An Optimal Strategy for Online Non-uniform Length Order Scheduling
• Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting
• Lower bounds on online deadline scheduling with preemption penalties
• On Job Scheduling with Preemption Penalties

This page was built for publication: On-line production order scheduling with preemption penalties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385487)