UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Scheduling the Italian Football League: an ILP-based approach

Computers & operations research, 2006-07, Vol.33 (7), p.1963-1974

2006

Volltextzugriff (PDF)

A note on “Two-machine flow-shop scheduling with rejection” and its link with flow-shop scheduling and common due date assignment

Computers & operations research, 2012-12, Vol.39 (12), p.3244-3246

2012

Volltextzugriff (PDF)

Improved LP-based algorithms for the closest string problem

Computers & operations research, 2012-03, Vol.39 (3), p.746-749

2012

Volltextzugriff (PDF)

A greedy-based neighborhood search approach to a nurse rostering problem

European journal of operational research, 2004-02, Vol.153 (1), p.28-40

2004

Volltextzugriff (PDF)

An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

European journal of operational research, 2002-06, Vol.139 (2), p.293-301

2002

Volltextzugriff (PDF)

Computational experience with a core-based reduction procedure for the 2-knapsack problem

Computers & operations research, 2011-02, Vol.38 (2), p.514-516

2011

Volltextzugriff (PDF)

A note on minimizing the sum of quadratic completion times on two identical parallel machines

Information processing letters, 2012-10, Vol.112 (19), p.738-742

2012

Volltextzugriff (PDF)

A note on “Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time”

Computers & industrial engineering, 2011-02, Vol.60 (1), p.183-186

2011

Volltextzugriff (PDF)

Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

Journal of heuristics, 2004-01, Vol.10 (1), p.89-104

2004

Volltextzugriff (PDF)

Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances

Journal of scheduling, 2010-02, Vol.13 (1), p.39-47

2010

Volltextzugriff (PDF)

No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths

Journal of scheduling, 2019-02, Vol.22 (1), p.59-68

2019

Volltextzugriff (PDF)

Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem

Computers & operations research, 2012, Vol.39 (1), p.27-31

2012

Volltextzugriff (PDF)

Fast algorithms for min independent dominating set

Discrete Applied Mathematics, 2013-03, Vol.161 (4-5), p.558-572

2013

Volltextzugriff (PDF)

The two-machine total completion time flow shop problem

European journal of operational research, 1996-04, Vol.90 (2), p.227-237

1996

Volltextzugriff (PDF)

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

Journal of heuristics, 2004-03, Vol.10 (2), p.135-152

2004

Volltextzugriff (PDF)

A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem

The Journal of the Operational Research Society, 2002-11, Vol.53 (11), p.1275-1280

2002

Volltextzugriff (PDF)

A Heuristic Algorithm for the Auto-Carrier Transportation Problem

Transportation science, 2002-02, Vol.36 (1), p.55-62

2002

Volltextzugriff (PDF)

Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem

Computers & operations research, 2012-06, Vol.39 (6), p.1213-1217

2012

Volltextzugriff (PDF)

Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems

Journal of scheduling, 2004-11, Vol.7 (6), p.429-440

2004

Volltextzugriff (PDF)

On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints

Networks, 2004-09, Vol.44 (2), p.73-83

2004

Volltextzugriff (PDF)

An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem

Operations research letters, 2004, Vol.32 (1), p.68-72

2004

Volltextzugriff (PDF)

Improving the preemptive bound for the single machine dynamic maximum lateness problem

Operations research letters, 2010-11, Vol.38 (6), p.589-591

2010

Volltextzugriff (PDF)

Solving the Hub location problem in telecommunication network design: A local search approach

Networks, 2004-09, Vol.44 (2), p.94-105

2004

Volltextzugriff (PDF)

Scheduling a round robin tennis tournament under courts and players availability constraints

Annals of operations research, 1999-01, Vol.92, p.349

1999

Volltextzugriff (PDF)

An exact algorithm for MAX-CUT in sparse graphs

Operations research letters, 2007-05, Vol.35 (3), p.403-408

2007

Volltextzugriff (PDF)

1 – 25 von 113

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(102)
Mit Volltextzugriff
(103)

Publikationsform

Sprache

Erscheinungsjahr

n.n

Thema

Science & Technology
(74)
Technology
(55)
Operations Research & Management Science
(36)
Exact Sciences And Technology
(28)
Applied Sciences
(26)
Computer Science
(24)
Engineering
(22)
Algorithms
(20)
Operational Research. Management Science
(20)
Studies
(20)
Operational Research And Scientific Management
(19)
Operations Research
(19)
Life Sciences & Biomedicine
(17)
Humans
(16)
Scheduling
(16)
Job Shops
(15)
Management
(13)
Social Sciences
(13)
Business & Economics
(12)
Heuristic
(12)

15 weitere anzeigen...

Weniger anzeigen...

Neu hinzugefügt

... seit 90 Tagen
(1)

Menü

Weitere Dienste

Einstellungen

Scheduling the Italian Football League: an ILP-based approach

A note on “Two-machine flow-shop scheduling with rejection” and its link with flow-shop scheduling and common due date assignment

Improved LP-based algorithms for the closest string problem

A greedy-based neighborhood search approach to a nurse rostering problem

An improved branch-and-bound algorithm for the two machine total completion time flow shop problem

Computational experience with a core-based reduction procedure for the 2-knapsack problem

A note on minimizing the sum of quadratic completion times on two identical parallel machines

A note on “Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time”

Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems

Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances

No-idle, no-wait: when shop scheduling meets dominoes, Eulerian paths and Hamiltonian paths

Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem

Fast algorithms for min independent dominating set

The two-machine total completion time flow shop problem

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

A Recovering Beam Search algorithm for the one-machine dynamic total completion time scheduling problem

A Heuristic Algorithm for the Auto-Carrier Transportation Problem

Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem

Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems

On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints

An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem

Improving the preemptive bound for the single machine dynamic maximum lateness problem

Solving the Hub location problem in telecommunication network design: A local search approach

Scheduling a round robin tennis tournament under courts and players availability constraints

An exact algorithm for MAX-CUT in sparse graphs

Suchergebnisse filtern