Suchergebnisse - "Programming: Integer: Algorithms: Branch and Bound"

Heuristics for Multilevel Lot-Sizing with a Bottleneck

Autoren: Billington, Peter J. McClain, John O. Thomas, L. Joseph

Quelle: Management Science, 1986 Aug 01. 32(8), 989-1006.

Zugangs-URL: https://www.jstor.org/stable/2631663

Minimizing Mean Squared Deviation of Completion Times about a Common Due Date

Autoren: Bagchi, Uttarayan Sullivan, Robert S. Chang, Yih-Long

Quelle: Management Science, 1987 Jul 01. 33(7), 894-906.

Zugangs-URL: https://www.jstor.org/stable/2632140

Branch and Bound Experiments in Convex Nonlinear Integer Programming

Autoren: Gupta, Omprakash K. Ravindran, A.

Quelle: Management Science, 1985 Dec 01. 31(12), 1533-1546.

Zugangs-URL: https://www.jstor.org/stable/2631793

On the Single Machine Scheduling Problem with Quadratic Penalty Function of Completion Times: An Improved Branching Procedure

Autoren: Gupta, Sushil K. Sen, Tapan

Quelle: Management Science, 1984 May 01. 30(5), 644-647.

Zugangs-URL: https://www.jstor.org/stable/2631379

Multi-Activity Facility Design and Location Problems

Autoren: Akinc, Umit

Quelle: Management Science, 1985 Mar 01. 31(3), 275-283.

Zugangs-URL: https://www.jstor.org/stable/2631484

A Dual-Based Procedure for Dynamic Facility Location

Autoren: Van Roy, Tony J. Erlenkotter, Donald

Quelle: Management Science, 1982 Oct 01. 28(10), 1091-1105.

Zugangs-URL: https://www.jstor.org/stable/2630939

Assembly Line Balancing with Processing Alternatives: An Application

Autoren: Pinto, Peter A. Dannenbring, David G. Khumawala, Basheer M.

Quelle: Management Science, 1983 Jul 01. 29(7), 817-830.

Zugangs-URL: https://www.jstor.org/stable/2630971

A Node Elimination Procedure for Townsend's Algorithm for Solving the Single Machine Quadratic Penalty Function Scheduling Problem

Autoren: Bagga, P. C. Karlra, K. R.

Quelle: Management Science, 1980 Jun 01. 26(6), 633-636.

Zugangs-URL: https://www.jstor.org/stable/2630289

A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints

Autoren: Weiss, Howard J.

Quelle: Management Science, 1981 Oct 01. 27(10), 1209-1216.

Zugangs-URL: https://www.jstor.org/stable/2631088

A Branch and Bound Algorithm for the List Selection Problem in Direct Mail Advertising

Autoren: Dwyer, F. Robert Evans, James R.

Quelle: Management Science, 1981 Jun 01. 27(6), 658-667.

Zugangs-URL: https://www.jstor.org/stable/2631154

A Branch and Bound Algorithm for the List Selection Problem in Direct Mail Advertising

Autoren: F. Robert Dwyer James R. Evans

Quelle: Management Science. 27:658-667

Schlagwörter: 0211 other engineering and technologies, 02 engineering and technology, advertising/promotion, industries: retail, programming: integer algorithms, branch and bound [marketing]

Zugangs-URL: https://econpapers.repec.org/article/inmormnsc/v_3a27_3ay_3a1981_3ai_3a6_3ap_3a658-667.htm
https://ideas.repec.org/a/inm/ormnsc/v27y1981i6p658-667.html
https://pubsonline.informs.org/doi/abs/10.1287/mnsc.27.6.658
https://dl.acm.org/doi/10.5555/2938379.2938383
https://www.jstor.org/stable/pdfplus/2631154.pdf

A Dual-Based Procedure for Dynamic Facility Location: A dual-based procedure for dynamic facility location

Autoren: Tony J. Van Roy Donald Erlenkotter

Quelle: Management Science. 28:1091-1105

