X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
nonidentical job sizes (36) 36
algorithms (27) 27
scheduling (22) 22
engineering, manufacturing (20) 20
minimizing makespan (20) 20
operations research & management science (19) 19
batch processing (17) 17
production scheduling (15) 15
computer science, interdisciplinary applications (13) 13
optimization (13) 13
makespan (12) 12
automation & control systems (11) 11
engineering, industrial (11) 11
fertigungszeit (10) 10
verarbeitungsmaschine (10) 10
computer-aided engineering and design (9) 9
engineering (9) 9
genetic algorithm (9) 9
genetic algorithms (9) 9
industrial and production engineering (9) 9
mechanical engineering (9) 9
heuristics (8) 8
processing machine (8) 8
algorithm (7) 7
families (7) 7
heuristic (7) 7
heuristik (7) 7
prozesszeit (7) 7
delivery (6) 6
dynamic programming (6) 6
genetischer algorithmus (6) 6
machinery (6) 6
scheduling problem (6) 6
times (6) 6
analysis (5) 5
approximation algorithms (5) 5
batch processing machine (5) 5
batch processing machines (5) 5
beschickungsanlage (5) 5
completion-time (5) 5
computer science, artificial intelligence (5) 5
magneto-electric machines (5) 5
mathematics (5) 5
processing machines (5) 5
production/logistics (5) 5
shop (5) 5
stapelfertigung (5) 5
studies (5) 5
total weighted tardiness (5) 5
ameisen-kolonie-optimierung (4) 4
ameisen-kolonie-optimierungsalgorithmus (4) 4
arrivals (4) 4
batch scheduling (4) 4
batch-processing machine (4) 4
burn-in oven (4) 4
computer science (4) 4
coordination (4) 4
distribution (4) 4
dynamische programmierung (4) 4
gemischt-ganzzahlige programmierung (4) 4
makespan minimization (4) 4
operations research/decision theory (4) 4
particle swarm optimization (4) 4
production (4) 4
production/logistics/supply chain (4) 4
simulated annealing (4) 4
time (4) 4
total completion-time (4) 4
2-machine flowshop (3) 3
artificial intelligence (3) 3
burn-in operations (3) 3
completion time (3) 3
computer science, theory & methods (3) 3
flow shop (3) 3
flowshop (3) 3
heuristic methods (3) 3
heuristisches verfahren (3) 3
local search (3) 3
lower bounds (3) 3
mathematical models (3) 3
mathematical optimization (3) 3
mixed integer (3) 3
nonidentical processors (3) 3
parallelmaschine (3) 3
release dates (3) 3
schedules (3) 3
single-machine (3) 3
traveling salesman problem (3) 3
untergrenze (3) 3
ant colony optimization (2) 2
approximation algorithm (2) 2
article subject (2) 2
batch machine (2) 2
batch-processing machines (2) 2
branch and bound (2) 2
branch-and-bound-methode (2) 2
burn-in (2) 2
business schools (2) 2
circuit boards (2) 2
common due-date (2) 2
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


The International Journal of Advanced Manufacturing Technology, ISSN 0268-3768, 3/2010, Volume 47, Issue 1, pp. 259 - 268
Journal Article
Computers & Industrial Engineering, ISSN 0360-8352, 11/2018, Volume 125, pp. 298 - 308
To address the problem of minimizing the total weighted completion time on parallel batch processing machines with identical machine capacities, non-identical... 
Patch processing machines | Total weighted completion time | Parallel scheduling | Ant colony optimization algorithm | Non-identical job sizes | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | MAXIMUM LATENESS | PROCESSING MACHINE | MAKESPAN MINIMIZATION | ENGINEERING, INDUSTRIAL | NONIDENTICAL JOB SIZES | GENETIC ALGORITHM
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 04/2017, Volume 258, Issue 1, pp. 104 - 112
We consider the problem of scheduling a set of jobs on a single batch-processing machine. Each job has a size and a processing time. The jobs are batched... 
Approximation algorithms | Batch-processing machines | Inventory | Production | Distribution | PROCESSING MACHINES | CAPACITY | TIMES | MAKESPAN | FLOW-SHOP | COORDINATION | ALGORITHMS | NONIDENTICAL JOB SIZES | DELIVERY | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SUPPLY-CHAIN | Scheduling (Management) | Problem solving | Inventory control | Analysis | Algorithms
Journal Article
Computers & Industrial Engineering, ISSN 0360-8352, 05/2015, Volume 83, pp. 217 - 225
In this paper, we consider an integrated scheduling problem of production and distribution for manufacturers. In the production part, the batch-processing... 
Ant colony optimization | Scheduling | Heuristics | Production | Distribution | SYSTEM | SINGLE-MACHINE | MAKESPAN | COORDINATION | NONIDENTICAL JOB SIZES | DELIVERY | GENETIC ALGORITHMS | SHOP | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | BATCH PROCESSING MACHINE | ENGINEERING, INDUSTRIAL | SUPPLY-CHAIN | Lower bounds | Running | Cost engineering | Automotive components | Optimization | Heuristic
Journal Article
International Journal of Production Economics, ISSN 0925-5273, 02/2018, Volume 196, pp. 113 - 121
We study the problem of minimizing the makespan for jobs on a single batch processing machine (BPM). A BMP can process several jobs as a batch simultaneously.... 
Batch processing machine (BPM) | Biased random-key genetic algorithm (BRKGA) | Scheduling | Bin loading problem | Two-dimensional bin packing problem (2D-BPP) | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | ALGORITHM | ENGINEERING, MANUFACTURING | MINIMIZING MAKESPAN | ENGINEERING, INDUSTRIAL | NONIDENTICAL JOB SIZES | Algorithms
Journal Article
Applied Soft Computing Journal, ISSN 1568-4946, 12/2017, Volume 61, pp. 174 - 192
Journal Article
Computers and Operations Research, ISSN 0305-0548, 04/2017, Volume 80, pp. 173 - 183
Journal Article
International Journal of Production Research, ISSN 0020-7543, 01/2017, Volume 55, Issue 1, pp. 176 - 186
Journal Article
Expert Systems With Applications, ISSN 0957-4174, 04/2018, Volume 95, pp. 224 - 235
Journal Article
Computers and Operations Research, ISSN 0305-0548, 11/2015, Volume 63, pp. 125 - 135
Journal Article
Mathematical Problems in Engineering, ISSN 1024-123X, 2018, Volume 2018, pp. 1 - 10
The problem of minimizing the makespan on single batch processing machine is studied in this paper. Both job sizes and processing time are nonidentical and the... 
MATHEMATICS, INTERDISCIPLINARY APPLICATIONS | ENGINEERING, MULTIDISCIPLINARY | MINIMIZING MAKESPAN | NONIDENTICAL JOB SIZES | Comparative analysis | Methods | Algorithms | Studies | Problems | Search methods | Performance enhancement | Production scheduling | Batch processing | Genetic algorithms
Journal Article
Robotics and Computer Integrated Manufacturing, ISSN 0736-5845, 2009, Volume 25, Issue 3, pp. 667 - 679
This paper aims at minimizing the makespan of two batch-processing machines in a flow shop. The processing times and the sizes of the jobs are known and... 
Scheduling | Flow shop | Batch-processing machines | Heuristics | Simulated annealing | COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS | ROBOTICS | TIMES | ALGORITHMS | ENGINEERING, MANUFACTURING | NONIDENTICAL JOB SIZES | Algorithms
Journal Article
Naval Research Logistics (NRL), ISSN 0894-069X, 09/2015, Volume 62, Issue 6, pp. 470 - 482
Journal Article
Optimization Letters, ISSN 1862-4472, 10/2018, Volume 12, Issue 7, pp. 1609 - 1623
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 2010, Volume 411, Issue 7, pp. 1140 - 1145
In this paper, we consider the problem of scheduling with release dates and rejection on a single parallel batching machine, where the jobs have non-identical... 
Rejection | Release date | Scheduling | Parallel batching | Job size | PTAS | TIMES | PROCESSING MACHINE | COMPUTER SCIENCE, THEORY & METHODS | RELEASE DATES | NONIDENTICAL JOB SIZES
Journal Article