Journal of Scheduling

Journal of Scheduling OnlineFirst articles

02.01.2019

The Complexity of Parallel Machine Scheduling of Unit-Processing-Time Jobs under Level-Order Precedence Constraints

In this paper, we prove that parallel machine scheduling problems where jobs have unit processing time and level-order precedence constraints are NP-complete, while minimizing the makespan or the total completion time. These problems are …

18.12.2018

The Longest Processing Time rule for identical parallel machines revisited

We consider the $$P_m || C_{\max }$$ P m | | C max scheduling problem where the goal is to schedule n jobs on m identical parallel machines $$(m < n)$$ ( m < n ) to minimize makespan. We revisit the famous Longest Processing Time (LPT) rule …

18.12.2018

Inductive -independent graphs and c-colorable subgraphs in scheduling: a review

Inductive $$k$$ k -independent graphs generalize chordal graphs and have recently been advocated in the context of interference-avoiding wireless communication scheduling. The NP-hard problem of finding maximum-weight induced c-colorable …

17.12.2018

The evolution of schematic representations of flow shop scheduling problems

The schematic representation of schedules has been a useful tool for researchers; in this paper, we review existing network-based schematics for flow shop models. We also propose new schematics for flow shops with blocking, synchronous transfers …

17.12.2018 Open Access

Stochastic project management: multiple projects with multi-skilled human resources

This paper presents two stochastic optimization approaches for simultaneous project scheduling and personnel planning, extending a deterministic model previously developed by Heimerl and Kolisch. For the problem of assigning work packages to …

PDF-Version jetzt herunterladen Zum Volltext

Weitere Informationen

Titel

Journal of Scheduling

Verlag

Springer US

Abdeckung

Jahrgang 6/2003 - Jahrgang 21/2018

Print ISSN

1094-6136

Elektronische ISSN

1099-1425

DOI

https://doi.org/10.1007/10951.1099-1425

Zeitschriften-ID

10951