Preemptive scheduling with variable profile, precedence constraints and due dates

DOI10.1016/0166-218X(93)E0151-NMaRDI QIDQ1805445zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

maximum latenessmakespanprecedence constraintslatenessvariable profilelist scheduleearliest due datepriority schedulescheduling preemptive tasks

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

Cites work

• scientific article; zbMATH DE number 3780551 (Why is no real title available?)
• scientific article; zbMATH DE number 3561065 (Why is no real title available?)
• NP-complete scheduling problems
• Optimal Preemptive Scheduling on Two-Processor Systems
• Optimal scheduling for two-processor systems
• Preemptive Scheduling of Real-Time Tasks on Multiprocessor Systems
• Profile Scheduling of Opposing Forests and Level Orders
• Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
• Scheduling Flat Graphs
• Scheduling Independent Tasks with Deadlines on Semi-identical Processors
• Scheduling Opposing Forests
• Scheduling precedence graphs of bounded height
• Scheduling with deadlines and loss functions

Cited in

(18)

• Scheduling multiprocessor tasks with chain constraints
• Nearly on line scheduling of preemptive independent tasks
• Stochastic Scheduling with Variable Profile and Precedence Constraints
• Two-machine flow shops with limited machine availability
• Scheduling multiprocessor tasks on parallel processors with limited availability.
• Non-preemptive profile scheduling and quasi-interval orders
• Scheduling two-stage hybrid flow shop with availability constraints
• Parallel machine makespan minimization subject to machine availability and total completion time constraints
• Approximate Deadline-Scheduling with Precedence Constraints
• Scheduling with limited machine availability
• Total completion time minimization on multiple machines subject to machine availability and makespan constraints
• Dynamic scheduling of parallel computations
• PREEMPTIVE SCHEDULING ON PARALLEL PROCESSORS WITH DUE DATES
• Scheduling jobs in open shops with limited machine availability
• Linear and quadratic algorithms for scheduling chains and opposite chains
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
• Online scheduling on semi-related machines
• Bicriteria scheduling concerned with makespan and total completion time subject to machine availability 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)