Schlagwörter: logistics, time-staged establishment of facilities, 0211 other engineering and technologies, computational tests, minimization of total discounted costs, Integer programming, Inventory, storage, reservoirs, 02 engineering and technology, opening of new facilities, location, programming: integer algorithms, branch and bound, programming: integer algorithms, test [facilities/equipment planning], dual ascent method, Applications of mathematical programming, closing of existing facilities, combinatorial optimization, branch-and-bound procedure, dynamic facility location

Dateibeschreibung: application/xml

Zugangs-URL: http://pure.iiasa.ac.at/id/eprint/1438/1/WP-80-031.pdf
https://www.jstor.org/stable/2630939
http://pure.iiasa.ac.at/id/eprint/1438/
https://EconPapers.repec.org/RePEc:inm:ormnsc:v:28:y:1982:i:10:p:1091-1105
https://dial.uclouvain.be/pr/boreal/object/boreal:57765
https://ideas.repec.org/a/inm/ormnsc/v28y1982i10p1091-1105.html
https://pubsonline.informs.org/doi/abs/10.1287/mnsc.28.10.1091

Minimizing Mean Squared Deviation of Completion Times About a Common Due Date: Minimizing mean squared deviation of completion times about a common due date

Autoren: Uttarayan Bagchi Robert S. Sullivan Yih-Long Chang

Quelle: Management Science. 33:894-906

Schlagwörter: completion time variance problem, mean squared deviation, job shop, deterministic, inventory/production: measures of effectiveness, programming: integer algorithms, branch and bound [production/scheduling], Deterministic scheduling theory in operations research, common due date, 0211 other engineering and technologies, nonpreemptive single machine scheduling, zero ready time, 02 engineering and technology

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/4037591
https://doi.org/10.1287/mnsc.33.7.894
https://ideas.repec.org/a/inm/ormnsc/v33y1987i7p894-906.html
https://www.jstor.org/stable/info/2632140
https://pubsonline.informs.org/doi/10.1287/mnsc.33.7.894
https://econpapers.repec.org/article/inmormnsc/v_3a33_3ay_3a1987_3ai_3a7_3ap_3a894-906.htm

Heuristics for Multilevel Lot-Sizing with a Bottleneck: Heuristics for multilevel lot-sizing with a bottleneck

Autoren: Peter J. Billington John O. McClain L. Joseph Thomas

Quelle: Management Science. 32:989-1006

Schlagwörter: Lagrangian relaxation, Deterministic scheduling theory in operations research, 05 social sciences, 0211 other engineering and technologies, Integer programming, Inventory, storage, reservoirs, 02 engineering and technology, single bottleneck facility, branch and bound, 0502 economics and business, heuristic, deterministic models, heuristics, programming: integer algorithms, branch and bound [inventory/production], Production models, multilevel lot-sizing

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3961317
https://doi.org/10.1287/mnsc.32.8.989
https://dl.acm.org/doi/10.5555/2772602.2772609
https://ideas.repec.org/a/inm/ormnsc/v32y1986i8p989-1006.html
https://EconPapers.repec.org/RePEc:inm:ormnsc:v:32:y:1986:i:8:p:989-1006
https://www.jstor.org/stable/2631663
https://pubsonline.informs.org/doi/10.1287/mnsc.32.8.989

Assembly Line Balancing with Processing Alternatives: An Application

Autoren: Peter A. Pinto David G. Dannenbring Basheer M. Khumawala

Quelle: Management Science. 29:817-830

Schlagwörter: 8. Economic growth, 0211 other engineering and technologies, line balancing, finance: capital budgeting, programming: integer algorithms, branch and bound [production/scheduling], 02 engineering and technology

Zugangs-URL: https://pubsonline.informs.org/doi/abs/10.1287/mnsc.29.7.817
https://dl.acm.org/doi/abs/10.1287/mnsc.29.7.817
https://ideas.repec.org/a/inm/ormnsc/v29y1983i7p817-830.html
https://econpapers.repec.org/RePEc:inm:ormnsc:v:29:y:1983:i:7:p:817-830

A Branch and Bound Approach for Machine Load Balancing in Flexible Manufacturing Systems: A branch and bound approach for machine load balancing in flexible manufacturing systems

