Scheduling algorithms
From MaRDI portal
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
Cited in
(only showing first 100 items - show all)- Johnson's rule, composite jobs and the relocation problem
- Computing lower and upper bounds for a large-scale industrial job shop scheduling problem
- Conjugate problems in time-dependent scheduling
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems
- An adaptive large neighborhood search for the full truckload pickup and delivery problem with resource synchronization
- Designing and constructing networks under uncertainty in the construction stage: definition and exact algorithmic approach
- Robust scheduling to minimize the weighted number of late jobs with interval due-date uncertainty
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacities
- A batch-oblivious approach for complex job-shop scheduling problems
- Scheduling performance evaluation of logistics service supply chain based on the dynamic index weight
- Surgery sequencing to minimize the expected maximum waiting time of emergent patients
- A branch, bound, and remember algorithm for the simple disassembly line balancing problem
- A study on the enhanced best performance algorithm for the just-in-time scheduling problem
- Using high performance computing for unrelated parallel machine scheduling with sequence-dependent setup times: development and computational evaluation of a parallel branch-and-price algorithm
- Exact exponential algorithms for 3-machine flowshop scheduling problems
- Heuristics for periodical batch job scheduling in a MapReduce computing framework
- Shortest path algorithms for functional environments
- Parallel batch scheduling with inclusive processing set restrictions and non-identical capacities to minimize makespan
- A Benders decomposition-based heuristic for a production and outbound distribution scheduling problem with strict delivery constraints
- Preemptive models of scheduling with controllable processing times and of scheduling with imprecise computation: a review of solution approaches
- MuRoCo: a framework for capability- and situation-aware coalition formation in cooperative multi-robot systems
- Scheduling on parallel machines with preemption and transportation delays
- Valid inequalities for a time-indexed formulation
- Approximability of total weighted completion time with resource consuming jobs
- Permutation schedules for a two-machine flow shop with storage
- Scheduling in multiprocessor systems with additional restrictions
- Efficient algorithms for periodic scheduling
- Scheduling policies using marked/phantom slot algorithms
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- A three-stage optimization algorithm for the stochastic parallel machine scheduling problem with adjustable production rates
- Flow shop for dual CPUs in dynamic voltage scaling
- An exact branch-and-price algorithm for scheduling rescue units during disaster response
- Literature review on multi-appointment scheduling problems in hospitals
- Multitasking scheduling problems with deterioration effect
- Two-agent single-machine scheduling with cumulative deterioration
- Robust algorithms for total completion time
- Single-machine scheduling with positional due indices and positional deadlines
- Some algorithms for analysis and synthesis of real-time multiprocessor computing systems
- A combinatorial analysis of the permutation and non-permutation flow shop scheduling problems
- Ideal schedules in parallel machine settings
- Exact lexicographic scheduling and approximate rescheduling
- Multistage stochastic programming approach for joint optimization of job scheduling and material ordering under endogenous uncertainties
- Single-machine scheduling with release times, deadlines, setup times, and rejection
- Revisit of the scheduling problems with integrated production and delivery on parallel batching machines
- A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing
- Scheduling periodic I/O access with bi-colored chains: models and algorithms
- Due date assignment scheduling with positional-dependent weights and proportional setup times
- Online algorithms to schedule a proportionate flexible flow shop of batching machines
- Moderate exponential-time algorithms for scheduling problems
- 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem
- Distribution of a heterogeneous set of resources in multiprocessor scheduling
- Using solvable real time classes for jitter-minimized planning
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times
- Scheduling with complete multipartite incompatibility graph on parallel machines: complexity and algorithms
- Scheduling problems with controllable processing times and a common deadline to minimize maximum compression cost
- An application of dynamic programming to assign pressing tanks at wineries
- Scheduling jobs with sizes and delivery times on identical parallel batch machines
- A fast algorithm for multiprocessor speed-scaling problem minimizing completion time and energy consumption
- A 5-parameter complexity classification of the two-stage flow shop scheduling problem with job dependent storage requirements
- Aggregation in job scheduling in machine works
- A solution approach to find the critical path in a time-constrained activity network
- Flow shop scheduling problem with position-dependent processing times
- Approximation algorithms for the three-machine proportionate mixed shop scheduling
- Multistage interval scheduling games
- Risk-averse single machine scheduling: complexity and approximation
- Robust min-max regret scheduling to minimize the weighted number of late jobs with interval processing times
- Synthesizing a multiprocessor system for scheduling with interruptions and execution intervals
- Shop scheduling problems with pliable jobs
- Parallel execution of schedules with random dependency graph
- Single parameter analysis of power of preemption on two and three uniform machines
- Single-machine batch scheduling with job processing time compatibility
- Parallel batch scheduling with nested processing set restrictions
- Robust scheduling with budgeted uncertainty
- Schedules with a single preemption on uniform parallel machines
- Scheduling jobs on parallel machines to minimize a regular step total cost function
- Unbounded parallel-batching scheduling with two competitive agents
- Pareto optimization of rescheduling with release dates to minimize makespan and total sequence disruption
- Bounded parallel-batching scheduling with two competing agents
- Single machine scheduling with delivery dates and cumulative payoffs
- Unrelated parallel-machine scheduling with deteriorating maintenance activities to minimize the total completion time
- Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
- Pareto optimization scheduling of family jobs on a p-batch machine to minimize makespan and maximum lateness
- Improved algorithms for single-machine common due window assignment and scheduling with batch deliveries
- Robust single machine makespan scheduling with release date uncertainty
- No-idle parallel-machine scheduling of unit-time jobs with a small number of distinct release dates and deadlines
- An exact framework for the discrete parallel machine scheduling location problem
- The pairwise flowtime network construction problem
- Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations
- Bicriteria scheduling on an unbounded parallel-batch machine for minimizing makespan and maximum cost
- Pareto optimal algorithms for minimizing total (weighted) completion time and maximum cost on a single machine
- Scheduling uniform machines with restricted assignment
- Faster algorithms for bicriteria scheduling of identical jobs on uniform machines
- Efficient algorithms for scheduling equal-length jobs with processing set restrictions on uniform parallel batch machines
- scientific article; zbMATH DE number 1634827 (Why is no real title available?)
- Unrelated parallel-machine scheduling with controllable processing times and impact of deteriorating maintenance activities under consideration
- Flow Shop for Dual CPUs in Dynamic Voltage Scaling
- Single machine scheduling problems with uncertain parameters and the OWA criterion
- Online optimization of busy time on parallel machines. (Extended abstract)
- Optimal allocation for chunked-reward advertising
- Power of preemption for minimizing total completion time on uniform parallel machines
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 Q3425131)
