Keywords
MathematicsMathematical optimizationLagrange multiplierTardinessUpper and lower boundsBranch and boundJob shop schedulingLagrangian relaxationDual (grammatical number)Multiplier (economics)Scheduling (production processes)LagrangianOptimization problemAlgorithmComputer scienceApplied mathematicsSchedule
Affiliated Institutions
Related Publications
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
The number of days required to clear a check drawn on a bank in city j depends on the city i in which the check is cashed. Thus, to maximize its available funds, a company that ...
An Algorithm for the Traveling Salesman Problem
A “branch and bound” algorithm is presented for solving the traveling salesman problem. The set of all tours (feasible solutions) is broken up into increasingly small subsets by...
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
We present an O(√nL)-iteration homogeneous and self-dual linear programming (LP) algorithm. The algorithm possesses the following features: • It solves the linear programming pr...
A multi-objective genetic local search algorithm and its application to flowshop scheduling
We propose a hybrid algorithm for finding a set of nondominated solutions of a multi objective optimization problem. In the proposed algorithm, a local search procedure is appli...
Multi-objective genetic local search algorithm
Proposes a hybrid algorithm for finding a set of non-dominated solutions of a multi-objective optimization problem. In the proposed algorithm, a local search procedure is applie...
Publication Info
- Year
- 1976
- Type
- article
- Volume
- 11
- Issue
- 1
- Pages
- 229-251
- Citations
- 272
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
272
OpenAlex
Cite This
Marshall L. Fisher
(1976).
A dual algorithm for the one-machine scheduling problem.
Mathematical Programming
, 11
(1)
, 229-251.
https://doi.org/10.1007/bf01580393
Identifiers
- DOI
- 10.1007/bf01580393