Issue 5/2019
Content (7 Articles)
A unified view of parallel machine scheduling with interdependent processing rates
Bahram Alidaee, Haibo Wang, R. Bryan Kethley, Frank Landram
Single-machine common due date total earliness/tardiness scheduling with machine unavailability
Kerem Bülbül, Safia Kedad-Sidhoum, Halil Şen
Open Access
Risk-averse single machine scheduling: complexity and approximation
Adam Kasperski, Paweł Zieliński
The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
Rubing Chen, Jinjiang Yuan, Yuan Gao
Unary NP-hardness of single-machine scheduling to minimize the total tardiness with deadlines
Rubing Chen, Jinjiang Yuan
Two-agent scheduling with deteriorating jobs on a single parallel-batching machine: refining computational complexity
Mikhail Y. Kovalyov, Dmitrij Šešok