Mixed batch scheduling with non-identical job sizes to minimize makespan
- 8 June 2024
- journal article
- research article
- Published by Springer Nature in OR Spectrum
- Vol. 47 (1) , 105-127
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (52105529, 52075453, 71931007)
- Fundamental Research Funds for the Central Universities (ZYTS24049)
This publication has 22 references indexed in Scilit:
- Exact algorithms to minimize makespan on single and parallel batch processing machinesEuropean Journal of Operational Research, 2020
- Serial-batching scheduling with two agents to minimize makespan and maximum costJournal of Scheduling, 2020
- Mixed batch scheduling on identical machinesJournal of Scheduling, 2019
- Approximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacitiesEuropean Journal of Operational Research, 2017
- A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizesEuropean Journal of Operational Research, 2015
- Improved bounds for batch scheduling with nonidentical job sizesNaval Research Logistics (NRL), 2014
- Solving the serial batching problem in job shop manufacturing systemsEuropean Journal of Operational Research, 2012
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizesComputers & Operations Research, 2008
- Minimizing makespan on a single batch processing machine with nonidentical job sizesNaval Research Logistics (NRL), 2001
- Batch sizing and job sequencing on a single machineAnnals of Operations Research, 1990