The extended data set (UGWT) for the parallel serial-batch scheduling problem with incompatible job families, sequence-dependent setup times, and arbitrary sizes contains instances with up to 3,200 jobs and different types of setup times (symmetric Euclidean - SE, asymmetric Euclidean - AE, and arbitrary - AR). The instances are separated into three classes: small (S), large (L), and very large (XL).Main characteristics of the small instances S: number of jobs n = 15, 30, or 60; number of machines m = 1, 3, 4, or 5; number of incompatible job families q= 3, 5, or 10; Main characteristics of the large instances L: number of jobs n = 100, 200, or 300; number of machines m = 1, 3, 4, 5, or 10; number of incompatible job families q= 3, 5, 10, o...
This dataset contains the following instance sets from the Master's Thesis and Journal Paper "Exact...
AbstractThis paper presents a new approach for transforming MRP orders, planned periodically, e.g. o...
The problem of scheduling G groups of jobs on m parallel machines is considered. Each group consists...
The following dataset contains randomly generated problem instances for the related machine scheduli...
This paper considers the problem of scheduling parallel nonidentical batch processors in the presenc...
We suggest a new class of scheduling problems, named Batch Parallel Working, and we study it in its ...
Parallel batch scheduling has many applications in the industrial sector, like in material and chemi...
This paper presents the problem of batching and scheduling jobs belonging to incompatible job famili...
[[abstract]]There is a set of jobs available to process in batches on a set of identical parallel ma...
This paper addresses a specific class of scheduling parallel batching problem, which is observed in ...
The problem of scheduling batch processors is important in some industries and, at a more fundamenta...
Batch processing machines that can process a group of jobs simultaneously are often encountered in s...
This research analyzes the problem of scheduling a set of n jobs with arbitrary job sizes and non-ze...
This paper is concerned with scheduling independent jobs on m parallel machines in such a way that t...
We consider the problem of scheduling heterogeneous batch processors (i.e., batch processors with di...
This dataset contains the following instance sets from the Master's Thesis and Journal Paper "Exact...
AbstractThis paper presents a new approach for transforming MRP orders, planned periodically, e.g. o...
The problem of scheduling G groups of jobs on m parallel machines is considered. Each group consists...
The following dataset contains randomly generated problem instances for the related machine scheduli...
This paper considers the problem of scheduling parallel nonidentical batch processors in the presenc...
We suggest a new class of scheduling problems, named Batch Parallel Working, and we study it in its ...
Parallel batch scheduling has many applications in the industrial sector, like in material and chemi...
This paper presents the problem of batching and scheduling jobs belonging to incompatible job famili...
[[abstract]]There is a set of jobs available to process in batches on a set of identical parallel ma...
This paper addresses a specific class of scheduling parallel batching problem, which is observed in ...
The problem of scheduling batch processors is important in some industries and, at a more fundamenta...
Batch processing machines that can process a group of jobs simultaneously are often encountered in s...
This research analyzes the problem of scheduling a set of n jobs with arbitrary job sizes and non-ze...
This paper is concerned with scheduling independent jobs on m parallel machines in such a way that t...
We consider the problem of scheduling heterogeneous batch processors (i.e., batch processors with di...
This dataset contains the following instance sets from the Master's Thesis and Journal Paper "Exact...
AbstractThis paper presents a new approach for transforming MRP orders, planned periodically, e.g. o...
The problem of scheduling G groups of jobs on m parallel machines is considered. Each group consists...