scientific article; zbMATH DE number 724323
From MaRDI portal
Publication:4323632
Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Deterministic scheduling theory in operations research (90B35) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- scientific article; zbMATH DE number 2114378
- scientific article; zbMATH DE number 3882159
- scientific article; zbMATH DE number 830382
- scientific article; zbMATH DE number 1634827
- scientific article; zbMATH DE number 3873052
- scientific article; zbMATH DE number 782644
- Scheduling
- scientific article; zbMATH DE number 41713
- scientific article; zbMATH DE number 108110
- Optimal scheduling combinatorics
Cited in
(62)- The job shop scheduling problem: Conventional and new solution techniques
- Batch scheduling with deadlines on parallel machines
- Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method
- Two-machine shop scheduling with zero and unit processing times
- Resource-constrained project scheduling: A survey of recent developments.
- A concise survey of scheduling with time-dependent processing times
- Scheduling on uniform parallel machines to minimize maximum lateness
- A survey of the state-of-the-art of common due date assignment and scheduling research
- Single machine scheduling with a generalized job-dependent cumulative effect
- Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors
- Complexity results for parallel machine problems with a single server
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine
- Makespan minimization on uniform parallel machines with release times
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs
- Integer preemptive scheduling on parallel machines
- Minimizing functions of infeasibilities in a two-machine flow shop
- Scheduling periodic I/O access with bi-colored chains: models and algorithms
- Metric interpolation for the problem of minimizing the maximum lateness for a single machine
- An exact algorithm for the preemptive single machine scheduling of equal-length jobs
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Scheduling jobs with a V-shaped time-dependent processing time
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines
- Measures of problem uncertainty for scheduling with interval processing times
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences
- Vyacheslav Tanaev: contributions to scheduling and related areas
- Routing equal-size messages on a slotted ring
- New bounds and algorithms for the transshipment yard scheduling problem
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- Approximating schedules
- Single machine preemptive scheduling to minimize the weighted number of late jobs with deadlines and nested release/due date intervals
- Batch scheduling with deadlines on parallel machines: an NP-hard case
- Planning computations in a multiprocessor system with unfixed parameters
- Scheduling deteriorating jobs with availability constraints to minimize the makespan
- scientific article; zbMATH DE number 3882159 (Why is no real title available?)
- Integrality Property in Preemptive Parallel Machine Scheduling
- A new polynomial algorithm for a parallel identical scheduling problem
- scientific article; zbMATH DE number 41713 (Why is no real title available?)
- scientific article; zbMATH DE number 67596 (Why is no real title available?)
- Preemptive scheduling of two uniform parallel machines to minimize total tardiness
- scientific article; zbMATH DE number 2114378 (Why is no real title available?)
- scientific article; zbMATH DE number 782644 (Why is no real title available?)
- single Machine Preemptive Scheduling With Special Cost Functions1
- Optimal correction of execution intervals for multiprocessor scheduling with additional resource
- Scheduling linearly shortening jobs under precedence constraints
- Scheduling
- Scheduling dedicated jobs with variative processing times
- A historical note on the complexity of scheduling problems
- Application of the interpolation approach for approximating single-machine scheduling problem with an unknown objective function
- Properties of optimal schedules in preemptive shop scheduling
- Theory and methodology of time-dependent scheduling: past, present and future
- Optimal composition ordering problems for piecewise linear functions
- Composition orderings for linear functions and matrix multiplication orderings
- Knapsack problems with monotonically non-decreasing variable weights (profits) of items
- A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation
- Pre-emptive scheduling problems with controllable processing times
- Scientific school of Academician V. S. Tanaev: results on the scheduling theory
- Batching and scheduling in a multi-machine flow shop
- Scheduling time-dependent jobs under mixed deterioration
- Parallel machine scheduling problems with a single server
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4323632)
