scientific article
From MaRDI portal
Publication:3206647
zbMath0416.90036MaRDI QIDQ3206647
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitydynamic programmingdata structurestraveling salesman problemprecedence constraintsassembly line balancingsparse networksefficiency improvementcomputer implementationlinear arrangementsingle-machine sequencing
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39)
Related Items (32)
Minimizing the weighted number of tardy jobs on multiple machines: a review ⋮ A compact labelling scheme for series-parallel graphs ⋮ Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints ⋮ An algorithm to generate the ideals of a partial order ⋮ Dynamic programming and decomposition approaches for the single machine total tardiness problem ⋮ One task of routing jobs in high radiation conditions ⋮ Efficient generation of the ideals of a poset in Gray code order. II ⋮ Branch less, cut more and minimize the number of late equal-length jobs on identical machines ⋮ Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming ⋮ Two-stage dynamic programming in the routing problem with decomposition ⋮ On the Application of the Minimax Traveling Salesman Problem in Aviation Logistics ⋮ A bottleneck routing problem with a system of priority tasks ⋮ On the complexity of dynamic programming for sequencing problems with precedence constraints ⋮ The routing problems with optimization of the starting point: dynamic programming ⋮ Level schedules for mixed-model JIT production lines: characteristics of the largest instances that can be solved optimally ⋮ Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem ⋮ Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization ⋮ Minimizing the weighted sum of squared tardiness on a single machine ⋮ On estimating the number of order ideals in partial orders, with some applications ⋮ A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem ⋮ Efficient generation of the ideals of a poset in Gray code order ⋮ Solving a Routing Problem with the Aid of an Independent Computations Scheme ⋮ Оptimization of the Start Point in the Gtsp with the Precedence Conditions ⋮ A survey of algorithms for the single machine total weighted tardiness scheduling problem ⋮ ON ROUTING PROBLEM WITH STARTING POINT OPTIMIZATION ⋮ On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks ⋮ A General Framework for Stochastic One-machine Scheduling Problems with Zero Release Times and No Partial Ordering ⋮ A Note on One-Machine Scheduling Problems with Imperfect Information ⋮ Balancing \(U\)-lines in a multiple \(U\)-line facility ⋮ State-of-the-art exact and heuristic solution procedures for simple assembly line balancing ⋮ Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin–Marsten bounding ⋮ Gray codes from antimatroids
This page was built for publication:
