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

Late and early work scheduling: A survey

Omega (Oxford), 2021-10, Vol.104, p.102453, Article 102453

Sterna, Małgorzata

2021

Volltextzugriff (PDF)

Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

European journal of operational research, 2020-07, Vol.284 (1), p.67-74

2020

Volltextzugriff (PDF)

Mirror scheduling problems with early work and late work criteria

Journal of scheduling, 2021-10, Vol.24 (5), p.483-487

2021

Volltextzugriff (PDF)

Exact and heuristic algorithms for scheduling on two identical machines with early work maximization

Computers & industrial engineering, 2020-06, Vol.144, p.106449, Article 106449

2020

Volltextzugriff (PDF)

Semi-online scheduling on two identical machines with a common due date to maximize total early work

Discrete Applied Mathematics, 2021-02, Vol.290, p.71-78

2021

Volltextzugriff (PDF)

Single machine scheduling with due date assignment to minimize the total weighted lead time penalty and late work

Omega (Oxford), 2023-12, Vol.121, p.102923, Article 102923

2023

Volltextzugriff (PDF)

Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect

Computers & industrial engineering, 2017-09, Vol.111, p.176-182

2017

Volltextzugriff (PDF)

Handbook on Scheduling: From Theory to Practice

2nd ed. 2019., 2019

Volltextzugriff (PDF)

The two-machine flow-shop problem with weighted late work criterion and common due date

European journal of operational research, 2005-09, Vol.165 (2), p.408-415

2005

Volltextzugriff (PDF)

The disjunctive graph machine representation of the job shop scheduling problem

European journal of operational research, 2000-12, Vol.127 (2), p.317-331

2000

Volltextzugriff (PDF)

A note on the two machine job shop with the weighted late work criterion

Journal of scheduling, 2007-04, Vol.10 (2), p.87-95

2007

Volltextzugriff (PDF)

Exact approaches to late work scheduling on unrelated machines

International journal of applied mathematics and computer science, 2023-06, Vol.33 (2)

2023

Volltextzugriff (PDF)

Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work

International journal of applied mathematics and computer science, 2024-06, Vol.34 (2)

2024

Volltextzugriff (PDF)

A survey of scheduling problems with late work criteria

Omega (Oxford), 2011-04, Vol.39 (2), p.120-129

Sterna, Malgorzata

2011

Volltextzugriff (PDF)

A novel representation of graph structures in web mining and data analysis

Omega (Oxford), 2005-02, Vol.33 (1), p.65-71

2005

Volltextzugriff (PDF)

Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work

Journal of optimization theory and applications, 2017-09, Vol.174 (3), p.927-944

2017

Volltextzugriff (PDF)

Scheduling on parallel identical machines with late work criterion: Offline and online cases

Journal of scheduling, 2016-12, Vol.19 (6), p.729-736

2016

Volltextzugriff (PDF)

Alternative algorithms for identical machines scheduling to maximize total early work with a common due date

Computers & industrial engineering, 2022-09, Vol.171, p.108386, Article 108386

2022

Volltextzugriff (PDF)

Two-machine flow shop scheduling with a common due date to maximize total early work

European journal of operational research, 2022-07, Vol.300 (2), p.504-511

2022

Volltextzugriff (PDF)

Late work minimization in a small flexible manufacturing system

Computers & industrial engineering, 2007-03, Vol.52 (2), p.210-228

Sterna, Malgorzata

2007

Volltextzugriff (PDF)

Complexity of Scheduling Problem in Single-Machine Flexible Manufacturing System with Cyclic Transportation and Unlimited Buffers

Journal of optimization theory and applications, 2017-06, Vol.173 (3), p.1042-1054

2017

Volltextzugriff (PDF)

Two-machine flow-shop scheduling to minimize total late work: revisited

Engineering optimization, 2019-07, Vol.51 (7), p.1268-1278

2019

Volltextzugriff (PDF)

Open shop scheduling problems with late work criteria

Discrete Applied Mathematics, 2004-01, Vol.134 (1-3), p.1-24

2004

Volltextzugriff (PDF)

Supporting supply process in charitable organizations by genetic algorithm

Computers & industrial engineering, 2015-10, Vol.88, p.39-48

2015

Volltextzugriff (PDF)

Late work minimization in flow shops by a genetic algorithm

Computers & industrial engineering, 2009-11, Vol.57 (4), p.1202-1209

2009

Volltextzugriff (PDF)

1 – 25 von 63

Suche als RSS-Feed

Suchergebnisse filtern

Filter anzeigen

Nur zeigen

Geprüft (Peer-Review)
(34)
Mit Volltextzugriff
(60)

Publikationsform

Sprache

Englisch
(63)

Erscheinungsjahr

n.n

Thema

Science & Technology
(32)
Technology
(29)
Scheduling
(18)
Engineering
(16)
Operations Research & Management Science
(16)
Computer Science
(14)
Job Shops
(11)
Studies
(11)
Late Work
(10)
Dynamic Programming
(9)
Production Scheduling
(9)
Computer Science, Interdisciplinary Applications
(8)
Engineering, Industrial
(8)
Management
(8)
Social Sciences
(8)
Applied Sciences
(7)
Business & Economics
(7)
Exact Sciences And Technology
(7)
Mathematics
(7)
Early Work
(6)

15 weitere anzeigen...

Weniger anzeigen...

Menü

Weitere Dienste

Einstellungen

Late and early work scheduling: A survey

Fully polynomial time approximation scheme to maximize early work on parallel machines with common due date

Mirror scheduling problems with early work and late work criteria

Exact and heuristic algorithms for scheduling on two identical machines with early work maximization

Semi-online scheduling on two identical machines with a common due date to maximize total early work

Single machine scheduling with due date assignment to minimize the total weighted lead time penalty and late work

Complexity of late work minimization in flow shop systems and a particle swarm optimization algorithm for learning effect

Handbook on Scheduling: From Theory to Practice

The two-machine flow-shop problem with weighted late work criterion and common due date

The disjunctive graph machine representation of the job shop scheduling problem

A note on the two machine job shop with the weighted late work criterion

Exact approaches to late work scheduling on unrelated machines

Online and semi-online scheduling on two hierarchical machines with a common due date to maximize the total early work

A survey of scheduling problems with late work criteria

A novel representation of graph structures in web mining and data analysis

Polynomial Time Approximation Scheme for Two Parallel Machines Scheduling with a Common Due Date to Maximize Early Work

Scheduling on parallel identical machines with late work criterion: Offline and online cases

Alternative algorithms for identical machines scheduling to maximize total early work with a common due date

Two-machine flow shop scheduling with a common due date to maximize total early work

Late work minimization in a small flexible manufacturing system

Complexity of Scheduling Problem in Single-Machine Flexible Manufacturing System with Cyclic Transportation and Unlimited Buffers

Two-machine flow-shop scheduling to minimize total late work: revisited

Open shop scheduling problems with late work criteria

Supporting supply process in charitable organizations by genetic algorithm

Late work minimization in flow shops by a genetic algorithm

Suchergebnisse filtern