scientific article; zbMATH DE number 782644
From MaRDI portal
Publication:4841579
zbMath0925.90224MaRDI QIDQ4841579
Vyacheslav Tanaev, Yuri N. Sotskov, Vitaly A. Strusevich
Publication date: 8 August 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem ⋮ The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems ⋮ NP-hardness of shop-scheduling problems with three jobs ⋮ A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time ⋮ A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem ⋮ Stability of a schedule minimizing mean flow time ⋮ Measures of problem uncertainty for scheduling with interval processing times ⋮ Optimal makespan scheduling with given bounds of processing times ⋮ Is a unit-job shop not easier than identical parallel machines? ⋮ A makespan-optimal schedule for processing jobs with possible operation preemptions as an optimal mixed graph coloring ⋮ A neural network algorithm for servicing jobs with sequential and parallel machines ⋮ Scientific school of Academician V. S. Tanaev: results on the scheduling theory ⋮ Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity ⋮ A historical note on the complexity of scheduling problems ⋮ Resource-constrained project scheduling: A survey of recent developments. ⋮ Vyacheslav Tanaev: contributions to scheduling and related areas ⋮ Minimizing functions of infeasibilities in a two-machine flow shop ⋮ Batching and scheduling in a multi-machine flow shop ⋮ The museum visitor routing problem ⋮ Solving a bicriteria scheduling problem on unrelated parallel machines occurring in the glass bottle industry ⋮ A discrete artificial bee colony algorithm for the no-idle permutation flowshop scheduling problem with the total tardiness criterion ⋮ Some concepts of stability analysis in combinatorial optimization ⋮ An iterative improvement approach for the nonpreemptive open shop scheduling problem ⋮ On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion ⋮ Open-shop scheduling for unit jobs under precedence constraints ⋮ Scheduling of a single crane in batch annealing process ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ The flow shop problem with no-idle constraints: a review and approximation ⋮ Metric interpolation for the problem of minimizing the maximum lateness for a single machine ⋮ Algorithms of distributed task allocation for cooperative agents ⋮ A hybrid genetic algorithm for the open shop scheduling problem ⋮ Two-machine shop scheduling with zero and unit processing times ⋮ Flowshop scheduling research after five decades ⋮ A survey of the state-of-the-art of common due date assignment and scheduling research ⋮ The total completion time open shop scheduling problem with a given sequence of jobs on one machine ⋮ Nonpreemptive flowshop scheduling with machine dominance ⋮ Handling flexibility in a ``generalised job shop with a fuzzy approach
