Scheduling reentrant jobs on parallel machines with a remote server

DOI10.1016/j.cor.2008.11.007zbMath1179.90130OpenAlexW2012273460MaRDI QIDQ1010265

Celia A. Dr. Glass, Konstantin Chakhlevitch

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://openaccess.city.ac.uk/id/eprint/2374/1/30-StatResRep.pdf

zbMATH Keywords

schedulingparallel identical machinesmicrobiology laboratoryreentrant jobsremote server

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

• Parallel machine scheduling problems with a single server
• A heuristic algorithm for two-machine re-entrant shop scheduling
• Parallel machine scheduling with a common server
• Complexity results for parallel machine problems with a single server
• Scheduling with batching: A review
• Scheduling two parallel machines with a single server: the general case
• Optimal two- and three-stage production schedules with setup times included
• Minimizing Makespan in a Class of Reentrant Shops
• Scheduling for parallel dedicated machines with a single server
• Scheduling parallel machines with a single server: Some solvable cases and heuristics

This page was built for publication: Scheduling reentrant jobs on parallel machines with a remote server