Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
From MaRDI portal
Publication:2935125
DOI10.1080/00207721.2011.577250zbMath1304.90090OpenAlexW1989001841MaRDI QIDQ2935125
Ba-Yi Cheng, Ying Ma, Shan-Lin Yang
Publication date: 22 December 2014
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207721.2011.577250
Deterministic scheduling theory in operations research (90B35) Complexity and performance of numerical algorithms (65Y20)
Related Items
Clarifying cutting and sewing processes with due windows using an effective ant colony optimization ⋮ Neighbourhood generation mechanism applied in simulated annealing to job shop scheduling problems ⋮ Online batch scheduling of equal-length jobs on two identical batch machines to maximise the number of early jobs
Cites Work
- A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
- A branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizes
- A note on minimizing makespan on a single batch processing machine with nonidentical job sizes
- Genetic algorithms to minimize the weighted number of late jobs on a single machine.
- Minimizing makespan on a single batching machine with release times and non-identical job sizes
- Minimizing makespan on a single batch processing machine with nonidentical job sizes
- Online scheduling on batching machines to minimise the total weighted completion time of jobs with precedence constraints and identical processing times
- Parallel machine scheduling problems with proportionally deteriorating jobs
- Scheduling a single batch processing machine with non-identical job sizes
- Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure
This page was built for publication: Minimising makespan for two batch-processing machines with non-identical job sizes in job shop
