scientific article; zbMATH DE number 3648418

MaRDI QIDQ3206647zbMATH OpenFDO

Authors Eugene L. Lawler

Publication date 1979

zbMATH Keywords

assembly line balancingcomputational complexitycomputer implementationdata structuresdynamic programmingefficiency improvementlinear arrangementprecedence constraintssingle-machine sequencingsparse networkstraveling salesman problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Cited in

(32)

• A compact labelling scheme for series-parallel graphs
• An algorithm to generate the ideals of a partial order
• Dynamic programming and decomposition approaches for the single machine total tardiness problem
• On estimating the number of order ideals in partial orders, with some applications
• A survey of algorithms for the single machine total weighted tardiness scheduling problem
• Balancing U-lines in a multiple U-line facility
• Gray codes from antimatroids
• Minimizing the weighted sum of squared tardiness on a single machine
• Branch less, cut more and minimize the number of late equal-length jobs on identical machines
• Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
• On the problem of sequential traversal of megalopolises with precedence conditions and cost functions depending on a list of tasks
• Minimizing the weighted number of tardy jobs on multiple machines: a review
• Empirical working time distribution-based line balancing with integrated simulated annealing and dynamic programming
• State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
• 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
• Efficient generation of the ideals of a poset in Gray code order. II
• Solving a routing problem with the aid of an independent computations scheme
• Optimization of the start point in the GTSP with the precedence conditions
• On routing problem with starting point optimization
• Optimal routing in problemsof sequential traversal of megapolises in the presence of constraints
• One task of routing jobs in high radiation conditions
• 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
• A dynamic program with fathoming and dynamic upper bounds for the assembly line balancing problem
• Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
• 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
• Comparing efficiencies of genetic crossover operators for one machine total weighted tardiness problem
• Efficient generation of the ideals of a poset in Gray code order

This page was built for publication:

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