Ausgabe 3/2019
Inhalt (16 Artikel)
Operating room planning and surgical case scheduling: a review of literature
Shuwan Zhu, Wenjuan Fan, Shanlin Yang, Jun Pei, Panos M. Pardalos
Accelerating benders decomposition: multiple cuts via multiple solutions
N. Beheshti Asl, S. A. MirHassani
Pareto optimal equilibria for selfish bin packing with uniform cost sharing
György Dósa, Leah Epstein
Competitive analysis of randomized online strategies for the multi-agent k-Canadian Traveler Problem
Davood Shiri, F. Sibel Salman
Verifying schedulability of tasks in ROS-based systems
Jin Cui, Cong Tian, Nan Zhang, Zhenhua Duan, Hongwei Du
A possible optimal design of one-way Hamming network H(n, 3) based on the minimum transmission latency
Yanyan Wen, Guorong Chai, Qiuli Li, Zhe George Zhang
Restricted power domination and zero forcing problems
Chassidy Bozeman, Boris Brimkov, Craig Erickson, Daniela Ferrero, Mary Flagg, Leslie Hogben
Minimum rank and zero forcing number for butterfly networks
Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen
A note on a two-agent scheduling problem related to the total weighted late work
Yuan Zhang, Jinjiang Yuan
Open Access
Drawer algorithms for 1-space bounded multidimensional hyperbox packing
Paulina Grzegorek, Janusz Januszewski
Approximation algorithms for the graph balancing problem with two speeds and two job lengths
Daniel R. Page, Roberto Solis-Oba
Planar graphs with are neighbor-distinguishing totally 12-colorable
Weifan Wang, Jingjing Huo, Danjun Huang, Yiqiao Wang