Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families

From MaRDI portal
Publication:4671312

DOI10.1080/00207540410001704041zbMath1060.90643OpenAlexW2092016688MaRDI QIDQ4671312

Pyung-Hoi Koo, Jae-Won Ha, Woon-Seek Lee, Shie-Gheun Koh

Publication date: 26 April 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540410001704041




Related Items

An effective formulation for optimal scheduling of multistage multi-product batch plant based on due datesIntegrated production and transportation on parallel batch machines to minimize total weighted delivery timeIntegrated scheduling on parallel batch processing machines with non-identical capacitiesIntegrated production and delivery on parallel batching machinesScheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready timesScheduling parallel-machine batch operations to maximize on-time delivery performanceScheduling a single parallel-batching machine with non-identical job sizes and incompatible job familiesA reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problemsJust-in-time single-batch-processing machine schedulingApproximation algorithms for scheduling jobs with release times and arbitrary sizes on batch machines with non-identical capacitiesMILP models to minimise makespan in additive manufacturing machine scheduling problemsHeuristics and lower bound for minimizing maximum lateness on a batch processing machine with incompatible job familiesA hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizesA branch and price algorithm to minimize makespan on a single batch processing machine with non-identical job sizesDynamic scheduling of batch-processing machines with non-identical product sizesA memetic algorithm for minimizing total weighted tardiness on parallel batch machines with incompatible job families and dynamic job arrivalOrder acceptance using genetic algorithmsA survey of scheduling with parallel batch (p-batch) processing



Cites Work