Preemptive scheduling with variable profile, precedence constraints and due dates
From MaRDI portal
Publication:1805445
DOI10.1016/0166-218X(93)E0151-NzbMATH Open0833.90071OpenAlexW2004430504MaRDI QIDQ1805445FDOQ1805445
Authors: Zhen Liu, Eric Sanlaville 
Publication date: 18 March 1996
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(93)e0151-n
Recommendations
- Scheduling with AND/OR Precedence Constraints
- Stochastic Scheduling with Variable Profile and Precedence Constraints
- Approximate Deadline-Scheduling with Precedence Constraints
- Pre-emptive scheduling problems with controllable processing times
- Scheduling Tasks with AND/OR Precedence Constraints
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
- Scheduling malleable tasks with precedence constraints
- Scheduling of tasks with effectiveness precedence constraints
- Precedence-constrained scheduling of malleable jobs with preemption
- Task scheduling with precedence constraints to minimize the total completion time
maximum latenessmakespanprecedence constraintslatenessvariable profilelist scheduleearliest due datepriority schedulescheduling preemptive tasks
Cites Work
- Optimal scheduling for two-processor systems
- Scheduling with deadlines and loss functions
- Title not available (Why is that?)
- NP-complete scheduling problems
- Optimal Preemptive Scheduling on Two-Processor Systems
- Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
- Title not available (Why is that?)
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- Scheduling Opposing Forests
- Scheduling Independent Tasks with Deadlines on Semi-identical Processors
- Profile Scheduling of Opposing Forests and Level Orders
- Scheduling precedence graphs of bounded height
- Scheduling Flat Graphs
Cited In (18)
- Online scheduling on semi-related machines
- Scheduling two-stage hybrid flow shop with availability constraints
- Linear and quadratic algorithms for scheduling chains and opposite chains
- Non-preemptive profile scheduling and quasi-interval orders
- A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
- Total completion time minimization on multiple machines subject to machine availability and makespan constraints
- Nearly on line scheduling of preemptive independent tasks
- Scheduling multiprocessor tasks on parallel processors with limited availability.
- Scheduling jobs in open shops with limited machine availability
- Approximate Deadline-Scheduling with Precedence Constraints
- Scheduling multiprocessor tasks with chain constraints
- Stochastic Scheduling with Variable Profile and Precedence Constraints
- Bicriteria scheduling concerned with makespan and total completion time subject to machine availability constraints
- Scheduling with limited machine availability
- Dynamic scheduling of parallel computations
- Two-machine flow shops with limited machine availability
- PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
- Parallel machine makespan minimization subject to machine availability and total completion time constraints
This page was built for publication: Preemptive scheduling with variable profile, precedence constraints and due dates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1805445)
