scientific article; zbMATH DE number 3633982

zbMath0407.90025MaRDI QIDQ4194705

Publication date: 1977

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Bibliography Quadratic Assignment Problem Sequencing Travelling Salesman Problem Combinatorial Optimization Np-Completeness Implementation Study Vehicle Routing Branch and Bound Algorithms Acyclic Subgraph Problem Algorithmic Performance Computational Complexity and Efficiency Enumerative Methods Machine Scheduling Theory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Exact enumeration problems, generating functions (05A15) Deterministic scheduling theory in operations research (90B35) Specification and verification (program logics, model checking, etc.) (68Q60) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (64)

More facets from fences for linear ordering and acyclic subgraph polytopes ⋮ Some no-wait shops scheduling problems: Complexity aspect ⋮ A block approach for single-machine scheduling with release dates and due dates ⋮ Incorporating preference information into multi-objective scheduling ⋮ Unnamed Item ⋮ A tabu-search heuristic for the flexible-resource flow shop scheduling problem ⋮ Openshop and flowshop scheduling to minimize sum of completion times ⋮ Unnamed Item ⋮ An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal ⋮ Evolution based learning in a job shop scheduling environment ⋮ Scheduling jobs with release dates and tails on identical machines to minimize the makespan ⋮ Scheduling on machines with variable service rates ⋮ NP-hardness of shop-scheduling problems with three jobs ⋮ Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems ⋮ Approximating total flow time on parallel machines ⋮ A survey on the linear ordering problem for weighted or unweighted tournaments ⋮ An inexact algorithm for the sequential ordering problem ⋮ Reconstructing binary matrices with timetabling constraints ⋮ A new integer programming formulation for the permutation flowshop problem ⋮ An algorithm for single machine sequencing with release dates to minimize maximum cost ⋮ Order scheduling in an environment with dedicated resources in parallel ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ An adaptive branching rule for the permutation flow-shop problem ⋮ On the measurement of complexity in activity networks ⋮ Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach ⋮ How well can a graph be n-colored? ⋮ A branch and bound algorithm for the acyclic subgraph problem ⋮ Formulating the single machine sequencing problem with release dates as a mixed integer program ⋮ Minimizing mean flow time with release time constraint ⋮ Job oriented production scheduling ⋮ A state-of-the-art review of parallel-machine scheduling research ⋮ A multi-objective approach to resource allocation in single machine scheduling ⋮ A tabu search method guided by shifting bottleneck for the job shop scheduling problem ⋮ The complexity of shop-scheduling problems with two or three jobs ⋮ Stability of an optimal schedule ⋮ Optimality conditions to the acyclic travelling salesman problem. ⋮ Flow-shops with a dominant machine ⋮ An updated survey on the linear ordering problem for weighted or unweighted tournaments ⋮ A simulated annealing approach to minimize the maximum lateness on uniform parallel machines ⋮ Elimination conditions and lower bounds for the permutation flow-shop sequencing problem ⋮ Four solution techniques for a general one machine scheduling problem. A comparative study ⋮ The skeleton of the symmetric Traveling Salesman Polytope ⋮ On-line scheduling of parallel machines to minimize total completion times ⋮ Deterministic job-shop scheduling: Past, present and future ⋮ NP-Complete operations research problems and approximation algorithms ⋮ The job shop scheduling problem: Conventional and new solution techniques ⋮ A new heuristic algorithm solving the linear ordering problem ⋮ Scheduling multiprocessor tasks with chain constraints ⋮ A survey of scheduling with parallel batch (p-batch) processing ⋮ Scheduling on uniform parallel machines to minimize maximum lateness ⋮ Scheduling theory problems of type \(n|1|\sum c_i(t)\) ⋮ Structural scheduling in the problems of scheduling theory ⋮ A note on the influence of missing operations on scheduling problems ⋮ Effective optimization methods for single-machine scheduling (survey) ⋮ Scheduling orders for multiple product types with due date related objectives ⋮ The nonpermutation flowshop scheduling problem: adjustment and bounding procedures ⋮ Flowshop scheduling with identical jobs and uniform parallel machines ⋮ V-shop scheduling ⋮ An approximation algorithm for a single-machine scheduling problem with release times and delivery times ⋮ An exact algorithm for the general quadratic assignment problem ⋮ Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times ⋮ Mathematical programming formulations for machine scheduling: A survey ⋮ An algorithm for the traveling salesman problem with pickup and delivery customers ⋮ On local search for the generalized graph coloring problem

This page was built for publication: