scientific article; zbMATH DE number 3850790

zbMATH Open0535.90030MaRDI QIDQ3320091FDOQ3320091

Authors: Konrad Boenchendorf 

Publication date: 1982

Title of this publication is not available (Why is that?)

Recommendations

• Mean flow time minimization with given bounds of processing times
• Publication:3481475
• Flowshop sequencing with mean flowtime objective
• A greedy heuristic for the mean tardiness sequencing problem
• Hybrid optimization methods for time-dependent sequencing problems
• Solution of the Liu-Layland problem via bottleneck just-in-time sequencing
• Special class of flowshop sequencing problems
• Reoptimization of the minimum total flow-time scheduling problem
• A survey of results for sequencing problems with controllable processing times
• Minimizing mean flow time with parallel processors and resource constraints

zbMATH Keywords

combinatorial optimizationheuristiccomputational experimentssingle machinepolynomial-time algorithmsprecedence constraintsdeterministic sequencing

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Dynamic programming (90C39) Integer programming (90C10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Cited In (22)

• Title not available (Why is that?)
• A branch and bound algorithm for minimizing weighted completion times with deadlines
• A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments
• A benchmark library and a comparison of heuristic methods for the linear ordering problem
• A Sequencing Problem with Release Dates and Clustered Jobs
• Optimal Sequencing Via Modular Decomposition: Characterization of Sequencing Functions
• Minimizing flowtime and missed due-dates in single-machine sequencing
• Title not available (Why is that?)
• New semidefinite programming relaxations for the linear ordering and the traveling salesman problem
• Title not available (Why is that?)
• A semidefinite optimization approach to the target visitation problem
• Semidefinite relaxations of ordering problems
• The weighted fair sequences problem
• Title not available (Why is that?)
• The schedule-sequencing problem
• Title not available (Why is that?)
• An iterative exact algorithm for the weighted fair sequences problem
• A note on a proof of SPT optimality for single-machine sequencing problems via the transportation problem
• Title not available (Why is that?)
• A survey on the linear ordering problem for weighted or unweighted tournaments
• Title not available (Why is that?)
• A sequencing problem in the weaving industry

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 Q3320091)