Control of a batch-processing machine: A computational approach

DOI10.1080/002075498192355zbMath0946.90510MaRDI QIDQ4245710

Athanassios N. Avramidis, Reha Uzsoy, Kevin J. Healy

Publication date: 25 October 2000

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

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

Mathematics Subject Classification ID

90B30: Production models

Related Items

Dynamic scheduling of batch servers with compatible product families, Scheduling parallel batch processing machines with arbitrary job sizes and incompatible job families, Learning effective dispatching rules for batch processor scheduling, Online algorithms for scheduling unit length jobs on parallel-batch machines with lookahead, Online over time scheduling on parallel-batch machines: a survey, Rapid modeling and discovery of priority dispatching rules: An autonomous learning approach, Online scheduling on unbounded parallel-batch machines to minimize the makespan, Makespan minimization on single batch-processing machine via ant colony optimization, Online scheduling on unbounded parallel-batch machines to minimize maximum flow-time, Online scheduling of incompatible unit-length job families with lookahead, A BEST POSSIBLE ONLINE ALGORITHM FOR SCHEDULING TO MINIMIZE MAXIMUM FLOW-TIME ON BOUNDED BATCH MACHINES, Dynamic control of the batch processor in a serial-batch processor system with mean tardiness performance