Parametric problem in scheduling theory

DOI10.1007/BF01075095zbMath0455.90047OpenAlexW1965903433MaRDI 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

zbMATH Keywords

algorithmjob sequencingsingle machinedeterministic schedulingpermutation flow-shopminimization of maximum completion timevariable processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (12)

Batch scheduling of step deteriorating jobs ⋮ An alternative approach for proving the NP-hardness of optimization problems ⋮ Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices ⋮ Scheduling jobs with a V-shaped time-dependent processing time ⋮ 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 ⋮ A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem ⋮ Optimal composition ordering problems for piecewise linear functions ⋮ 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 ⋮ Pareto and scalar bicriterion optimization in scheduling deteriorating jobs ⋮ Single-machine batch scheduling of linear deteriorating jobs

Cites Work

• Unnamed Item

This page was built for publication: Parametric problem in scheduling theory