Scheduling algorithms - MaRDI portal

Publication date 20 August 2001

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Combinatorial optimization (90C27) Dynamic programming (90C39) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

scientific article; zbMATH DE number 830382
Scheduling algorithms
Scheduling algorithms.
Scheduling algorithms.
Scheduling. Theory, algorithms, and systems
Scheduling. Theory, algorithms, and systems
scientific article; zbMATH DE number 2099400
scientific article; zbMATH DE number 16428
Scheduling algorithms for procrastinators
On synthesis of scheduling algorithms

Cited in

(only showing first 100 items - show all)

Computational complexity of some scheduling problems with multiprocessor tasks
The one machine scheduling problem: insertion of a job under the real-time constraint
An iterative algorithm for scheduling UET tasks with due dates and release times.
A note on scheduling multiprocessor tasks with identical processing times.
How useful are preemptive schedules?
On the single machine serial batching scheduling problem to minimize total completion time with precedence constraints, release dates and identical processing times.
Scheduling the two-way traffic on a single-track railway with a siding
An effective heuristic algorithm for the partial shop scheduling problem
Single machine scheduling with resource allocation and learning effect considering the rate-modifying activity
Bounded serial-batching scheduling for minimizing maximum lateness and makespan
Online scheduling of two job types on a set of multipurpose machines with unit processing times
Single machine preemptive scheduling with fixed jobs to minimize tardiness related criteria
A 6 5-approximation algorithm for the two-machine routing open-shop problem on a two-node network
Scheduling a single machine to minimize a regular objective function under setup constraints
A note on the single machine serial batching scheduling problem to minimize maximum lateness with identical processing times
Efficient algorithms for periodic scheduling
Scheduling policies using marked/phantom slot algorithms
Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance
Multipurpose machine scheduling with rejection and identical job processing times
Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times
Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
Study on proportionate flowshop scheduling with due-date assignment and position-dependent weights
A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system
On lower and upper bounds for single machine parallel batch scheduling
Scheduling lower bounds via AND subset sum
Single-machine multitasking scheduling with job efficiency promotion
Reliability aware scheduling of bag of real time tasks in cloud environment
Model predictive scheduling of semi-cyclic discrete-event systems using switching max-plus linear models and dynamic graphs
Improved algorithms for two-agent scheduling on an unbounded serial-batching machine
Some algorithms of solving minimax multiprocessor scheduling problem
Scheduling projects with multi-skilled personnel by a hybrid MILP/CP Benders decomposition algorithm
The worst-case analysis of the Garey-Johnson algorithm
Parallel-machine parallel-batching scheduling with family jobs and release dates to minimize makespan
Editorial. Special issue on algorithms for scheduling problems
Single-machine scheduling problems with precedence constraints and simple linear deterioration
Reduction method for concept lattices based on rough set theory and its application
Two-agent scheduling of time-dependent jobs
Single machine unbounded parallel-batch scheduling with forbidden intervals
A note on special optimal batching structures to minimize total weighted completion time
Application of an optimization problem in max-plus algebra to scheduling problems
Complexity of minimizing the total flow time with interval data and minmax regret criterion
Unrelated parallel-machine scheduling with position-dependent deteriorating jobs and resource-dependent processing time
Single-machine common flow allowance scheduling with job-dependent aging effects and a deteriorating maintenance activity
A memetic algorithm for the job-shop with time-lags
Multi-agent scheduling on a single machine with max-form criteria
Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint
A heuristic approach to minimize expected makespan in open shops subject to stochastic processing times and failures
Logistics scheduling with batching and transportation
On-line scheduling on a batch processing machine with unbounded batch size to minimize the makespan
Single machine scheduling with common due date and controllable processing times
The routing open-shop problem on a network: complexity and approximation
A \(\frac 54\)-approximation algorithm for scheduling identical malleable tasks
The minmax regret permutation flow-shop problem with two jobs
Complexity of two dual criteria scheduling problems
Online non-preemptive scheduling to optimize max stretch on a single machine
Minimizing lateness for precedence graphs with constant delays on dedicated pipelined processors
Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect
Hierarchical optimization with double due dates on an unbounded parallel-batching machine to minimize maximum lateness
Bicriteria scheduling on a series-batching machine to minimize maximum cost and makespan
Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
Basic scheduling problems with raw material constraints
Lower bound algorithms for multiprocessor task scheduling with ready times
Scheduling algorithms
Production and transport logistics scheduling with two transport mode choices
Single-machine scheduling with precedence constraints and position-dependent processing times
The inverse parallel machine scheduling problem with minimum total completion time
scientific article; zbMATH DE number 724323 (Why is no real title available?)
Comments on ``Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy chain networks
Scheduling algorithms.
Bicriteria scheduling for due date assignment with total weighted tardiness
Single machine bicriteria scheduling with equal-length jobs to minimize total weighted completion time and maximum cost
Single machine parallel batch scheduling subject to precedence constraints
Scheduling the production of rolling ingots: industrial context, model, and solution method
Scheduling algorithms.
scientific article; zbMATH DE number 830382 (Why is no real title available?)
Proportionate flowshop scheduling with position-dependent weights
Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation
Due-window assignment scheduling problems with position-dependent weights on a single machine
Flow shop resource allocation scheduling with due date assignment, learning effect and position-dependent weights
Two-directional traffic scheduling problem solution for a single-track railway with siding
Stackelberg scheduling strategies
Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning
Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
scientific article; zbMATH DE number 5039509 (Why is no real title available?)
Handbook on Scheduling
The unbounded single machine parallel batch scheduling problem with family jobs and release dates to minimize makespan
Scheduling of coupled tasks with unit processing times
Due date assignment single-machine scheduling with delivery times, position-dependent weights and deteriorating jobs
A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights
Single-machine Scheduling Problems with Aging/Deteriorating Effect under an Optional Maintenance Activity Consideration
Metrics in scheduling problems
A Production Plan Considering Parallel Machines and Deteriorating Effects: Minimizing the Makespan in the Section of Steel Box Girder Processing
Finding total unimodularity in optimization problems solved by linear programs
Non-clairvoyant scheduling games
A single machine group scheduling problem with due date assignment and position-dependent costs
Scheduling with job-dependent learning effects and multiple rate-modifying activities
Scheduling unit length jobs on parallel machines with lookahead information
Maximizing the number of rides served for time-limited Dial-a-Ride*
Scheduling and constraint propagation
On the open-shop problem with preemption and minimizing the average completion time

This page was built for publication: Scheduling algorithms

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