Autoren: Mohammed Berrada Kathryn E. Stecke

Quelle: Management Science. 32:1316-1335

Schlagwörter: nonlinear integer mathematical programming, 0209 industrial biotechnology, Deterministic scheduling theory in operations research, 0211 other engineering and technologies, Integer programming, 02 engineering and technology, flexible manufacturing system, Applications of mathematical programming, Numerical mathematical programming methods, Nonlinear programming, balancing the workload on all machines, flexible manufacturing, production/scheduling: line balancing, programming: integer, algorithms: branch and bound [production/scheduling], Production models, Computational results, loading problem

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3976747
https://doi.org/10.1287/mnsc.32.10.1316
https://pubsonline.informs.org/doi/abs/10.1287/mnsc.32.10.1316
https://deepblue.lib.umich.edu/handle/2027.42/35408
https://ideas.repec.org/a/inm/ormnsc/v32y1986i10p1316-1335.html
https://doi.org/10.1287%2fmnsc.32.10.1316

Note—Multi-Activity Facility Design and Location Problems: Multi-activity facility design and location problems

Autoren: Umit Akinc

Quelle: Management Science. 31:275-283

Schlagwörter: multi-activity facility design, Numerical mathematical programming methods, facility location, 0502 economics and business, 05 social sciences, 0211 other engineering and technologies, branch-and-bound, Integer programming, Inventory, storage, reservoirs, 02 engineering and technology, location, design, programming: integer algorithms, branch and bound [facilities/equipment planning], computational results

Dateibeschreibung: application/xml

Zugangs-URL: https://pubsonline.informs.org/doi/pdf/10.1287/mnsc.31.3.275
https://www.jstor.org/stable/2631484
https://doi.org/10.1287/mnsc.31.3.275
https://pubsonline.informs.org/doi/10.1287/mnsc.31.3.275
https://ideas.repec.org/a/inm/ormnsc/v31y1985i3p275-283.html
https://econpapers.repec.org/RePEc:inm:ormnsc:v:31:y:1985:i:3:p:275-283

A Greedy Heuristic for Single Machine Sequencing with Precedence Constraints: A greedy heuristic for single machine sequencing with precedence constraints

Autoren: Howard J. Weiss

Quelle: Management Science. 27:1209-1216

Schlagwörter: Numerical mathematical programming methods, Deterministic scheduling theory in operations research, branch and bound method, 0211 other engineering and technologies, test problems, single machine sequencing, 02 engineering and technology, greedy, programming: integer algorithms, branch and bound [production/scheduling, heuristic], greedy heuristic, precedence constraints

Dateibeschreibung: application/xml

Zugangs-URL: https://pubsonline.informs.org/doi/abs/10.1287/mnsc.27.10.1209
https://econpapers.repec.org/article/inmormnsc/v_3a27_3ay_3a1981_3ai_3a10_3ap_3a1209-1216.htm
https://ideas.repec.org/a/inm/ormnsc/v27y1981i10p1209-1216.html

Mathematical Programming Algorithms for Two-Path Routing Problems with Reliability Considerations.

Autoren: Andreas, April K. Smith, J. Cole

Quelle: INFORMS Journal on Computing. Fall2008, Vol. 20 Issue 4, p553-564. 12p. 1 Diagram, 7 Charts, 1 Graph.

Schlagwörter: *MATHEMATICAL programming, *NONLINEAR programming, *NONCONVEX programming, *COMPUTER programming, *PROBABILITY theory, *FUNCTIONAL equations, *PROGRAMMING languages, *MATHEMATICAL optimization, *COMPUTER science

Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty.

Autoren: Pessoa, Artur Alves Poss, Michael Sadykov, Ruslan et al.

Quelle: Operations Research; May/Jun2021, Vol. 69 Issue 3, p739-754, 16p

Schlagwörter: VEHICLE routing problem, KNAPSACK problems, ALGORITHMS, MAGNITUDE (Mathematics), ROBUST optimization, INCOME inequality, PRODUCTION scheduling