scientific article; zbMATH DE number 724323

No author found.

Publication date: 19 February 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

single machine polynomial algorithms parallel machine scheduling

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

Makespan minimization on uniform parallel machines with release times, Batch scheduling with deadlines on parallel machines: an NP-hard case, Planning computations in a multiprocessor system with unfixed parameters, 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, Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs, 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, Measures of problem uncertainty for scheduling with interval processing times, Pre-emptive scheduling problems with controllable processing times, New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems, Scientific school of Academician V. S. Tanaev: results on the scheduling theory, Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan, Integer preemptive scheduling on parallel machines, Properties of optimal schedules in preemptive shop scheduling, 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, Resource-constrained project scheduling: A survey of recent developments., Single machine scheduling with a generalized job-dependent cumulative effect, A concise survey of scheduling with time-dependent processing times, A new polynomial algorithm for a parallel identical scheduling problem, 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, Computation scheduling in multiprocessor systems with several types of additional resources and arbitrary processors, Preemptive scheduling of two uniform parallel machines to minimize total tardiness, Scheduling jobs with a V-shaped time-dependent processing time, single Machine Preemptive Scheduling With Special Cost Functions¹, Minimizing functions of infeasibilities in a two-machine flow shop, Optimal correction of execution intervals for multiprocessor scheduling with additional resource, Batching and scheduling in a multi-machine flow shop, Scheduling time-dependent jobs under mixed deterioration, Single Machine Preemptive Scheduling to Minimize the Weighted Number of Late Jobs with Deadlines and Nested Release/Due Date Intervals, Parallel machine scheduling problems with a single server, Scheduling linearly shortening jobs under precedence constraints, Optimal composition ordering problems for piecewise linear functions, Scheduling dedicated jobs with variative processing times, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, The job shop scheduling problem: Conventional and new solution techniques, Integrality Property in Preemptive Parallel Machine Scheduling, Batch scheduling with deadlines on parallel machines, 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, Single-machine batch scheduling to minimize the total setup cost in the presence of deadlines, Scheduling on uniform parallel machines to minimize maximum lateness, Scheduling a single machine to minimize earliness penalties subject to the SLK due-date determination method, Pareto and scalar bicriterion optimization in scheduling deteriorating jobs, Two-machine shop scheduling with zero and unit processing times, Complexity results for parallel machine problems with a single server, A survey of the state-of-the-art of common due date assignment and scheduling research, Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine