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

Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads

Journal of combinatorial optimization, 2022, Vol.43 (1), p.79-97

Mor, Baruch

2022

Volltextzugriff (PDF)

Flowshop scheduling with learning effect and job rejection

Journal of scheduling, 2020-12, Vol.23 (6), p.631-641

2020

Volltextzugriff (PDF)

Single machine scheduling with non-availability interval and optional job rejection

Journal of combinatorial optimization, 2022-08, Vol.44 (1), p.480-497

2022

Volltextzugriff (PDF)

Minmax due-date assignment on a two-machine flowshop

Annals of operations research, 2021-10, Vol.305 (1-2), p.191-209

2021

Volltextzugriff (PDF)

Single machine lot scheduling with optional job-rejection

Journal of combinatorial optimization, 2021, Vol.41 (1), p.1-11

2021

Volltextzugriff (PDF)

A note on the single machine CON and CONW problems with lot scheduling

Journal of combinatorial optimization, 2021-08, Vol.42 (2), p.327-338

2021

Volltextzugriff (PDF)

Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates

Journal of scheduling, 2021-12, Vol.24 (6), p.553-567

2021

Volltextzugriff (PDF)

Regular scheduling measures on proportionate flowshop with job rejection

Computational & applied mathematics, 2020-05, Vol.39 (2), Article 107

2020

Volltextzugriff (PDF)

Single-machine lot scheduling with variable lot processing times

Engineering optimization, 2021-02, Vol.53 (2), p.321-334

Mor, Baruch

2021

Volltextzugriff (PDF)

Due-Date assignment with acceptable lead-times on parallel machines

Computers & operations research, 2024-06, Vol.166, p.106617, Article 106617

2024

Volltextzugriff (PDF)

Scheduling on parallel dedicated machines with job rejection

International journal of production research, 2024-10, Vol.62 (19), p.6933-6940

2024

Volltextzugriff (PDF)

Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection

Operational research, 2023-03, Vol.23 (1), p.10, Article 10

Mor, Baruch

2023

Volltextzugriff (PDF)

Single-machine scheduling with total late work and job rejection

Computers & industrial engineering, 2022-07, Vol.169, p.108168, Article 108168

2022

Volltextzugriff (PDF)

Minmax common due-window assignment and scheduling on a single machine with two competing agents

The Journal of the Operational Research Society, 2018-04, Vol.69 (4), p.589-602

Mor, Baruch

2018

Volltextzugriff (PDF)

Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation

Engineering optimization, 2019-07, Vol.51 (7), p.1251-1267

Mor, Baruch

2019

Volltextzugriff (PDF)

Scheduling with regular performance measures and optional job rejection on a single machine

The Journal of the Operational Research Society, 2020-08, Vol.71 (8), p.1315-1325

2020

Volltextzugriff (PDF)

Minmax scheduling problems with common due-date and completion time penalty

Journal of combinatorial optimization, 2019-07, Vol.38 (1), p.50-71

Mor, Baruch

2019

Volltextzugriff (PDF)

Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times

Journal of scheduling, 2024-06, Vol.27 (3), p.239-256

2024

Volltextzugriff (PDF)

Improved algorithms for scheduling on proportionate flowshop with job-rejection

The Journal of the Operational Research Society, 2019-11, Vol.70 (11), p.1997-2003

2019

Volltextzugriff (PDF)

Scheduling problems on a new setting of flexible flowshops: ℓ-Machine proportionate flowshops

The Journal of the Operational Research Society, 2022-07, Vol.73 (7), p.1499-1516

2022

Volltextzugriff (PDF)

A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection

Annals of operations research, 2018-12, Vol.271 (2), p.1079-1085

2018

Volltextzugriff (PDF)

Single machine batch scheduling with two competing agents to minimize total flowtime

European journal of operational research, 2011-12, Vol.215 (3), p.524-531

2011

Volltextzugriff (PDF)

Scheduling a deteriorating maintenance activity and due-window assignment

Computers & operations research, 2015-05, Vol.57, p.33-40

2015

Volltextzugriff (PDF)

Scheduling problems with two competing agents to minimize minmax and minsum earliness measures

European journal of operational research, 2010-11, Vol.206 (3), p.540-546

2010

Volltextzugriff (PDF)

A note: flowshop scheduling with linear deterioration and job-rejection

4OR, 2021-03, Vol.19 (1), p.103-111

2021

Volltextzugriff (PDF)

1 – 25 von 80

Menü

Weitere Dienste

Einstellungen

Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads

Flowshop scheduling with learning effect and job rejection

Single machine scheduling with non-availability interval and optional job rejection

Minmax due-date assignment on a two-machine flowshop

Single machine lot scheduling with optional job-rejection

A note on the single machine CON and CONW problems with lot scheduling

Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates

Regular scheduling measures on proportionate flowshop with job rejection

Single-machine lot scheduling with variable lot processing times

Due-Date assignment with acceptable lead-times on parallel machines

Scheduling on parallel dedicated machines with job rejection

Single machine scheduling problems involving job-dependent step-deterioration dates and job rejection

Single-machine scheduling with total late work and job rejection

Minmax common due-window assignment and scheduling on a single machine with two competing agents

Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation

Scheduling with regular performance measures and optional job rejection on a single machine

Minmax scheduling problems with common due-date and completion time penalty

Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times

Improved algorithms for scheduling on proportionate flowshop with job-rejection

Scheduling problems on a new setting of flexible flowshops: ℓ-Machine proportionate flowshops

A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection

Single machine batch scheduling with two competing agents to minimize total flowtime

Scheduling a deteriorating maintenance activity and due-window assignment

Scheduling problems with two competing agents to minimize minmax and minsum earliness measures

A note: flowshop scheduling with linear deterioration and job-rejection

Suchergebnisse filtern