Volume 23, issue 6, December 2020

Special Issue: Dynamic Scheduling Problems

Issue editors

Alessandro Agnetis
Stanislaw Gawiejnowicz
Bertrand Miao-Tsong Lin
Gur Mosheiov

11 articles in this issue

Editorial: Dynamic Scheduling Problems

Authors (first, second and last of 4)
- Alessandro Agnetis
- Stanisław Gawiejnowicz
- Gur Mosheiov
- Content type: Editorial
- Published: 24 October 2020
- Pages: 629 - 630
Flowshop scheduling with learning effect and job rejection

Authors
- Baruch Mor
- Gur Mosheiov
- Dana Shapira
- Content type: OriginalPaper
- Published: 18 July 2019
- Pages: 631 - 641
A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times

Authors
- Nir Halman
- Content type: BriefCommunication
- Published: 03 August 2019
- Pages: 643 - 648
Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing

Authors (first, second and last of 6)
- Shaojun Lu
- Jun Pei
- Panos M. Pardalos
- Content type: OriginalPaper
- Published: 07 September 2019
- Pages: 649 - 664
Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects

Authors
- Alan J. Soper
- Vitaly A. Strusevich
- Content type: OriginalPaper
- Open Access
- Published: 02 November 2019
- Pages: 665 - 680
Scheduling in data gathering networks with background communications

Authors
- Joanna Berlińska
- Content type: OriginalPaper
- Open Access
- Published: 20 February 2020
- Pages: 681 - 691
Approximation algorithms for energy-efficient scheduling of parallel jobs

Authors
- Alexander Kononov
- Yulia Kovalenko
- Content type: OriginalPaper
- Published: 21 April 2020
- Pages: 693 - 709
A periodic optimization approach to dynamic pickup and delivery problems with time windows

Authors
- Farzaneh Karami
- Wim Vancroonenburg
- Greet Vanden Berghe
- Content type: OriginalPaper
- Published: 23 June 2020
- Pages: 711 - 731
New results for an open time-dependent scheduling problem

Authors
- Stanisław Gawiejnowicz
- Wiesław Kurc
- Content type: OriginalPaper
- Open Access
- Published: 13 July 2020
- Pages: 733 - 744
On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty

Authors
- Yakov Shafransky
- Viktor Shinkarevich
- Content type: OriginalPaper
- Published: 23 September 2020
- Pages: 745 - 749
Scheduling jobs with a V-shaped time-dependent processing time

Authors
- Helmut A. Sedding
- Content type: OriginalPaper
- Open Access
- Published: 08 September 2020
- Pages: 751 - 768

Volume 23, issue 6, December 2020

Special Issue: Dynamic Scheduling Problems

Editorial: Dynamic Scheduling Problems

Flowshop scheduling with learning effect and job rejection

A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times

Less is more: variable neighborhood search for integrated production and assembly in smart manufacturing

Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects

Scheduling in data gathering networks with background communications

Approximation algorithms for energy-efficient scheduling of parallel jobs

A periodic optimization approach to dynamic pickup and delivery problems with time windows

New results for an open time-dependent scheduling problem

On the complexity of constructing a minmax regret solution for the two-machine flow shop problem under the interval uncertainty

Scheduling jobs with a V-shaped time-dependent processing time

For authors

Explore

Volume 23, issue 6, December 2020

Special Issue: Dynamic Scheduling Problems

Authors (first, second and last of 4)

Authors

Authors

Authors (first, second and last of 6)

Authors

Authors

Authors

Authors

Authors

Authors

Authors

For authors

Explore