Non-identical parallel machines batch processing problem to minimize the makespan : models and algorithms
| Year of publication: |
2024
|
|---|---|
| Authors: | Beldar, Pedram ; Battarra, Maria ; Laporte, Gilbert |
| Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 168.2024, Art.-No. 106708, p. 1-13
|
| Subject: | Batch processing machines | Makespan minimization | Parallel machines | Variable neighborhood search | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Theorie | Theory | Algorithmus | Algorithm | Produktionssteuerung | Production control | Rechnerbetrieb | Computer operations | Heuristik | Heuristics | Operations Research | Operations research |
-
An adaptive penalty guided genetic algorithm for scheduling parallel batch processing machines
Xu, Shubin, (2018)
-
Zhou, Shengchao, (2016)
-
Exact algorithms to minimize makespan on single and parallel batch processing machines
Muter, İbrahim, (2020)
- More ...
-
Algorithms for the Calzedonia workload allocation problem
Battarra, Maria, (2021)
-
Pallet location and job scheduling in a Twin-Robot system
Thomasson, Oliver, (2022)
-
The traveling salesman problem with pickups, deliveries, and handling costs
Battarra, Maria, (2010)
- More ...