Parametric problem in scheduling theory
From MaRDI portal
Publication:3904366
DOI10.1007/BF01075095zbMath0455.90047MaRDI QIDQ3904366
O. I. Mel'Nikov, Ya. M. Shafransky
Publication date: 1979
Published in: Cybernetics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01075095
algorithm; job sequencing; single machine; deterministic scheduling; permutation flow-shop; minimization of maximum completion time; variable processing time
90B35: Deterministic scheduling theory in operations research
Related Items
An alternative approach for proving the NP-hardness of optimization problems, Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan, Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness, Optimal composition ordering problems for piecewise linear functions, Batch scheduling of step deteriorating jobs, Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices, Scheduling jobs with a V-shaped time-dependent processing time, A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem, ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost, A review of four decades of time-dependent scheduling: main results, new topics, and open problems, Single-machine batch scheduling of linear deteriorating jobs, Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
Cites Work
