Note—Operations Sequencing in Discrete Parts Manufacturing

DOI10.1287/MNSC.35.2.249zbMath0666.90041OpenAlexW2075193362MaRDI QIDQ3818791

Jonathan F. Bard, Thomas A. Feo

Publication date: 1989

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.35.2.249

zbMATH Keywords

Lagrangian relaxationbranch and boundsequencinggreedy heuristicbipartite networkmax-flow algorithmcomputer-aided process planningcutting operations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Production models (90B30) Deterministic network models in operations research (90B10)

Related Items (10)

Packing items to feed assembly lines ⋮ A probabilistic heuristic for a computationally difficult set covering problem ⋮ Metaheuristics: A bibliography ⋮ A hybrid heuristic approach to minimize number of tardy jobs in group technology systems ⋮ A GRASP for a difficult single machine scheduling problem ⋮ Cost reduction through operations reversal ⋮ Single machine scheduling with flow time and earliness penalties ⋮ Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP ⋮ Greedy randomized adaptive search procedures ⋮ A grasp for single machine scheduling with sequence dependent setup costs and linear delay penalties

This page was built for publication: Note—Operations Sequencing in Discrete Parts Manufacturing