scholarly journals High multiplicity scheduling problems

2003 ◽  
Author(s):  
A. Grigoriev
Keyword(s):  
High Multiplicity ◽  
Scheduling Problems

scholarly journals A Framework for the Complexity of High-Multiplicity Scheduling Problems

2005 ◽  
Vol 9 (3) ◽  
pp. 313-323 ◽  
Author(s):  
N. Brauner ◽  
Y. Crama ◽  
A. Grigoriev ◽  
J. van de Klundert
Keyword(s):  
High Multiplicity ◽  
Scheduling Problems

scholarly journals Scheduling High Multiplicity Coupled Tasks

2020 ◽  
Vol 45 (1) ◽  
pp. 47-61
Author(s):  
Wojciech Wojciechowicz ◽  
Michaël Gabay
Keyword(s):  
Computational Experiment ◽  
Optimal Algorithm ◽  
High Multiplicity ◽  
Problem Instance ◽  
Scheduling Problems ◽  
Asymptotically Optimal ◽  
Tasks Scheduling ◽  
Individual Task ◽  
Coupled Tasks ◽  
Theoretical Results

AbstractThe coupled tasks scheduling problem is class of scheduling problems, where each task consists of two operations and a separation gap between them. The high-multiplicity is a compact encoding, where identical tasks are grouped together, and the group is specified instead of each individual task. Consequently the encoding of a problem instance is decreased significantly. In this article we derive a lower bound for the problem variant as well as propose an asymptotically optimal algorithm. The theoretical results are complemented with computational experiment, where a new algorithm is compared with three other algorithms implemented.

Two-Operation Crane Scheduling Problems

1982 ◽  
Vol 14 (3) ◽  
pp. 147-155 ◽  
Author(s):  
R. W. Lieberman ◽  
I. B. Turksen
Keyword(s):  
Scheduling Problems ◽  
Crane Scheduling

Application of Column Generation for Train-set Scheduling Problems with Regular Maintenance Constraints

2012 ◽  
Vol 132 (1) ◽  
pp. 151-159
Author(s):  
Akiyoshi Ohno ◽  
Tatsushi Nishi ◽  
Masahiro Inuiguchi ◽  
Satoru Takahashi ◽  
Kenji Ueda
Keyword(s):  
Column Generation ◽  
Scheduling Problems
Sign in / Sign up

Export Citation Format

Share Document