Parametric problem in scheduling theory

DOI10.1007/BF01075095MaRDI QIDQ3904366zbMATH OpenOpenAlexFDO

Authors 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

algorithmsingle machinejob sequencingdeterministic schedulingpermutation flow-shopminimization of maximum completion timevariable processing time

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cited in

(12)

• 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
• Pareto and scalar bicriterion optimization in scheduling deteriorating jobs
• 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
• Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan
• Single-machine batch scheduling of linear deteriorating jobs
• Optimal composition ordering problems for piecewise linear functions
• Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
• Batch scheduling of step deteriorating jobs
• An alternative approach for proving the NP-hardness of optimization problems
• ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3904366)