Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
From MaRDI portal
Publication:2030503
Recommendations
- Preemptive scheduling with two minimax criteria
- Properties of optimal schedules for the minimization total weighted completion time in preemptive equal-length job with release dates scheduling problem on a single machine
- Minimizing total completion time for preemptive scheduling with release dates and deadline constraints
- New complexity results for parallel identical machine scheduling problems with preemption, release dates and regular criteria
- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
Cites work
- A note on Pareto minimizing total completion time and maximum cost
- A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
- A single-machine problem with multiple criteria
- An algorithm for minimizing flow time and maximum earliness on a single machine
- Bi-criteria Pareto-scheduling on a single machine with due indices and precedence constraints
- Centralized Wireless Data Networks With User Arrivals and Departures
- Complexity of single machine, multi-criteria scheduling problems
- Complexity of two dual criteria scheduling problems
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3883931 (Why is no real title available?)
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 2109192 (Why is no real title available?)
- Hybrid algorithm for sequencing with bicriteria
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Minimizing Mean Flow Time With Release Time and Deadline Constraints
- Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
- Multiagent scheduling. Models and algorithms
- Multicriteria scheduling
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- One machine sequencing to minimize mean flow time with minimum number tardy
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Preemptive scheduling with two minimax criteria
- Scheduling Problems with Two Competing Agents
- Scheduling with Multiple Performance Measures: The One-Machine Case
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- Single Machine Scheduling and Selection to Minimize Total Flow Time with Minimum Number Tardy
- Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
- Solving a bicriterion scheduling problem
- SRPT applied to bandwidth-sharing networks
- Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
Cited in
(6)- On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
- On the intractability of preemptive single-machine job scheduling with release times, deadlines, and family setup times
- Assembly flowshop scheduling problem: speed-up procedure and computational evaluation
- Single machine scheduling with release dates: a distributionally robust approach
- A local search enhanced logic-based benders decomposition approach for order acceptance and scheduling problem with preemption
- Minimizing the sojourn time of open shop scheduling problems with unit-time operations
This page was built for publication: Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2030503)
