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...

Fast neighborhood search for the single machine earliness–tardiness scheduling problem

Computers & operations research, 2010-08, Vol.37 (8), p.1464-1471

2010

Volltextzugriff (PDF)

PYM: a new, affordable, image-based method using a Raspberry Pi to phenotype plant leaf area in a wide diversity of environments

Plant methods, 2017-11, Vol.13 (1), p.98-17, Article 98

2017

Volltextzugriff (PDF)

Efficient neighborhood search for the one-machine earliness–tardiness scheduling problem

European journal of operational research, 2006-08, Vol.173 (1), p.108-119

2006

Volltextzugriff (PDF)

Increasing the total productivity of a land by combining mobile photovoltaic panels and food crops

Applied energy, 2017-11, Vol.206, p.1495-1507

2017

Volltextzugriff (PDF)

New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

INFORMS journal on computing, 2009-01, Vol.21 (1), p.167-175

Sourd, Francis

2009

Volltextzugriff (PDF)

A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem

INFORMS journal on computing, 2008-08, Vol.20 (3), p.472-484

2008

Volltextzugriff (PDF)

Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

Computers & operations research, 2009, Vol.36 (1), p.60-72

2009

Volltextzugriff (PDF)

Optimal timing of a sequence of tasks with general completion costs

European journal of operational research, 2005-08, Vol.165 (1), p.82-96

Sourd, Francis

2005

Volltextzugriff (PDF)

Earliness–tardiness scheduling with setup considerations

Computers & operations research, 2005-07, Vol.32 (7), p.1849-1865

Sourd, Francis

2005

Volltextzugriff (PDF)

An improved earliness–tardiness timing algorithm

Computers & operations research, 2007-10, Vol.34 (10), p.2931-2938

2007

Volltextzugriff (PDF)

The importance of 3D models to calculate shading ratios

AIP Conference Proceedings, 2022, Vol.2635 (1)

2022

Volltextzugriff (PDF)

A new model for the preemptive earliness–tardiness scheduling problem

Computers & operations research, 2009-07, Vol.36 (7), p.2242-2249

2009

Volltextzugriff (PDF)

Lagrangian bounds for just-in-time job-shop scheduling

Computers & operations research, 2008-03, Vol.35 (3), p.906-915

2008

Volltextzugriff (PDF)

Dynasearch for the earliness–tardiness scheduling problem with release dates and setup constraints

Operations research letters, 2006-09, Vol.34 (5), p.591-598

Sourd, Francis

2006

Volltextzugriff (PDF)

Lower bounds for the earliness–tardiness scheduling problem on parallel machines with distinct due dates

European journal of operational research, 2008-09, Vol.189 (3), p.1305-1316

2008

Volltextzugriff (PDF)

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Journal of scheduling, 2008-02, Vol.11 (1), p.49-58

2008

Volltextzugriff (PDF)

Lexicographically minimizing axial motions for the Euclidean TSP

Journal of combinatorial optimization, 2010, Vol.19 (1), p.1-15

Sourd, Francis

2010

Volltextzugriff (PDF)

Punctuality and idleness in just-in-time scheduling

European journal of operational research, 2005-12, Vol.167 (3), p.739-751

Sourd, Francis

2005

Volltextzugriff (PDF)

Punctuality and idleness in just-in-time scheduling: Multicriteria Scheduling

European journal of operational research, 2005, Vol.167 (3), p.739-751

SOURD, Francis

2005

Volltextzugriff (PDF)

Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints

Operations research letters, 2006-09, Vol.34 (5), p.591-598

Sourd, Francis

2006

Volltextzugriff (PDF)

The one-machine just-in-time scheduling problem with preemption

Discrete optimization, 2009-02, Vol.6 (1), p.10-22

2009

Volltextzugriff (PDF)

The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions

INFORMS journal on computing, 2004, Vol.16 (2), p.198-208

Sourd, Francis

2004

Volltextzugriff (PDF)

A multi objective branch-and-bound framework: application to the biobjective spanning tree problem

INFORMS journal on computing, 2008-06, Vol.20 (3), p.472

2008

Volltextzugriff (PDF)

Scheduling with periodic availability constraints and irregular cost functions

R.A.I.R.O. Recherche opérationnelle, 2007-04, Vol.41 (2), p.141-154

Sourd, Francis

2007

Volltextzugriff (PDF)

The One-Machine Problem with Earliness and Tardiness Penalties

Journal of scheduling, 2003-11, Vol.6 (6), p.533-549

2003

Volltextzugriff (PDF)

1 – 25 von 49

Menü

Weitere Dienste

Einstellungen

Fast neighborhood search for the single machine earliness–tardiness scheduling problem

PYM: a new, affordable, image-based method using a Raspberry Pi to phenotype plant leaf area in a wide diversity of environments

Efficient neighborhood search for the one-machine earliness–tardiness scheduling problem

Increasing the total productivity of a land by combining mobile photovoltaic panels and food crops

New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem

Scheduling in a two-machine flowshop for the minimization of the mean absolute deviation from a common due date

Optimal timing of a sequence of tasks with general completion costs

Earliness–tardiness scheduling with setup considerations

An improved earliness–tardiness timing algorithm

The importance of 3D models to calculate shading ratios

A new model for the preemptive earliness–tardiness scheduling problem

Lagrangian bounds for just-in-time job-shop scheduling

Dynasearch for the earliness–tardiness scheduling problem with release dates and setup constraints

Lower bounds for the earliness–tardiness scheduling problem on parallel machines with distinct due dates

A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem

Lexicographically minimizing axial motions for the Euclidean TSP

Punctuality and idleness in just-in-time scheduling

Punctuality and idleness in just-in-time scheduling: Multicriteria Scheduling

Dynasearch neighborhood for the earliness-tardiness scheduling problem with release dates and setup constraints

The one-machine just-in-time scheduling problem with preemption

The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions

A multi objective branch-and-bound framework: application to the biobjective spanning tree problem

Scheduling with periodic availability constraints and irregular cost functions

The One-Machine Problem with Earliness and Tardiness Penalties

Suchergebnisse filtern